Nuprl Lemma : es-le-before-partition2
∀[es:EO]. ∀[e,a:E]. (≤loc(e) = (≤loc(pred(a)) @ [a, e]) ∈ (E List)) supposing ((¬↑first(a)) and a ≤loc e )
Proof
Definitions occuring in Statement :
es-interval: [e, e'],
es-le-before: ≤loc(e),
es-le: e ≤loc e' ,
es-first: first(e),
es-pred: pred(e),
es-E: E,
event_ordering: EO,
append: as @ bs,
list: T List,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
prop: ℙ
Latex:
\mforall{}[es:EO]. \mforall{}[e,a:E]. (\mleq{}loc(e) = (\mleq{}loc(pred(a)) @ [a, e])) supposing ((\mneg{}\muparrow{}first(a)) and a \mleq{}loc e )
Date html generated:
2016_05_16-AM-09_34_42
Last ObjectModification:
2015_12_28-PM-09_45_57
Theory : new!event-ordering
Home
Index