Nuprl Lemma : es-locl-not-le
∀es:EO. ∀e,e':E. (e <loc e') ⇐⇒ ¬e' ≤loc e supposing loc(e) = loc(e') ∈ Id
Proof
Definitions occuring in Statement :
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uimplies: b supposing a,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
not: ¬A,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
not: ¬A,
false: False,
guard: {T},
uall: ∀[x:A]. B[x],
prop: ℙ,
rev_implies: P ⇐ Q,
decidable: Dec(P),
or: P ∨ Q,
es-locl: (e <loc e'),
es-causl: (e < e'),
squash: ↓T
Latex:
\mforall{}es:EO. \mforall{}e,e':E. (e <loc e') \mLeftarrow{}{}\mRightarrow{} \mneg{}e' \mleq{}loc e supposing loc(e) = loc(e')
Date html generated:
2016_05_16-AM-09_28_39
Last ObjectModification:
2016_01_17-PM-01_30_08
Theory : new!event-ordering
Home
Index