Nuprl Lemma : es-interface-or-getleft
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[A,B:EClass(Top)]. ∀[e:E]. oob-getleft((A | B)(e)) ~ A(e) supposing ↑e ∈b A
Proof
Definitions occuring in Statement :
es-interface-or: (X | Y),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
sqequal: s ~ t,
oob-getleft: oob-getleft(x)
Definitions unfolded in proof :
eclass-val: X(e),
es-interface-or: (X | Y),
in-eclass: e ∈b X,
oob-apply: oob-apply(xs;ys),
eclass-compose2: eclass-compose2(f;X;Y),
member: t ∈ T,
uall: ∀[x:A]. B[x],
eclass: EClass(A[eo; e]),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
nat: ℕ,
assert: ↑b,
ifthenelse: if b then t else f fi ,
top: Top,
oob-getleft: oob-getleft(x),
oobleft?: oobleft?(x),
oobleft-lval: oobleft-lval(x),
oobboth-bval: oobboth-bval(x),
so_lambda: λ2x.t[x],
so_apply: x[s],
bfalse: ff,
pi1: fst(t),
prop: ℙ,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
false: False,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[A,B:EClass(Top)]. \mforall{}[e:E].
oob-getleft((A | B)(e)) \msim{} A(e) supposing \muparrow{}e \mmember{}\msubb{} A
Date html generated:
2016_05_16-PM-10_43_38
Last ObjectModification:
2015_12_29-AM-10_53_03
Theory : event-ordering
Home
Index