---

Step * 1 of Lemma injections-combinations


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

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

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

---

Latex:

---

Latex:

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


By

---

Latex:
TACTIC:Assert  \mkleeneopen{}\mlambda{}f.mklist(n;f)  \mmember{}  \mBbbN{}n  \mrightarrow{}{}\mrightarrow{}  T  {}\mrightarrow{}  Combination(n;T)\mkleeneclose{}\mcdot{}

---

Home Index