Nuprl Lemma : es-causl-total-base
∀es:EO. ∀e,e':es-base-E(es). (e = e' ∈ es-base-E(es)) ∨ (e < e') ∨ (e' < e) supposing loc(e) = loc(e') ∈ Id
Proof
Definitions occuring in Statement :
es-causl: (e < e'),
es-loc: loc(e),
es-base-E: es-base-E(es),
event_ordering: EO,
Id: Id,
uimplies: b supposing a,
all: ∀x:A. B[x],
or: P ∨ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
implies: P ⇒ Q,
decidable: Dec(P),
or: P ∨ Q,
and: P ∧ Q,
iff: P ⇐⇒ Q,
guard: {T},
prop: ℙ,
not: ¬A
Latex:
\mforall{}es:EO. \mforall{}e,e':es-base-E(es). (e = e') \mvee{} (e < e') \mvee{} (e' < e) supposing loc(e) = loc(e')
Date html generated:
2016_05_16-AM-09_15_11
Last ObjectModification:
2015_12_28-PM-09_58_56
Theory : new!event-ordering
Home
Index