Metamath Proof Explorer


Theorem bccl2d

Description: Closure of the binomial coefficient, a deduction version. (Contributed by metakunt, 12-May-2024)

Ref Expression
Hypotheses bccl2d.1 ⊢ φ → N ∈ ℕ
bccl2d.2 ⊢ φ → K ∈ ℕ 0
bccl2d.3 ⊢ φ → K ≤ N
Assertion bccl2d ⊢ φ → ( N K) ∈ ℕ

Proof

Step Hyp Ref Expression
1 bccl2d.1 ⊢ φ → N ∈ ℕ
2 bccl2d.2 ⊢ φ → K ∈ ℕ 0
3 bccl2d.3 ⊢ φ → K ≤ N
4 2 nn0zd ⊢ φ → K ∈ ℤ
5 2 nn0ge0d ⊢ φ → 0 ≤ K
6 4 5 3 3jca ⊢ φ → K ∈ ℤ ∧ 0 ≤ K ∧ K ≤ N
7 1 nnzd ⊢ φ → N ∈ ℤ
8 0z ⊢ 0 ∈ ℤ
9 elfz1 ⊢ 0 ∈ ℤ ∧ N ∈ ℤ → K ∈ 0 … N ↔ K ∈ ℤ ∧ 0 ≤ K ∧ K ≤ N
10 8 9 mpan ⊢ N ∈ ℤ → K ∈ 0 … N ↔ K ∈ ℤ ∧ 0 ≤ K ∧ K ≤ N
11 7 10 syl ⊢ φ → K ∈ 0 … N ↔ K ∈ ℤ ∧ 0 ≤ K ∧ K ≤ N
12 6 11 mpbird ⊢ φ → K ∈ 0 … N
13 bccl2 ⊢ K ∈ 0 … N → ( N K) ∈ ℕ
14 12 13 syl ⊢ φ → ( N K) ∈ ℕ