Nuprl Lemma : es-interface-predecessors-nonnull
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E(X)]. (null(≤(X)(e)) ~ ff)
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
null: null(as),
bfalse: ff,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
es-E-interface: E(X),
all: ∀x:A. B[x],
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
false: False,
and: P ∧ Q,
cons: [a / b],
top: Top
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E(X)]. (null(\mleq{}(X)(e)) \msim{} ff)
Date html generated:
2016_05_16-PM-11_03_24
Last ObjectModification:
2015_12_29-AM-10_40_29
Theory : event-ordering
Home
Index