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: n + m,
int: ℤ,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
lg-size: lg-size(g),
lg-append: lg-append(g1;g2),
top: Top,
labeled-graph: LabeledGraph(T),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
implies: P ⇒ Q
Latex:
\mforall{}[T:Type]. \mforall{}[g1,g2:LabeledGraph(T)]. (lg-size(lg-append(g1;g2)) = (lg-size(g1) + lg-size(g2)))
Date html generated:
2016_05_17-AM-10_08_49
Last ObjectModification:
2015_12_29-PM-05_33_42
Theory : process-model
Home
Index