Step
*
of Lemma
bag-product-no-repeats
∀[A,B:Type]. ∀[as:bag(A)]. ∀[bs:bag(B)].
bag-no-repeats(A × B;as × bs) supposing bag-no-repeats(A;as) ∧ bag-no-repeats(B;bs)
BY
{ (Auto THEN MoveToConcl (-1) THEN MoveToConcl (-2) THEN BagInd 3 THEN Auto) }
1
1. A : Type
2. B : Type
3. bag-no-repeats(A;[])
4. bs : bag(B)
5. bag-no-repeats(B;bs)
⊢ bag-no-repeats(A × B;[] × bs)
2
1. A : Type
2. B : Type
3. u : A
4. v : A List
5. bag-no-repeats(A;v)
⇒ (∀bs:bag(B). (bag-no-repeats(B;bs)
⇒ bag-no-repeats(A × B;v × bs)))
6. bag-no-repeats(A;[u / v])
7. bs : bag(B)
8. bag-no-repeats(B;bs)
⊢ bag-no-repeats(A × B;[u / v] × bs)
Latex:
Latex:
\mforall{}[A,B:Type]. \mforall{}[as:bag(A)]. \mforall{}[bs:bag(B)].
bag-no-repeats(A \mtimes{} B;as \mtimes{} bs) supposing bag-no-repeats(A;as) \mwedge{} bag-no-repeats(B;bs)
By
Latex:
(Auto THEN MoveToConcl (-1) THEN MoveToConcl (-2) THEN BagInd 3 THEN Auto)
Home
Index