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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
lg-size: lg-size(g),
lg-map: lg-map(f;g),
labeled-graph: LabeledGraph(T),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
top: Top,
guard: {T},
nat: ℕ
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:
2016_05_17-AM-10_12_18
Last ObjectModification:
2015_12_29-PM-05_31_23
Theory : process-model
Home
Index