Nuprl Lemma : fpf-restrict-compatible2
∀[A:Type]. ∀[P:A ⟶ 𝔹]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f,g:x:A fp-> B[x]].
f || fpf-restrict(g;P) supposing f || g
Proof
Definitions occuring in Statement :
fpf-restrict: fpf-restrict(f;P),
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
bool: 𝔹,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
fpf-compatible: f || g,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
subtype_rel: A ⊆r B,
top: Top,
prop: ℙ
Latex:
\mforall{}[A:Type]. \mforall{}[P:A {}\mrightarrow{} \mBbbB{}]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g:x:A fp-> B[x]].
f || fpf-restrict(g;P) supposing f || g
Date html generated:
2016_05_16-AM-11_34_08
Last ObjectModification:
2015_12_29-AM-09_29_10
Theory : event-ordering
Home
Index