Nuprl Lemma : alle-ge_wf
∀[es:EO]. ∀[e':E]. ∀[P:E ⟶ ℙ]. (∀e≥e'.P[e] ∈ ℙ)
Proof
Definitions occuring in Statement :
alle-ge: ∀e'≥e.P[e'],
es-E: E,
event_ordering: EO,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
alle-ge: ∀e'≥e.P[e'],
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s]
Latex:
\mforall{}[es:EO]. \mforall{}[e':E]. \mforall{}[P:E {}\mrightarrow{} \mBbbP{}]. (\mforall{}e\mgeq{}e'.P[e] \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-09_41_56
Last ObjectModification:
2015_12_28-PM-09_41_34
Theory : new!event-ordering
Home
Index