![]() |
Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > lcmineqlem17 | Structured version Visualization version GIF version |
Description: Inequality of 2^{2n}. (Contributed by metakunt, 29-Apr-2024.) |
Ref | Expression |
---|---|
lcmineqlem17.1 | ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
Ref | Expression |
---|---|
lcmineqlem17 | ⊢ (𝜑 → (2↑(2 · 𝑁)) ≤ (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2nn0 12429 | . . . . . 6 ⊢ 2 ∈ ℕ0 | |
2 | 1 | a1i 11 | . . . . 5 ⊢ (𝜑 → 2 ∈ ℕ0) |
3 | lcmineqlem17.1 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ0) | |
4 | 2, 3 | nn0mulcld 12477 | . . . 4 ⊢ (𝜑 → (2 · 𝑁) ∈ ℕ0) |
5 | binom11 15716 | . . . 4 ⊢ ((2 · 𝑁) ∈ ℕ0 → (2↑(2 · 𝑁)) = Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑘)) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ (𝜑 → (2↑(2 · 𝑁)) = Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑘)) |
7 | fzfid 13877 | . . . 4 ⊢ (𝜑 → (0...(2 · 𝑁)) ∈ Fin) | |
8 | 4 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → (2 · 𝑁) ∈ ℕ0) |
9 | elfzelz 13440 | . . . . . . . 8 ⊢ (𝑘 ∈ (0...(2 · 𝑁)) → 𝑘 ∈ ℤ) | |
10 | 9 | adantl 482 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → 𝑘 ∈ ℤ) |
11 | 8, 10 | jca 512 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁) ∈ ℕ0 ∧ 𝑘 ∈ ℤ)) |
12 | bccl 14221 | . . . . . 6 ⊢ (((2 · 𝑁) ∈ ℕ0 ∧ 𝑘 ∈ ℤ) → ((2 · 𝑁)C𝑘) ∈ ℕ0) | |
13 | 11, 12 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑘) ∈ ℕ0) |
14 | 13 | nn0red 12473 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑘) ∈ ℝ) |
15 | 3 | nn0zd 12524 | . . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
16 | bccl 14221 | . . . . . . 7 ⊢ (((2 · 𝑁) ∈ ℕ0 ∧ 𝑁 ∈ ℤ) → ((2 · 𝑁)C𝑁) ∈ ℕ0) | |
17 | 4, 15, 16 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → ((2 · 𝑁)C𝑁) ∈ ℕ0) |
18 | 17 | nn0red 12473 | . . . . 5 ⊢ (𝜑 → ((2 · 𝑁)C𝑁) ∈ ℝ) |
19 | 18 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑁) ∈ ℝ) |
20 | bcmax 26624 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ ℤ) → ((2 · 𝑁)C𝑘) ≤ ((2 · 𝑁)C𝑁)) | |
21 | 3, 9, 20 | syl2an 596 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑘) ≤ ((2 · 𝑁)C𝑁)) |
22 | 7, 14, 19, 21 | fsumle 15683 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑘) ≤ Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁)) |
23 | 6, 22 | eqbrtrd 5127 | . 2 ⊢ (𝜑 → (2↑(2 · 𝑁)) ≤ Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁)) |
24 | 17 | nn0cnd 12474 | . . . 4 ⊢ (𝜑 → ((2 · 𝑁)C𝑁) ∈ ℂ) |
25 | fsumconst 15674 | . . . 4 ⊢ (((0...(2 · 𝑁)) ∈ Fin ∧ ((2 · 𝑁)C𝑁) ∈ ℂ) → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁) = ((♯‘(0...(2 · 𝑁))) · ((2 · 𝑁)C𝑁))) | |
26 | 7, 24, 25 | syl2anc 584 | . . 3 ⊢ (𝜑 → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁) = ((♯‘(0...(2 · 𝑁))) · ((2 · 𝑁)C𝑁))) |
27 | hashfz0 14331 | . . . . 5 ⊢ ((2 · 𝑁) ∈ ℕ0 → (♯‘(0...(2 · 𝑁))) = ((2 · 𝑁) + 1)) | |
28 | 4, 27 | syl 17 | . . . 4 ⊢ (𝜑 → (♯‘(0...(2 · 𝑁))) = ((2 · 𝑁) + 1)) |
29 | 28 | oveq1d 7371 | . . 3 ⊢ (𝜑 → ((♯‘(0...(2 · 𝑁))) · ((2 · 𝑁)C𝑁)) = (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁))) |
30 | 26, 29 | eqtrd 2776 | . 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁) = (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁))) |
31 | 23, 30 | breqtrd 5131 | 1 ⊢ (𝜑 → (2↑(2 · 𝑁)) ≤ (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 class class class wbr 5105 ‘cfv 6496 (class class class)co 7356 Fincfn 8882 ℂcc 11048 ℝcr 11049 0cc0 11050 1c1 11051 + caddc 11053 · cmul 11055 ≤ cle 11189 2c2 12207 ℕ0cn0 12412 ℤcz 12498 ...cfz 13423 ↑cexp 13966 Ccbc 14201 ♯chash 14229 Σcsu 15569 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-rep 5242 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7671 ax-inf2 9576 ax-cnex 11106 ax-resscn 11107 ax-1cn 11108 ax-icn 11109 ax-addcl 11110 ax-addrcl 11111 ax-mulcl 11112 ax-mulrcl 11113 ax-mulcom 11114 ax-addass 11115 ax-mulass 11116 ax-distr 11117 ax-i2m1 11118 ax-1ne0 11119 ax-1rid 11120 ax-rnegex 11121 ax-rrecex 11122 ax-cnre 11123 ax-pre-lttri 11124 ax-pre-lttrn 11125 ax-pre-ltadd 11126 ax-pre-mulgt0 11127 ax-pre-sup 11128 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-rmo 3353 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-pss 3929 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-int 4908 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-tr 5223 df-id 5531 df-eprel 5537 df-po 5545 df-so 5546 df-fr 5588 df-se 5589 df-we 5590 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-pred 6253 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7312 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7802 df-1st 7920 df-2nd 7921 df-frecs 8211 df-wrecs 8242 df-recs 8316 df-rdg 8355 df-1o 8411 df-er 8647 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-sup 9377 df-oi 9445 df-card 9874 df-pnf 11190 df-mnf 11191 df-xr 11192 df-ltxr 11193 df-le 11194 df-sub 11386 df-neg 11387 df-div 11812 df-nn 12153 df-2 12215 df-3 12216 df-n0 12413 df-z 12499 df-uz 12763 df-rp 12915 df-ico 13269 df-fz 13424 df-fzo 13567 df-seq 13906 df-exp 13967 df-fac 14173 df-bc 14202 df-hash 14230 df-cj 14983 df-re 14984 df-im 14985 df-sqrt 15119 df-abs 15120 df-clim 15369 df-sum 15570 |
This theorem is referenced by: lcmineqlem20 40495 |
Copyright terms: Public domain | W3C validator |