Nuprl Lemma : es-init-le-iff
∀es:EO. ∀e,e':E. (es-init(es;e) ≤loc e' ⇐⇒ loc(e') = loc(e) ∈ Id)
Proof
Definitions occuring in Statement :
es-init: es-init(es;e),
es-le: e ≤loc e' ,
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ,
rev_implies: P ⇐ Q,
true: True
Latex:
\mforall{}es:EO. \mforall{}e,e':E. (es-init(es;e) \mleq{}loc e' \mLeftarrow{}{}\mRightarrow{} loc(e') = loc(e))
Date html generated:
2016_05_16-AM-09_40_09
Last ObjectModification:
2015_12_28-PM-09_42_51
Theory : new!event-ordering
Home
Index