Nuprl Lemma : lg-size-append

[T:Type]. ∀[g1,g2:LabeledGraph(T)].  (lg-size(lg-append(g1;g2)) (lg-size(g1) lg-size(g2)) ∈ ℤ)


Proof




Definitions occuring in Statement :  lg-append: lg-append(g1;g2) lg-size: lg-size(g) labeled-graph: LabeledGraph(T) uall: [x:A]. B[x] add: m int: universe: Type equal: t ∈ T
Lemmas :  length-append length-map-sq length_wf_nat top_wf dep-isect-subtype list_wf int_seg_wf length_wf labeled-graph_wf

Latex:
\mforall{}[T:Type].  \mforall{}[g1,g2:LabeledGraph(T)].    (lg-size(lg-append(g1;g2))  =  (lg-size(g1)  +  lg-size(g2)))



Date html generated: 2015_07_22-PM-00_28_29
Last ObjectModification: 2015_01_28-PM-11_32_37

Home Index