Nuprl Lemma : es-le-prior-interface-val
∀[Info:Type]. ∀es:EO+(Info). ∀X:EClass(Top). ∀e:E. ∀e':E(X). ((e' <loc e) ⇒ e' ≤loc prior(X)(e) )
Proof
Definitions occuring in Statement :
es-prior-interface: prior(X),
es-E-interface: E(X),
eclass-val: X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
es-E: E,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
exists: ∃x:A. B[x],
cand: A c∧ B,
es-E-interface: E(X),
uimplies: b supposing a,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
prop: ℙ,
subtype_rel: A ⊆r B,
decidable: Dec(P),
or: P ∨ Q,
not: ¬A,
es-locl: (e <loc e'),
false: False,
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{}e':E(X). ((e' <loc e) {}\mRightarrow{} e' \mleq{}loc prior(X)(e) )
Date html generated:
2016_05_16-PM-11_57_59
Last ObjectModification:
2015_12_29-AM-01_00_16
Theory : event-ordering
Home
Index