Nuprl Lemma : lg-append-nil
∀[T:Type]. ∀[g:LabeledGraph(T)]. (lg-append(g;lg-nil()) = g ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
lg-append: lg-append(g1;g2),
lg-nil: lg-nil(),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Lemmas :
map_nil_lemma,
append-nil,
dep-isect-subtype,
list_wf,
top_wf,
int_seg_wf,
length_wf,
labeled-graph_wf
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (lg-append(g;lg-nil()) = g)
Date html generated:
2015_07_22-PM-00_27_48
Last ObjectModification:
2015_01_28-PM-11_32_31
Home
Index