Nuprl Lemma : es-open-interval-nil
∀[es:EO]. ∀[e,e':E]. (e, e') ~ [] supposing (↑first(e')) ∨ ((¬↑first(e')) ∧ pred(e') ≤loc e )
Proof
Definitions occuring in Statement :
es-open-interval: (e, e'),
es-le: e ≤loc e' ,
es-first: first(e),
es-pred: pred(e),
es-E: E,
event_ordering: EO,
nil: [],
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
not: ¬A,
or: P ∨ Q,
and: P ∧ Q,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
es-open-interval: (e, e'),
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
not: ¬A,
false: False,
or: P ∨ Q,
guard: {T}
Latex:
\mforall{}[es:EO]. \mforall{}[e,e':E]. (e, e') \msim{} [] supposing (\muparrow{}first(e')) \mvee{} ((\mneg{}\muparrow{}first(e')) \mwedge{} pred(e') \mleq{}loc e )
Date html generated:
2016_05_16-AM-09_32_07
Last ObjectModification:
2015_12_28-PM-09_48_03
Theory : new!event-ordering
Home
Index