Nuprl Lemma : es-le-before-split-last
∀[es:EO]. ∀[e:E]. ≤loc(e) ~ ≤loc(pred(e)) @ [e] supposing ¬↑first(e)
Proof
Definitions occuring in Statement :
es-le-before: ≤loc(e),
es-first: first(e),
es-pred: pred(e),
es-E: E,
event_ordering: EO,
append: as @ bs,
cons: [a / b],
nil: [],
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-le-before: ≤loc(e),
prop: ℙ
Latex:
\mforall{}[es:EO]. \mforall{}[e:E]. \mleq{}loc(e) \msim{} \mleq{}loc(pred(e)) @ [e] supposing \mneg{}\muparrow{}first(e)
Date html generated:
2016_05_16-AM-09_34_47
Last ObjectModification:
2015_12_28-PM-09_45_47
Theory : new!event-ordering
Home
Index