| 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 13875 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (1...𝑁) ∈ Fin) | |
| 2 | nn0cn 12386 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℂ) | |
| 3 | 2 | adantr 480 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑁 ∈ ℂ) |
| 4 | 3 | sqcld 14046 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → (𝑁↑2) ∈ ℂ) |
| 5 | 4, 3 | subcld 11467 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((𝑁↑2) − 𝑁) ∈ ℂ) |
| 6 | 2cnd 12198 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 2 ∈ ℂ) | |
| 7 | elfznn 13448 | . . . . . . 7 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ) | |
| 8 | 7 | nncnd 12136 | . . . . . 6 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℂ) |
| 9 | 8 | adantl 481 | . . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 𝑘 ∈ ℂ) |
| 10 | 6, 9 | mulcld 11127 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → (2 · 𝑘) ∈ ℂ) |
| 11 | 1cnd 11102 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → 1 ∈ ℂ) | |
| 12 | 10, 11 | subcld 11467 | . . 3 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑘 ∈ (1...𝑁)) → ((2 · 𝑘) − 1) ∈ ℂ) |
| 13 | 1, 5, 12 | fsumadd 15642 | . 2 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)(((𝑁↑2) − 𝑁) + ((2 · 𝑘) − 1)) = (Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) + Σ𝑘 ∈ (1...𝑁)((2 · 𝑘) − 1))) |
| 14 | id 22 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℕ0) | |
| 15 | 2 | sqcld 14046 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑2) ∈ ℂ) |
| 16 | 15, 2 | subcld 11467 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → ((𝑁↑2) − 𝑁) ∈ ℂ) |
| 17 | 14, 16 | fz1sumconst 42342 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) = (𝑁 · ((𝑁↑2) − 𝑁))) |
| 18 | 2, 15, 2 | subdid 11568 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → (𝑁 · ((𝑁↑2) − 𝑁)) = ((𝑁 · (𝑁↑2)) − (𝑁 · 𝑁))) |
| 19 | df-3 12184 | . . . . . . . 8 ⊢ 3 = (2 + 1) | |
| 20 | 19 | oveq2i 7352 | . . . . . . 7 ⊢ (𝑁↑3) = (𝑁↑(2 + 1)) |
| 21 | 2nn0 12393 | . . . . . . . . 9 ⊢ 2 ∈ ℕ0 | |
| 22 | 21 | a1i 11 | . . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 2 ∈ ℕ0) |
| 23 | 2, 22 | expp1d 14049 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑(2 + 1)) = ((𝑁↑2) · 𝑁)) |
| 24 | 20, 23 | eqtrid 2778 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑3) = ((𝑁↑2) · 𝑁)) |
| 25 | 15, 2 | mulcomd 11128 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → ((𝑁↑2) · 𝑁) = (𝑁 · (𝑁↑2))) |
| 26 | 24, 25 | eqtr2d 2767 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 · (𝑁↑2)) = (𝑁↑3)) |
| 27 | 2 | sqvald 14045 | . . . . . 6 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑2) = (𝑁 · 𝑁)) |
| 28 | 27 | eqcomd 2737 | . . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑁 · 𝑁) = (𝑁↑2)) |
| 29 | 26, 28 | oveq12d 7359 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → ((𝑁 · (𝑁↑2)) − (𝑁 · 𝑁)) = ((𝑁↑3) − (𝑁↑2))) |
| 30 | 17, 18, 29 | 3eqtrd 2770 | . . 3 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) = ((𝑁↑3) − (𝑁↑2))) |
| 31 | oddnumth 42344 | . . 3 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)((2 · 𝑘) − 1) = (𝑁↑2)) | |
| 32 | 30, 31 | oveq12d 7359 | . 2 ⊢ (𝑁 ∈ ℕ0 → (Σ𝑘 ∈ (1...𝑁)((𝑁↑2) − 𝑁) + Σ𝑘 ∈ (1...𝑁)((2 · 𝑘) − 1)) = (((𝑁↑3) − (𝑁↑2)) + (𝑁↑2))) |
| 33 | 3nn0 12394 | . . . . 5 ⊢ 3 ∈ ℕ0 | |
| 34 | 33 | a1i 11 | . . . 4 ⊢ (𝑁 ∈ ℕ0 → 3 ∈ ℕ0) |
| 35 | 2, 34 | expcld 14048 | . . 3 ⊢ (𝑁 ∈ ℕ0 → (𝑁↑3) ∈ ℂ) |
| 36 | 35, 15 | npcand 11471 | . 2 ⊢ (𝑁 ∈ ℕ0 → (((𝑁↑3) − (𝑁↑2)) + (𝑁↑2)) = (𝑁↑3)) |
| 37 | 13, 32, 36 | 3eqtrd 2770 | 1 ⊢ (𝑁 ∈ ℕ0 → Σ𝑘 ∈ (1...𝑁)(((𝑁↑2) − 𝑁) + ((2 · 𝑘) − 1)) = (𝑁↑3)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 (class class class)co 7341 ℂcc 10999 1c1 11002 + caddc 11004 · cmul 11006 − cmin 11339 2c2 12175 3c3 12176 ℕ0cn0 12376 ...cfz 13402 ↑cexp 13963 Σcsu 15588 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5212 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 ax-inf2 9526 ax-cnex 11057 ax-resscn 11058 ax-1cn 11059 ax-icn 11060 ax-addcl 11061 ax-addrcl 11062 ax-mulcl 11063 ax-mulrcl 11064 ax-mulcom 11065 ax-addass 11066 ax-mulass 11067 ax-distr 11068 ax-i2m1 11069 ax-1ne0 11070 ax-1rid 11071 ax-rnegex 11072 ax-rrecex 11073 ax-cnre 11074 ax-pre-lttri 11075 ax-pre-lttrn 11076 ax-pre-ltadd 11077 ax-pre-mulgt0 11078 ax-pre-sup 11079 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-int 4893 df-iun 4938 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-se 5565 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-isom 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-1o 8380 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-fin 8868 df-sup 9321 df-oi 9391 df-card 9827 df-pnf 11143 df-mnf 11144 df-xr 11145 df-ltxr 11146 df-le 11147 df-sub 11341 df-neg 11342 df-div 11770 df-nn 12121 df-2 12183 df-3 12184 df-n0 12377 df-z 12464 df-uz 12728 df-rp 12886 df-fz 13403 df-fzo 13550 df-seq 13904 df-exp 13964 df-fac 14176 df-bc 14205 df-hash 14233 df-cj 15001 df-re 15002 df-im 15003 df-sqrt 15137 df-abs 15138 df-clim 15390 df-sum 15589 |
| This theorem is referenced by: sumcubes 42346 |
| Copyright terms: Public domain | W3C validator |