Step
*
1
1
1
3
1
of Lemma
bag-parts'-no-repeats
1. T : Type
2. valueall-type(T)
3. eq : EqDecider(T)
4. x : T
5. bs : bag(T)
6. ¬(bs = {} ∈ bag(T))
7. bag-no-repeats(bag(T) List+;bag-map(λL.[{} / L];bag-parts(eq;bs)))
8. bag-no-repeats(bag(T) List+;[L∈bag-parts(eq;bs)|((#x in hd(L)) =z 0)])
9. z : bag(T) List+
10. z ↓∈ bag-map(λL.[{} / L];bag-parts(eq;bs))
11. z ↓∈ [L∈bag-parts(eq;bs)|((#x in hd(L)) =z 0)]
⊢ False
BY
{ (BagMemberD (-2) THEN BagMemberD(-1)⋅ THEN SquashExRepD⋅) }
1
1. T : Type
2. valueall-type(T)
3. eq : EqDecider(T)
4. x : T
5. bs : bag(T)
6. ¬(bs = {} ∈ bag(T))
7. bag-no-repeats(bag(T) List+;bag-map(λL.[{} / L];bag-parts(eq;bs)))
8. bag-no-repeats(bag(T) List+;[L∈bag-parts(eq;bs)|((#x in hd(L)) =z 0)])
9. z : bag(T) List+
10. v : bag(T) List+
11. v ↓∈ bag-parts(eq;bs)
12. z = [{} / v] ∈ bag(T) List+
13. z ↓∈ bag-parts(eq;bs)
14. ↑((#x in hd(z)) =z 0)
⊢ False
Latex:
Latex:
1. T : Type
2. valueall-type(T)
3. eq : EqDecider(T)
4. x : T
5. bs : bag(T)
6. \mneg{}(bs = \{\})
7. bag-no-repeats(bag(T) List\msupplus{};bag-map(\mlambda{}L.[\{\} / L];bag-parts(eq;bs)))
8. bag-no-repeats(bag(T) List\msupplus{};[L\mmember{}bag-parts(eq;bs)|((\#x in hd(L)) =\msubz{} 0)])
9. z : bag(T) List\msupplus{}
10. z \mdownarrow{}\mmember{} bag-map(\mlambda{}L.[\{\} / L];bag-parts(eq;bs))
11. z \mdownarrow{}\mmember{} [L\mmember{}bag-parts(eq;bs)|((\#x in hd(L)) =\msubz{} 0)]
\mvdash{} False
By
Latex:
(BagMemberD (-2) THEN BagMemberD(-1)\mcdot{} THEN SquashExRepD\mcdot{})
Home
Index