Nuprl Lemma : eo-forward-bless
∀eo:EO. ∀e:E. ∀a,b:E. (a <loc b ~ a <loc b)
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-bless: e <loc e',
es-E: E,
event_ordering: EO,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
top: Top,
prop: ℙ,
rev_implies: P ⇐ Q,
sq_type: SQType(T),
guard: {T}
Latex:
\mforall{}eo:EO. \mforall{}e:E. \mforall{}a,b:E. (a <loc b \msim{} a <loc b)
Date html generated:
2016_05_16-PM-01_07_17
Last ObjectModification:
2015_12_29-PM-01_49_17
Theory : event-ordering
Home
Index