Step
*
2
1
2
2
of Lemma
combinations_aux_wf
1. n : ℤ
2. 0 < n
3. ∀[b,m:ℕ]. (combinations_aux(b;n - 1;m) ∈ ℕ)
4. ¬(n = 0 ∈ ℤ)
5. b : ℕ
6. m : ℕ
7. m = 0 ∈ ℤ
8. ∀n:ℕ. ∀x:ℤ. (combinations_aux(0;n;x) = 0 ∈ ℤ)
⊢ combinations_aux(b * 0;n - 1;0 - 1) ∈ ℕ
BY
{ ((Subst' b * 0 ~ 0 0 THENA Auto) THEN RWO_sq "-1" 0 THEN Auto) }
Latex:
Latex:
1. n : \mBbbZ{}
2. 0 < n
3. \mforall{}[b,m:\mBbbN{}]. (combinations\_aux(b;n - 1;m) \mmember{} \mBbbN{})
4. \mneg{}(n = 0)
5. b : \mBbbN{}
6. m : \mBbbN{}
7. m = 0
8. \mforall{}n:\mBbbN{}. \mforall{}x:\mBbbZ{}. (combinations\_aux(0;n;x) = 0)
\mvdash{} combinations\_aux(b * 0;n - 1;0 - 1) \mmember{} \mBbbN{}
By
Latex:
((Subst' b * 0 \msim{} 0 0 THENA Auto) THEN RWO\_sq "-1" 0 THEN Auto)
Home
Index