Nuprl Lemma : fpf-sub-join-symmetry
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> B[a]]. f ⊕ g ⊆ g ⊕ f supposing f || g
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-compatible: f || g,
fpf-sub: 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 :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
fpf-sub: f ⊆ g,
all: ∀x:A. B[x],
implies: P ⇒ Q,
cand: A c∧ B,
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
top: Top,
or: P ∨ Q,
guard: {T},
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
fpf-compatible: f || g,
bfalse: ff,
exists: ∃x:A. B[x],
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]]. f \moplus{} g \msubseteq{} g \moplus{} f supposing f || g
Date html generated:
2016_05_16-AM-11_13_44
Last ObjectModification:
2015_12_29-AM-09_20_21
Theory : event-ordering
Home
Index