Nuprl Lemma : eo-forward-le
∀eo:EO. ∀e:E. ∀a,b:E. (a ≤loc b ⇐⇒ a ≤loc b )
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-le: e ≤loc e' ,
es-E: E,
event_ordering: EO,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
member: t ∈ T,
uall: ∀[x:A]. B[x],
top: Top,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
rev_implies: P ⇐ Q,
or: P ∨ Q,
guard: {T},
es-E: E,
es-base-E: es-base-E(es),
es-dom: es-dom(es),
uimplies: b supposing a,
sq_stable: SqStable(P),
squash: ↓T
Latex:
\mforall{}eo:EO. \mforall{}e:E. \mforall{}a,b:E. (a \mleq{}loc b \mLeftarrow{}{}\mRightarrow{} a \mleq{}loc b )
Date html generated:
2016_05_16-PM-01_06_19
Last ObjectModification:
2016_01_17-PM-07_58_10
Theory : event-ordering
Home
Index