Nuprl Lemma : lg-size-map
∀[T,S:Type]. ∀[f:T ─→ S]. ∀[g:LabeledGraph(T)]. (lg-size(lg-map(f;g)) = lg-size(g) ∈ ℤ)
Proof
Definitions occuring in Statement :
lg-map: lg-map(f;g),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
function: x:A ─→ B[x],
int: ℤ,
universe: Type,
equal: s = t ∈ T
Lemmas :
length_wf_nat,
top_wf,
dep-isect-subtype,
list_wf,
int_seg_wf,
length_wf,
length-map-sq,
nat_wf
Latex:
\mforall{}[T,S:Type]. \mforall{}[f:T {}\mrightarrow{} S]. \mforall{}[g:LabeledGraph(T)]. (lg-size(lg-map(f;g)) = lg-size(g))
Date html generated:
2015_07_23-AM-11_03_26
Last ObjectModification:
2015_01_28-PM-11_33_48
Home
Index