Nuprl Lemma : es-interval-less
∀[es:EO]. ∀[e,e':E]. [e, e'] = ([e, pred(e')] @ [e']) ∈ (E List) supposing (e <loc e')
Proof
Definitions occuring in Statement :
es-interval: [e, e'],
es-locl: (e <loc e'),
es-pred: pred(e),
es-E: E,
event_ordering: EO,
append: as @ bs,
cons: [a / b],
nil: [],
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Lemmas :
es-locl_wf,
es-E_wf,
event_ordering_wf,
es-ble_wf,
es-before_wf,
cons_wf,
nil_wf,
es-pred_wf,
es-locl-first,
assert_elim,
btrue_neq_bfalse,
assert_wf,
es-first_wf2,
filter_append,
bool_wf,
equal-wf-T-base,
bnot_wf,
not_wf,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
append_wf,
filter_wf5,
l_member_wf,
filter_trivial,
l_all_single,
assert-es-ble,
es-pred-locl,
es-le_weakening
\mforall{}[es:EO]. \mforall{}[e,e':E]. [e, e'] = ([e, pred(e')] @ [e']) supposing (e <loc e')
Date html generated:
2015_07_17-AM-08_42_03
Last ObjectModification:
2015_01_27-PM-02_40_54
Home
Index