Nuprl Lemma : existse-le_wf
∀[es:EO]. ∀[e':E]. ∀[P:{e:E| loc(e) = loc(e') ∈ Id} ⟶ ℙ]. (∃e≤e'.P[e] ∈ ℙ)
Proof
Definitions occuring in Statement :
existse-le: ∃e≤e'.P[e],
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
existse-le: ∃e≤e'.P[e],
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
prop: ℙ,
cand: A c∧ B,
so_apply: x[s],
uimplies: b supposing a,
subtype_rel: A ⊆r B
Latex:
\mforall{}[es:EO]. \mforall{}[e':E]. \mforall{}[P:\{e:E| loc(e) = loc(e')\} {}\mrightarrow{} \mBbbP{}]. (\mexists{}e\mleq{}e'.P[e] \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-09_40_58
Last ObjectModification:
2015_12_28-PM-09_42_24
Theory : new!event-ordering
Home
Index