lcmineqlem17 - Mathbox for metakunt

	Mathbox for metakunt		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > lcmineqlem17		Structured version Visualization version GIF version

Theorem lcmineqlem17 39744

Description: Inequality of 2^{2n}. (Contributed by metakunt, 29-Apr-2024.)

**Hypothesis**
Ref	Expression
lcmineqlem17.1	⊢ (𝜑 → 𝑁 ∈ ℕ₀)

**Assertion**
Ref	Expression
lcmineqlem17	⊢ (𝜑 → (2↑(2 · 𝑁)) ≤ (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁)))

Proof of Theorem lcmineqlem17 Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		2nn0 12090	. . . . . 6 ⊢ 2 ∈ ℕ₀
2	1	a1i 11	. . . . 5 ⊢ (𝜑 → 2 ∈ ℕ₀)
3		lcmineqlem17.1	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
4	2, 3	nn0mulcld 12138	. . . 4 ⊢ (𝜑 → (2 · 𝑁) ∈ ℕ₀)
5		binom11 15377	. . . 4 ⊢ ((2 · 𝑁) ∈ ℕ₀ → (2↑(2 · 𝑁)) = Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑘))
6	4, 5	syl 17	. . 3 ⊢ (𝜑 → (2↑(2 · 𝑁)) = Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑘))
7		fzfid 13529	. . . 4 ⊢ (𝜑 → (0...(2 · 𝑁)) ∈ Fin)
8	4	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → (2 · 𝑁) ∈ ℕ₀)
9		elfzelz 13095	. . . . . . . 8 ⊢ (𝑘 ∈ (0...(2 · 𝑁)) → 𝑘 ∈ ℤ)
10	9	adantl 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → 𝑘 ∈ ℤ)
11	8, 10	jca 515	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁) ∈ ℕ₀ ∧ 𝑘 ∈ ℤ))
12		bccl 13871	. . . . . 6 ⊢ (((2 · 𝑁) ∈ ℕ₀ ∧ 𝑘 ∈ ℤ) → ((2 · 𝑁)C𝑘) ∈ ℕ₀)
13	11, 12	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑘) ∈ ℕ₀)
14	13	nn0red 12134	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑘) ∈ ℝ)
15	3	nn0zd 12263	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℤ)
16		bccl 13871	. . . . . . 7 ⊢ (((2 · 𝑁) ∈ ℕ₀ ∧ 𝑁 ∈ ℤ) → ((2 · 𝑁)C𝑁) ∈ ℕ₀)
17	4, 15, 16	syl2anc 587	. . . . . 6 ⊢ (𝜑 → ((2 · 𝑁)C𝑁) ∈ ℕ₀)
18	17	nn0red 12134	. . . . 5 ⊢ (𝜑 → ((2 · 𝑁)C𝑁) ∈ ℝ)
19	18	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑁) ∈ ℝ)
20		bcmax 26131	. . . . 5 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝑘 ∈ ℤ) → ((2 · 𝑁)C𝑘) ≤ ((2 · 𝑁)C𝑁))
21	3, 9, 20	syl2an 599	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (0...(2 · 𝑁))) → ((2 · 𝑁)C𝑘) ≤ ((2 · 𝑁)C𝑁))
22	7, 14, 19, 21	fsumle 15344	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑘) ≤ Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁))
23	6, 22	eqbrtrd 5065	. 2 ⊢ (𝜑 → (2↑(2 · 𝑁)) ≤ Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁))
24	17	nn0cnd 12135	. . . 4 ⊢ (𝜑 → ((2 · 𝑁)C𝑁) ∈ ℂ)
25		fsumconst 15335	. . . 4 ⊢ (((0...(2 · 𝑁)) ∈ Fin ∧ ((2 · 𝑁)C𝑁) ∈ ℂ) → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁) = ((♯‘(0...(2 · 𝑁))) · ((2 · 𝑁)C𝑁)))
26	7, 24, 25	syl2anc 587	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁) = ((♯‘(0...(2 · 𝑁))) · ((2 · 𝑁)C𝑁)))
27		hashfz0 13982	. . . . 5 ⊢ ((2 · 𝑁) ∈ ℕ₀ → (♯‘(0...(2 · 𝑁))) = ((2 · 𝑁) + 1))
28	4, 27	syl 17	. . . 4 ⊢ (𝜑 → (♯‘(0...(2 · 𝑁))) = ((2 · 𝑁) + 1))
29	28	oveq1d 7217	. . 3 ⊢ (𝜑 → ((♯‘(0...(2 · 𝑁))) · ((2 · 𝑁)C𝑁)) = (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁)))
30	26, 29	eqtrd 2774	. 2 ⊢ (𝜑 → Σ𝑘 ∈ (0...(2 · 𝑁))((2 · 𝑁)C𝑁) = (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁)))
31	23, 30	breqtrd 5069	1 ⊢ (𝜑 → (2↑(2 · 𝑁)) ≤ (((2 · 𝑁) + 1) · ((2 · 𝑁)C𝑁)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 = wceq 1543 ∈ wcel 2110 class class class wbr 5043 ‘cfv 6369 (class class class)co 7202 Fincfn 8615 ℂcc 10710 ℝcr 10711 0cc0 10712 1c1 10713 + caddc 10715 · cmul 10717 ≤ cle 10851 2c2 11868 ℕ₀cn0 12073 ℤcz 12159 ...cfz 13078 ↑cexp 13618 Ccbc 13851 ♯chash 13879 Σcsu 15232

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-rep 5168 ax-sep 5181 ax-nul 5188 ax-pow 5247 ax-pr 5311 ax-un 7512 ax-inf2 9245 ax-cnex 10768 ax-resscn 10769 ax-1cn 10770 ax-icn 10771 ax-addcl 10772 ax-addrcl 10773 ax-mulcl 10774 ax-mulrcl 10775 ax-mulcom 10776 ax-addass 10777 ax-mulass 10778 ax-distr 10779 ax-i2m1 10780 ax-1ne0 10781 ax-1rid 10782 ax-rnegex 10783 ax-rrecex 10784 ax-cnre 10785 ax-pre-lttri 10786 ax-pre-lttrn 10787 ax-pre-ltadd 10788 ax-pre-mulgt0 10789 ax-pre-sup 10790

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-nel 3040 df-ral 3059 df-rex 3060 df-reu 3061 df-rmo 3062 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-pss 3876 df-nul 4228 df-if 4430 df-pw 4505 df-sn 4532 df-pr 4534 df-tp 4536 df-op 4538 df-uni 4810 df-int 4850 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-tr 5151 df-id 5444 df-eprel 5449 df-po 5457 df-so 5458 df-fr 5498 df-se 5499 df-we 5500 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-pred 6149 df-ord 6205 df-on 6206 df-lim 6207 df-suc 6208 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-f1 6374 df-fo 6375 df-f1o 6376 df-fv 6377 df-isom 6378 df-riota 7159 df-ov 7205 df-oprab 7206 df-mpo 7207 df-om 7634 df-1st 7750 df-2nd 7751 df-wrecs 8036 df-recs 8097 df-rdg 8135 df-1o 8191 df-er 8380 df-en 8616 df-dom 8617 df-sdom 8618 df-fin 8619 df-sup 9047 df-oi 9115 df-card 9538 df-pnf 10852 df-mnf 10853 df-xr 10854 df-ltxr 10855 df-le 10856 df-sub 11047 df-neg 11048 df-div 11473 df-nn 11814 df-2 11876 df-3 11877 df-n0 12074 df-z 12160 df-uz 12422 df-rp 12570 df-ico 12924 df-fz 13079 df-fzo 13222 df-seq 13558 df-exp 13619 df-fac 13823 df-bc 13852 df-hash 13880 df-cj 14645 df-re 14646 df-im 14647 df-sqrt 14781 df-abs 14782 df-clim 15032 df-sum 15233

This theorem is referenced by: lcmineqlem20 39747

W3C validator