Nuprl Lemma : es-bless-not-ble
∀[es:EO]. ∀[e,e':E]. e <loc e' ~ ¬be' ≤loc e supposing loc(e) = loc(e') ∈ Id
Proof
Definitions occuring in Statement :
es-ble: e ≤loc e',
es-bless: e <loc e',
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
bnot: ¬bb,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
sqequal: s ~ t,
equal: s = t ∈ T
Lemmas :
subtype_base_sq,
bool_wf,
bool_subtype_base,
iff_imp_equal_bool,
es-bless_wf,
bnot_wf,
es-ble_wf,
es-locl_transitivity2,
es-locl_irreflexivity,
es-le_wf,
es-locl_wf,
decidable__es-locl,
es-le-not-locl,
not_wf,
assert-es-bless,
iff_transitivity,
assert_wf,
iff_weakening_uiff,
assert_of_bnot,
assert-es-ble,
iff_wf,
equal_wf,
Id_wf,
es-loc_wf,
es-E_wf,
event_ordering_wf
\mforall{}[es:EO]. \mforall{}[e,e':E]. e <loc e' \msim{} \mneg{}\msubb{}e' \mleq{}loc e supposing loc(e) = loc(e')
Date html generated:
2015_07_17-AM-08_40_05
Last ObjectModification:
2015_01_27-PM-02_40_34
Home
Index