Nuprl Lemma : fpf-join-cap
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> Top]. ∀[x:A]. ∀[z:Top]. (f ⊕ g(x)?z ~ f(x)?g(x)?z)
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
fpf-cap: f(x)?z,
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
or: P ∨ Q,
not: ¬A,
false: False,
rev_implies: P ⇐ Q,
prop: ℙ,
guard: {T},
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> Top]. \mforall{}[x:A]. \mforall{}[z:Top]. (f \moplus{} g(x)?z \msim{} f(x)?g(x)?z)
Date html generated:
2016_05_16-AM-11_11_24
Last ObjectModification:
2015_12_29-AM-09_18_15
Theory : event-ordering
Home
Index