---

Step * 1 2 of Lemma injections-combinations


1. n : ℕ
2. [T] : Type
3. λf.mklist(n;f) ∈ ℕn →⟶ T ⟶ Combination(n;T)
⊢ ℕn →⟶ T ~ Combination(n;T)
BY
{ TACTIC:(With ⌜λf.mklist(n;f)⌝ (D 0)⋅ THEN Auto) }

1
1. n : ℕ
2. [T] : Type
3. λf.mklist(n;f) ∈ ℕn →⟶ T ⟶ Combination(n;T)
⊢ Bij(ℕn →⟶ T;Combination(n;T);λf.mklist(n;f))

---

Latex:

---

Latex:

1.  n  :  \mBbbN{}
2.  [T]  :  Type
3.  \mlambda{}f.mklist(n;f)  \mmember{}  \mBbbN{}n  \mrightarrow{}{}\mrightarrow{}  T  {}\mrightarrow{}  Combination(n;T)
\mvdash{}  \mBbbN{}n  \mrightarrow{}{}\mrightarrow{}  T  \msim{}  Combination(n;T)


By

---

Latex:
TACTIC:(With  \mkleeneopen{}\mlambda{}f.mklist(n;f)\mkleeneclose{}  (D  0)\mcdot{}  THEN  Auto)

---

Home Index