Nuprl Lemma : decidable__es-p-le-pred
∀es:EO. ∀[P:E ⟶ ℙ]. ((∀e:E. Dec(P e)) ⇒ (∀e,e':E. Dec(es-p-le-pred(es;P) e e')))
Proof
Definitions occuring in Statement :
es-p-le-pred: es-p-le-pred(es;P),
es-E: E,
event_ordering: EO,
decidable: Dec(P),
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
es-p-le-pred: es-p-le-pred(es;P),
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
alle-le: ∀e≤e'.P[e],
alle-at: ∀e@i.P[e],
and: P ∧ Q,
cand: A c∧ B
Latex:
\mforall{}es:EO. \mforall{}[P:E {}\mrightarrow{} \mBbbP{}]. ((\mforall{}e:E. Dec(P e)) {}\mRightarrow{} (\mforall{}e,e':E. Dec(es-p-le-pred(es;P) e e')))
Date html generated:
2016_05_16-AM-10_08_35
Last ObjectModification:
2015_12_28-PM-09_26_29
Theory : new!event-ordering
Home
Index