Nuprl Lemma : bag-size-map
∀[bs,f:Top]. (#(bag-map(f;bs)) ~ #(bs))
Proof
Definitions occuring in Statement :
bag-size: #(bs),
bag-map: bag-map(f;bs),
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
bag-size: #(bs),
bag-map: bag-map(f;bs),
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top
Lemmas referenced :
map-length,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[bs,f:Top]. (\#(bag-map(f;bs)) \msim{} \#(bs))
Date html generated:
2016_05_15-PM-02_24_58
Last ObjectModification:
2015_12_27-AM-09_53_19
Theory : bags
Home
Index