Nuprl Lemma : es-le-not-locl
∀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
Lemmas :
es-locl_transitivity2,
es-locl_irreflexivity,
es-locl_wf,
es-le_wf,
not_wf,
equal_wf,
Id_wf,
es-loc_wf,
es-E_wf,
event_ordering_wf,
pes-axioms
\mforall{}es:EO. \mforall{}e,e':E. e \mleq{}loc e' \mLeftarrow{}{}\mRightarrow{} \mneg{}(e' <loc e) supposing loc(e) = loc(e')
Date html generated:
2015_07_17-AM-08_38_13
Last ObjectModification:
2015_01_27-PM-02_57_30
Home
Index