Nuprl Lemma : lg-exists_wf

[T:Type]. ∀[P:T ─→ ℙ]. ∀[G:LabeledGraph(T)].  (lg-exists(G;x.P[x]) ∈ ℙ)


Proof




Definitions occuring in Statement :  lg-exists: lg-exists(G;x.P[x]) labeled-graph: LabeledGraph(T) uall: [x:A]. B[x] prop: so_apply: x[s] member: t ∈ T function: x:A ─→ B[x] universe: Type
Lemmas :  exists_wf int_seg_wf lg-size_wf nat_wf lg-label_wf labeled-graph_wf

Latex:
\mforall{}[T:Type].  \mforall{}[P:T  {}\mrightarrow{}  \mBbbP{}].  \mforall{}[G:LabeledGraph(T)].    (lg-exists(G;x.P[x])  \mmember{}  \mBbbP{})



Date html generated: 2015_07_23-AM-11_04_41
Last ObjectModification: 2015_01_28-PM-11_34_01

Home Index