Step
*
of Lemma
map_wf_combination
∀[A,B:Type]. ∀[f:A ⟶ B]. ∀[n:ℤ]. ∀[L:Combination(n;A)]. (map(f;L) ∈ Combination(n;B)) supposing Inj(A;B;f)
BY
{ xxx(Unfold `combination` 0 THEN Auto)xxx }
1
1. A : Type
2. B : Type
3. f : A ⟶ B
4. Inj(A;B;f)
5. n : ℤ
6. L : {L:A List| no_repeats(A;L) ∧ (||L|| = n ∈ ℤ)}
⊢ map(f;L) ∈ {L:B List| no_repeats(B;L) ∧ (||L|| = n ∈ ℤ)}
Latex:
Latex:
\mforall{}[A,B:Type]. \mforall{}[f:A {}\mrightarrow{} B].
\mforall{}[n:\mBbbZ{}]. \mforall{}[L:Combination(n;A)]. (map(f;L) \mmember{} Combination(n;B)) supposing Inj(A;B;f)
By
Latex:
xxx(Unfold `combination` 0 THEN Auto)xxx
Home
Index