Nuprl Lemma : lg-size-add
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[x,y:ℤ]. (lg-size(lg-add(g;x;y)) = lg-size(g) ∈ ℤ)
Proof
Definitions occuring in Statement :
lg-add: lg-add(g;a;b),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
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-add: lg-add(g;a;b),
top: Top,
subtype_rel: A ⊆r B,
nat: ℕ
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[x,y:\mBbbZ{}]. (lg-size(lg-add(g;x;y)) = lg-size(g))
Date html generated:
2016_05_17-AM-10_09_14
Last ObjectModification:
2015_12_29-PM-05_33_34
Theory : process-model
Home
Index