Metamath Proof Explorer


Theorem bcmax

Description: The binomial coefficient takes its maximum value at the center. (Contributed by Mario Carneiro, 5-Mar-2014)

Ref Expression
Assertion bcmax ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → ( 2 ⋅ N K) ≤ ( 2 ⋅ N N)

Proof

Step Hyp Ref Expression
1 2nn0 ⊢ 2 ∈ ℕ 0
2 simpll ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ N ∈ ℤ ≥ K → N ∈ ℕ 0
3 nn0mulcl ⊢ 2 ∈ ℕ 0 ∧ N ∈ ℕ 0 → 2 ⋅ N ∈ ℕ 0
4 1 2 3 sylancr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ N ∈ ℤ ≥ K → 2 ⋅ N ∈ ℕ 0
5 simpr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ N ∈ ℤ ≥ K → N ∈ ℤ ≥ K
6 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
7 6 leidd ⊢ N ∈ ℕ 0 → N ≤ N
8 nn0cn ⊢ N ∈ ℕ 0 → N ∈ ℂ
9 2cn ⊢ 2 ∈ ℂ
10 2ne0 ⊢ 2 ≠ 0
11 divcan3 ⊢ N ∈ ℂ ∧ 2 ∈ ℂ ∧ 2 ≠ 0 → 2 ⋅ N 2 = N
12 9 10 11 mp3an23 ⊢ N ∈ ℂ → 2 ⋅ N 2 = N
13 8 12 syl ⊢ N ∈ ℕ 0 → 2 ⋅ N 2 = N
14 7 13 breqtrrd ⊢ N ∈ ℕ 0 → N ≤ 2 ⋅ N 2
15 2 14 syl ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ N ∈ ℤ ≥ K → N ≤ 2 ⋅ N 2
16 bcmono ⊢ 2 ⋅ N ∈ ℕ 0 ∧ N ∈ ℤ ≥ K ∧ N ≤ 2 ⋅ N 2 → ( 2 ⋅ N K) ≤ ( 2 ⋅ N N)
17 4 5 15 16 syl3anc ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ N ∈ ℤ ≥ K → ( 2 ⋅ N K) ≤ ( 2 ⋅ N N)
18 simpll ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ∈ ℕ 0
19 1 18 3 sylancr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N ∈ ℕ 0
20 simplr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → K ∈ ℤ
21 bccmpl ⊢ 2 ⋅ N ∈ ℕ 0 ∧ K ∈ ℤ → ( 2 ⋅ N K) = ( 2 ⋅ N 2 ⋅ N − K)
22 19 20 21 syl2anc ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → ( 2 ⋅ N K) = ( 2 ⋅ N 2 ⋅ N − K)
23 18 nn0red ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ∈ ℝ
24 23 recnd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ∈ ℂ
25 24 2timesd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N = N + N
26 20 zred ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → K ∈ ℝ
27 eluzle ⊢ K ∈ ℤ ≥ N → N ≤ K
28 27 adantl ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ≤ K
29 23 26 23 28 leadd2dd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N + N ≤ N + K
30 25 29 eqbrtrd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N ≤ N + K
31 19 nn0red ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N ∈ ℝ
32 31 26 23 lesubaddd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N − K ≤ N ↔ 2 ⋅ N ≤ N + K
33 30 32 mpbird ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N − K ≤ N
34 19 nn0zd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N ∈ ℤ
35 34 20 zsubcld ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → 2 ⋅ N − K ∈ ℤ
36 18 nn0zd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ∈ ℤ
37 eluz ⊢ 2 ⋅ N − K ∈ ℤ ∧ N ∈ ℤ → N ∈ ℤ ≥ 2 ⋅ N − K ↔ 2 ⋅ N − K ≤ N
38 35 36 37 syl2anc ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ∈ ℤ ≥ 2 ⋅ N − K ↔ 2 ⋅ N − K ≤ N
39 33 38 mpbird ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ∈ ℤ ≥ 2 ⋅ N − K
40 18 14 syl ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → N ≤ 2 ⋅ N 2
41 bcmono ⊢ 2 ⋅ N ∈ ℕ 0 ∧ N ∈ ℤ ≥ 2 ⋅ N − K ∧ N ≤ 2 ⋅ N 2 → ( 2 ⋅ N 2 ⋅ N − K) ≤ ( 2 ⋅ N N)
42 19 39 40 41 syl3anc ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → ( 2 ⋅ N 2 ⋅ N − K) ≤ ( 2 ⋅ N N)
43 22 42 eqbrtrd ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ ∧ K ∈ ℤ ≥ N → ( 2 ⋅ N K) ≤ ( 2 ⋅ N N)
44 simpr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → K ∈ ℤ
45 nn0z ⊢ N ∈ ℕ 0 → N ∈ ℤ
46 45 adantr ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → N ∈ ℤ
47 uztric ⊢ K ∈ ℤ ∧ N ∈ ℤ → N ∈ ℤ ≥ K ∨ K ∈ ℤ ≥ N
48 44 46 47 syl2anc ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → N ∈ ℤ ≥ K ∨ K ∈ ℤ ≥ N
49 17 43 48 mpjaodan ⊢ N ∈ ℕ 0 ∧ K ∈ ℤ → ( 2 ⋅ N K) ≤ ( 2 ⋅ N N)