Nuprl Lemma : fpf-compatible-update3
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f,g,h:a:A fp-> B[a]]. 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),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
and: P ∧ Q,
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
prop: ℙ,
fpf-compatible: f || g,
implies: P ⇒ Q,
iff: P ⇐⇒ Q,
or: P ∨ Q,
not: ¬A,
false: False,
cand: A c∧ B,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g,h:a:A fp-> B[a]].
h \moplus{} f || h \moplus{} g supposing f || g
Date html generated:
2016_05_16-AM-11_29_02
Last ObjectModification:
2015_12_29-AM-09_25_16
Theory : event-ordering
Home
Index