Nuprl Lemma : es-causl-locl
∀the_es:EO. ∀e,e':E. ((e < e') ⇒ (e <loc e') supposing loc(e) = loc(e') ∈ Id)
Proof
Definitions occuring in Statement :
es-locl: (e <loc e'),
es-causl: (e < e'),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
uimplies: b supposing a,
member: t ∈ T,
es-locl: (e <loc e'),
and: P ∧ Q,
es-causl: (e < e'),
squash: ↓T,
prop: ℙ,
uall: ∀[x:A]. B[x]
Latex:
\mforall{}the$_{es}$:EO. \mforall{}e,e':E. ((e < e') {}\mRightarrow{} (e <loc e') supposing loc(e) = loc(e'))
Date html generated:
2016_05_16-AM-09_21_43
Last ObjectModification:
2016_01_17-PM-01_30_29
Theory : new!event-ordering
Home
Index