| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nicomachus | Structured version Visualization version GIF version | ||
| Description: Nicomachus's Theorem. The sum of the odd numbers from 𝑁↑2 − 𝑁 + 1 to 𝑁↑2 + 𝑁 − 1 is 𝑁↑3. Proof 2 from https://proofwiki.org/wiki/Nicomachus%27s_Theorem. (Contributed by SN, 21-Mar-2025.) |
| Ref | Expression |
|---|---|
| nicomachus | ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)(((𝑁↑2) − 𝑁) + ((2 · 𝑘) − 1)) = (𝑁↑3)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fzfid 14123 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ∈ Fin) | |
| 2 | nn0cn 12623 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 3 | 2 | adantr 486 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑁 ∈ ℂ) |
| 4 | 3 | sqcld 14294 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → (𝑁↑2) ∈ ℂ) |
| 5 | 4, 3 | subcld 11676 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((𝑁↑2) − 𝑁) ∈ ℂ) |
| 6 | 2cnd 12428 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 2 ∈ ℂ) | |
| 7 | elfznn 13694 | . . . . . . 7 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ) | |
| 8 | 7 | nncnd 12358 | . . . . . 6 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℂ) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ ℂ) |
| 10 | 6, 9 | mulcld 11336 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → (2 · 𝑘) ∈ ℂ) |
| 11 | 1cnd 11309 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 1 ∈ ℂ) | |
| 12 | 10, 11 | subcld 11676 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((2 · 𝑘) − 1) ∈ ℂ) |
| 13 | 1, 5, 12 | fsumadd 15915 | . 2 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)(((𝑁↑2) − 𝑁) + ((2 · 𝑘) − 1)) = (Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) + Σ𝑘 ∈ (1...𝑁)((2 · 𝑘) − 1))) |
| 14 | id 23 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℕ0) | |
| 15 | 2 | sqcld 14294 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑2) ∈ ℂ) |
| 16 | 15, 2 | subcld 11676 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((𝑁↑2) − 𝑁) ∈ ℂ) |
| 17 | 14, 16 | fz1sumconst 43475 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) = (𝑁 · ((𝑁↑2) − 𝑁))) |
| 18 | 2, 15, 2 | subdid 11779 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁 · ((𝑁↑2) − 𝑁)) = ((𝑁 · (𝑁↑2)) − (𝑁 · 𝑁))) |
| 19 | df-3 12413 | . . . . . . . 8 ⊢ 3 = (2 + 1) | |
| 20 | 19 | oveq2i 7435 | . . . . . . 7 ⊢ (𝑁↑3) = (𝑁↑(2 + 1)) |
| 21 | 2nn0 12630 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
| 22 | 21 | a1i 11 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℕ0) |
| 23 | 2, 22 | expp1d 14297 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑(2 + 1)) = ((𝑁↑2) · 𝑁)) |
| 24 | 20, 23 | eqtrid 2807 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑3) = ((𝑁↑2) · 𝑁)) |
| 25 | 15, 2 | mulcomd 11337 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ((𝑁↑2) · 𝑁) = (𝑁 · (𝑁↑2))) |
| 26 | 24, 25 | eqtr2d 2796 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 · (𝑁↑2)) = (𝑁↑3)) |
| 27 | 2 | sqvald 14293 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑2) = (𝑁 · 𝑁)) |
| 28 | 27 | eqcomd 2766 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 · 𝑁) = (𝑁↑2)) |
| 29 | 26, 28 | oveq12d 7442 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 · (𝑁↑2)) − (𝑁 · 𝑁)) = ((𝑁↑3) − (𝑁↑2))) |
| 30 | 17, 18, 29 | 3eqtrd 2799 | . . 3 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) = ((𝑁↑3) − (𝑁↑2))) |
| 31 | oddnumth 43477 | . . 3 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)((2 · 𝑘) − 1) = (𝑁↑2)) | |
| 32 | 30, 31 | oveq12d 7442 | . 2 ⊢ (𝑁 ∈ ℕ0 → (Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) + Σ𝑘 ∈ (1...𝑁)((2 · 𝑘) − 1)) = (((𝑁↑3) − (𝑁↑2)) + (𝑁↑2))) |
| 33 | 3nn0 12631 | . . . . 5 ⊢ 3 ∈ ℕ0 | |
| 34 | 33 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 3 ∈ ℕ0) |
| 35 | 2, 34 | expcld 14296 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑3) ∈ ℂ) |
| 36 | 35, 15 | npcand 11680 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((𝑁↑3) − (𝑁↑2)) + (𝑁↑2)) = (𝑁↑3)) |
| 37 | 13, 32, 36 | 3eqtrd 2799 | 1 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)(((𝑁↑2) − 𝑁) + ((2 · 𝑘) − 1)) = (𝑁↑3)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 (class class class)co 7424 ℂcc 11205 1c1 11208 + caddc 11210 · cmul 11212 − cmin 11548 2c2 12404 3c3 12405 ℕ0cn0 12613 ...cfz 13646 ↑cexp 14211 Σcsu 15862 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-inf2 9649 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-1o 8483 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-fin 8984 df-sup 9441 df-oi 9511 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-n0 12614 df-z 12701 df-uz 12973 df-rp 13128 df-fz 13647 df-fzo 13796 df-seq 14152 df-exp 14212 df-fac 14425 df-bc 14454 df-hash 14482 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 df-clim 15664 df-sum 15863 |
| This theorem is used by: sumcubes 43479 |
| Copyright terms: Public domain | W3C validator |