Step
*
1
1
1
1
1
of Lemma
combination_functionality
1. A : Type
2. B : Type
3. m : ℤ
4. f : A ⟶ B
5. Bij(A;B;f)
6. g : B ⟶ A
7. ∀b:B. ((f (g b)) = b ∈ B)
8. ∀a:A. ((g (f a)) = a ∈ A)
9. a1 : Combination(m;A)
10. a2 : Combination(m;A)
11. map(f;a1) = map(f;a2) ∈ Combination(m;B)
12. a1 = a2 ∈ (A List)
⊢ a1 = a2 ∈ Combination(m;A)
BY
{ xxx(DVar `a1' THEN MemTypeCD THEN Auto)xxx }
Latex:
Latex:
1. A : Type
2. B : Type
3. m : \mBbbZ{}
4. f : A {}\mrightarrow{} B
5. Bij(A;B;f)
6. g : B {}\mrightarrow{} A
7. \mforall{}b:B. ((f (g b)) = b)
8. \mforall{}a:A. ((g (f a)) = a)
9. a1 : Combination(m;A)
10. a2 : Combination(m;A)
11. map(f;a1) = map(f;a2)
12. a1 = a2
\mvdash{} a1 = a2
By
Latex:
xxx(DVar `a1' THEN MemTypeCD THEN Auto)xxx
Home
Index