Nuprl Lemma : fpf-compatible-join-iff
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f,g,h:a:A fp-> B[a]].
uiff(h || f ⊕ g;h || f ∧ h || g) supposing f || g
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uiff: uiff(P;Q),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
and: P ∧ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
uiff: uiff(P;Q),
and: P ∧ Q,
fpf-compatible: f || g,
all: ∀x:A. B[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
top: Top,
prop: ℙ,
cand: A c∧ B,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
or: P ∨ Q,
guard: {T},
sq_type: SQType(T),
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g,h:a:A fp-> B[a]].
uiff(h || f \moplus{} g;h || f \mwedge{} h || g) supposing f || g
Date html generated:
2016_05_16-AM-11_28_28
Last ObjectModification:
2015_12_29-AM-09_26_22
Theory : event-ordering
Home
Index