Nuprl Lemma : bag_map_empty_lemma
∀f:Top. (bag-map(f;{}) ~ {})
Proof
Definitions occuring in Statement :
bag-map: bag-map(f;bs),
empty-bag: {},
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
empty-bag: {},
bag-map: bag-map(f;bs),
top: Top
Lemmas referenced :
top_wf,
map_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}f:Top. (bag-map(f;\{\}) \msim{} \{\})
Date html generated:
2016_05_15-PM-02_22_02
Last ObjectModification:
2015_12_27-AM-09_55_07
Theory : bags
Home
Index