Nuprl Lemma : existse-between1-true
∀es:EO. ∀e1:E. ∀e2:{e:E| loc(e) = loc(e1) ∈ Id} . (∃e∈[e1,e2).True ⇐⇒ (e1 <loc e2))
Proof
Definitions occuring in Statement :
existse-between1: ∃e∈[e1,e2).P[e],
es-locl: (e <loc e'),
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
true: True,
set: {x:A| B[x]} ,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
rev_implies: P ⇐ Q,
existse-between1: ∃e∈[e1,e2).P[e],
exists: ∃x:A. B[x],
cand: A c∧ B,
true: True
Latex:
\mforall{}es:EO. \mforall{}e1:E. \mforall{}e2:\{e:E| loc(e) = loc(e1)\} . (\mexists{}e\mmember{}[e1,e2).True \mLeftarrow{}{}\mRightarrow{} (e1 <loc e2))
Date html generated:
2016_05_16-AM-09_43_59
Last ObjectModification:
2015_12_28-PM-09_39_35
Theory : new!event-ordering
Home
Index