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
Definitions unfolded in proof :
make-lg: make-lg(L),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top
Latex:
\mforall{}[T:Type]. \mforall{}[L:T List]. (make-lg(L) \mmember{} LabeledGraph(T))
Date html generated:
2016_05_17-AM-10_09_06
Last ObjectModification:
2015_12_29-PM-05_33_19
Theory : process-model
Home
Index