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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-interval: [e, e'],
prop: ℙ,
not: ¬A,
implies: P ⇒ Q,
false: False,
es-before: before(e),
all: ∀x:A. B[x],
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
squash: ↓T,
true: True,
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
guard: {T}
Latex:
\mforall{}[es:EO]. \mforall{}[e,e':E]. [e, e'] = ([e, pred(e')] @ [e']) supposing (e <loc e')
Date html generated:
2016_05_16-AM-09_32_52
Last ObjectModification:
2016_01_17-PM-01_29_39
Theory : new!event-ordering
Home
Index