Nuprl Lemma : es-first-since_functionality_wrt_iff
∀es:EO. ∀e1:E. ∀e2:{e:E| loc(e) = loc(e1) ∈ Id} .
∀[p,p':{e:E| loc(e) = loc(e1) ∈ Id} ⟶ ℙ].
((∀e:{e:E| loc(e) = loc(e1) ∈ Id} . (p[e] ⇐⇒ p'[e])) ⇒ (e2 = first e ≥ e1.p[e] ⇐⇒ e2 = first e ≥ e1.p'[e]))
Proof
Definitions occuring in Statement :
es-first-since: e2 = first e ≥ e1.P[e],
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
iff: P ⇐⇒ Q,
and: P ∧ Q,
es-first-since: e2 = first e ≥ e1.P[e],
so_apply: x[s],
member: t ∈ T,
alle-between1: ∀e∈[e1,e2).P[e],
not: ¬A,
uimplies: b supposing a,
rev_implies: P ⇐ Q,
false: False,
prop: ℙ,
so_lambda: λ2x.t[x]
Latex:
\mforall{}es:EO. \mforall{}e1:E. \mforall{}e2:\{e:E| loc(e) = loc(e1)\} .
\mforall{}[p,p':\{e:E| loc(e) = loc(e1)\} {}\mrightarrow{} \mBbbP{}].
((\mforall{}e:\{e:E| loc(e) = loc(e1)\} . (p[e] \mLeftarrow{}{}\mRightarrow{} p'[e]))
{}\mRightarrow{} (e2 = first e \mgeq{} e1.p[e] \mLeftarrow{}{}\mRightarrow{} e2 = first e \mgeq{} e1.p'[e]))
Date html generated:
2016_05_16-AM-09_54_26
Last ObjectModification:
2015_12_28-PM-09_31_43
Theory : new!event-ordering
Home
Index