Nuprl Lemma : es-interface-union-right
∀[Info,A:Type]. ∀[X:EClass(A)]. ∀[Y:EClass(Top)].
(right(Y+X) = X ∈ EClass(A)) supposing (X ⋂ Y = 0 and Singlevalued(X))
Proof
Definitions occuring in Statement :
es-interface-disjoint: X ⋂ Y = 0,
es-interface-union: X+Y,
es-interface-right: right(X),
sv-class: Singlevalued(X),
eclass: EClass(A[eo; e]),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
eclass: EClass(A[eo; e]),
es-interface-union: X+Y,
es-interface-right: right(X),
eclass-compose2: eclass-compose2(f;X;Y),
eclass-compose1: f o X,
in-eclass: e ∈b X,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
top: Top,
eq_int: (i =z j),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
single-bag: {x},
bag-separate: bag-separate(bs),
pi2: snd(t),
bag-mapfilter: bag-mapfilter(f;P;bs),
bag-filter: [x∈b|p[x]],
bag-map: bag-map(f;bs),
isl: isl(x),
empty-bag: {},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
es-interface-disjoint: X ⋂ Y = 0,
not: ¬A,
cand: A c∧ B,
rev_uimplies: rev_uimplies(P;Q),
nat: ℕ,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
bag-only: only(bs),
outr: outr(x)
Latex:
\mforall{}[Info,A:Type]. \mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(Top)].
(right(Y+X) = X) supposing (X \mcap{} Y = 0 and Singlevalued(X))
Date html generated:
2016_05_17-AM-08_08_49
Last ObjectModification:
2016_01_17-PM-02_44_45
Theory : event-ordering
Home
Index