Nuprl Lemma : es-E-interface-conditional
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X,Y:EClass(Top)]. (E([X?Y]) ⊆r {e:E| (↑e ∈b X) ∨ (↑e ∈b Y)} )
Proof
Definitions occuring in Statement :
es-E-interface: E(X),
cond-class: [X?Y],
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
top: Top,
or: P ∨ Q,
set: {x:A| B[x]} ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
es-E-interface: E(X),
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
or: P ∨ Q,
prop: ℙ
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X,Y:EClass(Top)]. (E([X?Y]) \msubseteq{}r \{e:E| (\muparrow{}e \mmember{}\msubb{} X) \mvee{} (\muparrow{}e \mmember{}\msubb{} Y)\} )
Date html generated:
2016_05_16-PM-02_52_05
Last ObjectModification:
2015_12_29-AM-11_23_12
Theory : event-ordering
Home
Index