Metamath Proof Explorer


Theorem bcnn

Description: N choose N is 1. Remark in Gleason p. 296. (Contributed by NM, 17-Jun-2005) (Revised by Mario Carneiro, 8-Nov-2013)

Ref Expression
Assertion bcnn ⊢ N ∈ ℕ 0 → ( N N) = 1

Proof

Step Hyp Ref Expression
1 0z ⊢ 0 ∈ ℤ
2 bccmpl ⊢ N ∈ ℕ 0 ∧ 0 ∈ ℤ → ( N 0 ) = ( N N − 0 )
3 1 2 mpan2 ⊢ N ∈ ℕ 0 → ( N 0 ) = ( N N − 0 )
4 bcn0 ⊢ N ∈ ℕ 0 → ( N 0 ) = 1
5 nn0cn ⊢ N ∈ ℕ 0 → N ∈ ℂ
6 5 subid1d ⊢ N ∈ ℕ 0 → N − 0 = N
7 6 oveq2d ⊢ N ∈ ℕ 0 → ( N N − 0 ) = ( N N)
8 3 4 7 3eqtr3rd ⊢ N ∈ ℕ 0 → ( N N) = 1