Nuprl Lemma : is-dag_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. (is-dag(g) ∈ ℙ)
Proof
Definitions occuring in Statement :
is-dag: is-dag(g),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Lemmas :
all_wf,
int_seg_wf,
lg-size_wf,
nat_wf,
lg-edge_wf,
less_than_wf,
labeled-graph_wf
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (is-dag(g) \mmember{} \mBbbP{})
Date html generated:
2015_07_22-PM-00_29_45
Last ObjectModification:
2015_01_28-PM-11_33_05
Home
Index