Nuprl Lemma : make-lg_wf
∀[T:Type]. ∀[L:T List]. (make-lg(L) ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
make-lg: make-lg(L),
labeled-graph: LabeledGraph(T),
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Lemmas :
map_wf,
list_wf,
nil_wf,
subtype_rel_list,
top_wf,
int_seg_wf,
length_wf
Latex:
\mforall{}[T:Type]. \mforall{}[L:T List]. (make-lg(L) \mmember{} LabeledGraph(T))
Date html generated:
2015_07_22-PM-00_28_35
Last ObjectModification:
2015_01_28-PM-11_32_38
Home
Index