Nuprl Lemma : es-interface-predecessors-le
∀[Info:Type]. ∀es:EO+(Info). ∀X:EClass(Top). ∀e:E. (∀a∈≤(X)(e).a ≤loc e )
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-E: E,
l_all: (∀x∈L.P[x]),
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
es-interface-predecessors: ≤(X)(e),
member: t ∈ T,
subtype_rel: A ⊆r B,
prop: ℙ,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
es-E-interface: E(X),
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info:Type]. \mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}e:E. (\mforall{}a\mmember{}\mleq{}(X)(e).a \mleq{}loc e )
Date html generated:
2016_05_17-AM-06_52_19
Last ObjectModification:
2015_12_29-AM-00_19_41
Theory : event-ordering
Home
Index