Nuprl Lemma : last-solution_wf
∀[es:EO]. ∀[P:E ⟶ ℙ]. ∀[d:a:E ⟶ Dec(P[a])]. (last-solution(es;P;d) ∈ E ⟶ (E + Top))
Proof
Definitions occuring in Statement :
last-solution: last-solution(es;P;d),
es-E: E,
event_ordering: EO,
decidable: Dec(P),
uall: ∀[x:A]. B[x],
top: Top,
prop: ℙ,
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
union: left + right
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
last-solution: last-solution(es;P;d),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
prop: ℙ,
implies: P ⇒ Q,
so_apply: x[s],
cand: A c∧ B,
and: P ∧ Q,
uimplies: b supposing a,
es-locl: (e <loc e'),
exists: ∃x:A. B[x],
or: P ∨ Q,
top: Top,
pi1: fst(t)
Latex:
\mforall{}[es:EO]. \mforall{}[P:E {}\mrightarrow{} \mBbbP{}]. \mforall{}[d:a:E {}\mrightarrow{} Dec(P[a])]. (last-solution(es;P;d) \mmember{} E {}\mrightarrow{} (E + Top))
Date html generated:
2016_05_16-AM-09_50_50
Last ObjectModification:
2015_12_28-PM-09_36_28
Theory : new!event-ordering
Home
Index