Nuprl Lemma : bag-combine-single-right
∀[A:Type]. ∀[bs:bag(A)]. (⋃x∈bs.{x} ~ bs)
Proof
Definitions occuring in Statement :
bag-combine: ⋃x∈bs.f[x],
single-bag: {x},
bag: bag(T),
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
single-bag: {x}
Lemmas referenced :
bag-combine-unit-right
Rules used in proof :
cut,
lemma_by_obid,
sqequalHypSubstitution,
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
hypothesis
Latex:
\mforall{}[A:Type]. \mforall{}[bs:bag(A)]. (\mcup{}x\mmember{}bs.\{x\} \msim{} bs)
Date html generated:
2016_05_15-PM-02_28_30
Last ObjectModification:
2015_12_27-AM-09_50_20
Theory : bags
Home
Index