Nuprl Lemma : sq_stable__bag-no-repeats
∀[T:Type]. ∀[bs:bag(T)]. SqStable(bag-no-repeats(T;bs))
Proof
Definitions occuring in Statement :
bag-no-repeats: bag-no-repeats(T;bs),
bag: bag(T),
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
bag-no-repeats: bag-no-repeats(T;bs),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
so_apply: x[s],
sq_stable: SqStable(P),
implies: P ⇒ Q,
squash: ↓T,
and: P ∧ Q,
exists: ∃x:A. B[x],
prop: ℙ
Lemmas referenced :
squash_wf,
no_repeats_wf,
list-subtype-bag,
bag_wf,
equal_wf,
and_wf,
list_wf,
exists_wf,
sq_stable__squash
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
lambdaEquality,
applyEquality,
because_Cache,
independent_isectElimination,
dependent_functionElimination,
imageElimination,
imageMemberEquality,
baseClosed,
isect_memberEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[bs:bag(T)]. SqStable(bag-no-repeats(T;bs))
Date html generated:
2016_05_15-PM-02_33_38
Last ObjectModification:
2016_01_16-AM-08_52_40
Theory : bags
Home
Index