Nuprl Lemma : disjoint-union-comb-classrel
∀[Info,A,B:Type]. ∀[X:EClass(A)]. ∀[Y:EClass(B)]. ∀[es:EO+(Info)]. ∀[e:E].
∀v:A + B. uiff(v ∈ X (+) Y(e);((↑isl(v)) ∧ outl(v) ∈ X(e)) ∨ ((¬↑isl(v)) ∧ outr(v) ∈ Y(e)))
Proof
Definitions occuring in Statement :
disjoint-union-comb: X (+) Y,
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
outr: outr(x),
outl: outl(x),
assert: ↑b,
isl: isl(x),
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
not: ¬A,
or: P ∨ Q,
and: P ∧ Q,
union: left + right,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
squash: ↓T,
prop: ℙ,
outl: outl(x),
isl: isl(x),
assert: ↑b,
ifthenelse: if b then t else f fi ,
bfalse: ff,
false: False,
outr: outr(x),
not: ¬A,
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
disjoint-union-comb: X (+) Y,
sq_or: a ↓∨ b,
or: P ∨ Q,
exists: ∃x:A. B[x],
cand: A c∧ B,
sq_type: SQType(T),
guard: {T},
btrue: tt,
true: True,
rev_uimplies: rev_uimplies(P;Q),
sq_stable: SqStable(P)
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E].
\mforall{}v:A + B. uiff(v \mmember{} X (+) Y(e);((\muparrow{}isl(v)) \mwedge{} outl(v) \mmember{} X(e)) \mvee{} ((\mneg{}\muparrow{}isl(v)) \mwedge{} outr(v) \mmember{} Y(e)))
Date html generated:
2016_05_17-AM-09_34_09
Last ObjectModification:
2016_01_17-PM-11_08_06
Theory : classrel!lemmas
Home
Index