Nuprl Lemma : es-le-before-ordered
∀es:EO. ∀e:E. l-ordered(E;x,y.(x <loc y);≤loc(e))
Proof
Definitions occuring in Statement :
es-le-before: ≤loc(e),
es-locl: (e <loc e'),
es-E: E,
event_ordering: EO,
all: ∀x:A. B[x],
l-ordered: l-ordered(T;x,y.R[x; y];L)
Definitions unfolded in proof :
all: ∀x:A. B[x],
l-ordered: l-ordered(T;x,y.R[x; y];L),
implies: P ⇒ Q,
member: t ∈ T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
prop: ℙ,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
uimplies: b supposing a
Latex:
\mforall{}es:EO. \mforall{}e:E. l-ordered(E;x,y.(x <loc y);\mleq{}loc(e))
Date html generated:
2016_05_16-AM-09_31_06
Last ObjectModification:
2015_12_28-PM-09_48_56
Theory : new!event-ordering
Home
Index