perfect1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > perfect1		Structured version Visualization version GIF version

Theorem perfect1 26474

Description: Euclid's contribution to the Euclid-Euler theorem. A number of the form 2↑(𝑝 − 1) · (2↑𝑝 − 1) is a perfect number. (Contributed by Mario Carneiro, 17-May-2016.)

**Assertion**
Ref	Expression
perfect1	⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (1 σ ((2↑(𝑃 − 1)) · ((2↑𝑃) − 1))) = ((2↑𝑃) · ((2↑𝑃) − 1)))

**Proof of Theorem perfect1**
Step	Hyp	Ref	Expression
1		mersenne 26473	. . . . 5 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → 𝑃 ∈ ℙ)
2		prmnn 16468	. . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
3	1, 2	syl 17	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → 𝑃 ∈ ℕ)
4		1sgm2ppw 26446	. . . 4 ⊢ (𝑃 ∈ ℕ → (1 σ (2↑(𝑃 − 1))) = ((2↑𝑃) − 1))
5	3, 4	syl 17	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (1 σ (2↑(𝑃 − 1))) = ((2↑𝑃) − 1))
6		1sgmprm 26445	. . . . 5 ⊢ (((2↑𝑃) − 1) ∈ ℙ → (1 σ ((2↑𝑃) − 1)) = (((2↑𝑃) − 1) + 1))
7	6	adantl 482	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (1 σ ((2↑𝑃) − 1)) = (((2↑𝑃) − 1) + 1))
8		2nn 12139	. . . . . . 7 ⊢ 2 ∈ ℕ
9	3	nnnn0d 12386	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → 𝑃 ∈ ℕ₀)
10		nnexpcl 13888	. . . . . . 7 ⊢ ((2 ∈ ℕ ∧ 𝑃 ∈ ℕ₀) → (2↑𝑃) ∈ ℕ)
11	8, 9, 10	sylancr 587	. . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (2↑𝑃) ∈ ℕ)
12	11	nncnd 12082	. . . . 5 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (2↑𝑃) ∈ ℂ)
13		ax-1cn 11022	. . . . 5 ⊢ 1 ∈ ℂ
14		npcan 11323	. . . . 5 ⊢ (((2↑𝑃) ∈ ℂ ∧ 1 ∈ ℂ) → (((2↑𝑃) − 1) + 1) = (2↑𝑃))
15	12, 13, 14	sylancl 586	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (((2↑𝑃) − 1) + 1) = (2↑𝑃))
16	7, 15	eqtrd 2776	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (1 σ ((2↑𝑃) − 1)) = (2↑𝑃))
17	5, 16	oveq12d 7347	. 2 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((1 σ (2↑(𝑃 − 1))) · (1 σ ((2↑𝑃) − 1))) = (((2↑𝑃) − 1) · (2↑𝑃)))
18	13	a1i 11	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → 1 ∈ ℂ)
19		nnm1nn0 12367	. . . . 5 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
20	3, 19	syl 17	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (𝑃 − 1) ∈ ℕ₀)
21		nnexpcl 13888	. . . 4 ⊢ ((2 ∈ ℕ ∧ (𝑃 − 1) ∈ ℕ₀) → (2↑(𝑃 − 1)) ∈ ℕ)
22	8, 20, 21	sylancr 587	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (2↑(𝑃 − 1)) ∈ ℕ)
23		prmnn 16468	. . . 4 ⊢ (((2↑𝑃) − 1) ∈ ℙ → ((2↑𝑃) − 1) ∈ ℕ)
24	23	adantl 482	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) − 1) ∈ ℕ)
25	22	nnzd 12518	. . . . 5 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (2↑(𝑃 − 1)) ∈ ℤ)
26		prmz 16469	. . . . . 6 ⊢ (((2↑𝑃) − 1) ∈ ℙ → ((2↑𝑃) − 1) ∈ ℤ)
27	26	adantl 482	. . . . 5 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) − 1) ∈ ℤ)
28	25, 27	gcdcomd 16312	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑(𝑃 − 1)) gcd ((2↑𝑃) − 1)) = (((2↑𝑃) − 1) gcd (2↑(𝑃 − 1))))
29		iddvds 16070	. . . . . . . 8 ⊢ (((2↑𝑃) − 1) ∈ ℤ → ((2↑𝑃) − 1) ∥ ((2↑𝑃) − 1))
30	27, 29	syl 17	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) − 1) ∥ ((2↑𝑃) − 1))
31		prmuz2 16490	. . . . . . . . . 10 ⊢ (((2↑𝑃) − 1) ∈ ℙ → ((2↑𝑃) − 1) ∈ (ℤ_≥‘2))
32	31	adantl 482	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) − 1) ∈ (ℤ_≥‘2))
33		eluz2gt1 12753	. . . . . . . . 9 ⊢ (((2↑𝑃) − 1) ∈ (ℤ_≥‘2) → 1 < ((2↑𝑃) − 1))
34	32, 33	syl 17	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → 1 < ((2↑𝑃) − 1))
35		ndvdsp1 16211	. . . . . . . 8 ⊢ ((((2↑𝑃) − 1) ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℕ ∧ 1 < ((2↑𝑃) − 1)) → (((2↑𝑃) − 1) ∥ ((2↑𝑃) − 1) → ¬ ((2↑𝑃) − 1) ∥ (((2↑𝑃) − 1) + 1)))
36	27, 24, 34, 35	syl3anc 1370	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (((2↑𝑃) − 1) ∥ ((2↑𝑃) − 1) → ¬ ((2↑𝑃) − 1) ∥ (((2↑𝑃) − 1) + 1)))
37	30, 36	mpd 15	. . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ¬ ((2↑𝑃) − 1) ∥ (((2↑𝑃) − 1) + 1))
38		2z 12445	. . . . . . . . 9 ⊢ 2 ∈ ℤ
39	38	a1i 11	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → 2 ∈ ℤ)
40		dvdsmultr1 16096	. . . . . . . 8 ⊢ ((((2↑𝑃) − 1) ∈ ℤ ∧ (2↑(𝑃 − 1)) ∈ ℤ ∧ 2 ∈ ℤ) → (((2↑𝑃) − 1) ∥ (2↑(𝑃 − 1)) → ((2↑𝑃) − 1) ∥ ((2↑(𝑃 − 1)) · 2)))
41	27, 25, 39, 40	syl3anc 1370	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (((2↑𝑃) − 1) ∥ (2↑(𝑃 − 1)) → ((2↑𝑃) − 1) ∥ ((2↑(𝑃 − 1)) · 2)))
42		2cn 12141	. . . . . . . . . 10 ⊢ 2 ∈ ℂ
43		expm1t 13904	. . . . . . . . . 10 ⊢ ((2 ∈ ℂ ∧ 𝑃 ∈ ℕ) → (2↑𝑃) = ((2↑(𝑃 − 1)) · 2))
44	42, 3, 43	sylancr 587	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (2↑𝑃) = ((2↑(𝑃 − 1)) · 2))
45	15, 44	eqtr2d 2777	. . . . . . . 8 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑(𝑃 − 1)) · 2) = (((2↑𝑃) − 1) + 1))
46	45	breq2d 5101	. . . . . . 7 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (((2↑𝑃) − 1) ∥ ((2↑(𝑃 − 1)) · 2) ↔ ((2↑𝑃) − 1) ∥ (((2↑𝑃) − 1) + 1)))
47	41, 46	sylibd 238	. . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (((2↑𝑃) − 1) ∥ (2↑(𝑃 − 1)) → ((2↑𝑃) − 1) ∥ (((2↑𝑃) − 1) + 1)))
48	37, 47	mtod 197	. . . . 5 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ¬ ((2↑𝑃) − 1) ∥ (2↑(𝑃 − 1)))
49		simpr 485	. . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) − 1) ∈ ℙ)
50		coprm 16505	. . . . . 6 ⊢ ((((2↑𝑃) − 1) ∈ ℙ ∧ (2↑(𝑃 − 1)) ∈ ℤ) → (¬ ((2↑𝑃) − 1) ∥ (2↑(𝑃 − 1)) ↔ (((2↑𝑃) − 1) gcd (2↑(𝑃 − 1))) = 1))
51	49, 25, 50	syl2anc 584	. . . . 5 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (¬ ((2↑𝑃) − 1) ∥ (2↑(𝑃 − 1)) ↔ (((2↑𝑃) − 1) gcd (2↑(𝑃 − 1))) = 1))
52	48, 51	mpbid 231	. . . 4 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (((2↑𝑃) − 1) gcd (2↑(𝑃 − 1))) = 1)
53	28, 52	eqtrd 2776	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑(𝑃 − 1)) gcd ((2↑𝑃) − 1)) = 1)
54		sgmmul 26447	. . 3 ⊢ ((1 ∈ ℂ ∧ ((2↑(𝑃 − 1)) ∈ ℕ ∧ ((2↑𝑃) − 1) ∈ ℕ ∧ ((2↑(𝑃 − 1)) gcd ((2↑𝑃) − 1)) = 1)) → (1 σ ((2↑(𝑃 − 1)) · ((2↑𝑃) − 1))) = ((1 σ (2↑(𝑃 − 1))) · (1 σ ((2↑𝑃) − 1))))
55	18, 22, 24, 53, 54	syl13anc 1371	. 2 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (1 σ ((2↑(𝑃 − 1)) · ((2↑𝑃) − 1))) = ((1 σ (2↑(𝑃 − 1))) · (1 σ ((2↑𝑃) − 1))))
56		subcl 11313	. . . 4 ⊢ (((2↑𝑃) ∈ ℂ ∧ 1 ∈ ℂ) → ((2↑𝑃) − 1) ∈ ℂ)
57	12, 13, 56	sylancl 586	. . 3 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) − 1) ∈ ℂ)
58	12, 57	mulcomd 11089	. 2 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → ((2↑𝑃) · ((2↑𝑃) − 1)) = (((2↑𝑃) − 1) · (2↑𝑃)))
59	17, 55, 58	3eqtr4d 2786	1 ⊢ ((𝑃 ∈ ℤ ∧ ((2↑𝑃) − 1) ∈ ℙ) → (1 σ ((2↑(𝑃 − 1)) · ((2↑𝑃) − 1))) = ((2↑𝑃) · ((2↑𝑃) − 1)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1540 ∈ wcel 2105 class class class wbr 5089 ‘cfv 6473 (class class class)co 7329 ℂcc 10962 1c1 10965 + caddc 10967 · cmul 10969 < clt 11102 − cmin 11298 ℕcn 12066 2c2 12121 ℕ₀cn0 12326 ℤcz 12412 ℤ_≥cuz 12675 ↑cexp 13875 ∥ cdvds 16054 gcd cgcd 16292 ℙcprime 16465 σ csgm 26343

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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-rep 5226 ax-sep 5240 ax-nul 5247 ax-pow 5305 ax-pr 5369 ax-un 7642 ax-inf2 9490 ax-cnex 11020 ax-resscn 11021 ax-1cn 11022 ax-icn 11023 ax-addcl 11024 ax-addrcl 11025 ax-mulcl 11026 ax-mulrcl 11027 ax-mulcom 11028 ax-addass 11029 ax-mulass 11030 ax-distr 11031 ax-i2m1 11032 ax-1ne0 11033 ax-1rid 11034 ax-rnegex 11035 ax-rrecex 11036 ax-cnre 11037 ax-pre-lttri 11038 ax-pre-lttrn 11039 ax-pre-ltadd 11040 ax-pre-mulgt0 11041 ax-pre-sup 11042 ax-addf 11043 ax-mulf 11044

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3349 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3727 df-csb 3843 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3916 df-nul 4269 df-if 4473 df-pw 4548 df-sn 4573 df-pr 4575 df-tp 4577 df-op 4579 df-uni 4852 df-int 4894 df-iun 4940 df-iin 4941 df-br 5090 df-opab 5152 df-mpt 5173 df-tr 5207 df-id 5512 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5569 df-se 5570 df-we 5571 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6232 df-ord 6299 df-on 6300 df-lim 6301 df-suc 6302 df-iota 6425 df-fun 6475 df-fn 6476 df-f 6477 df-f1 6478 df-fo 6479 df-f1o 6480 df-fv 6481 df-isom 6482 df-riota 7286 df-ov 7332 df-oprab 7333 df-mpo 7334 df-of 7587 df-om 7773 df-1st 7891 df-2nd 7892 df-supp 8040 df-frecs 8159 df-wrecs 8190 df-recs 8264 df-rdg 8303 df-1o 8359 df-2o 8360 df-er 8561 df-map 8680 df-pm 8681 df-ixp 8749 df-en 8797 df-dom 8798 df-sdom 8799 df-fin 8800 df-fsupp 9219 df-fi 9260 df-sup 9291 df-inf 9292 df-oi 9359 df-card 9788 df-pnf 11104 df-mnf 11105 df-xr 11106 df-ltxr 11107 df-le 11108 df-sub 11300 df-neg 11301 df-div 11726 df-nn 12067 df-2 12129 df-3 12130 df-4 12131 df-5 12132 df-6 12133 df-7 12134 df-8 12135 df-9 12136 df-n0 12327 df-z 12413 df-dec 12531 df-uz 12676 df-q 12782 df-rp 12824 df-xneg 12941 df-xadd 12942 df-xmul 12943 df-ioo 13176 df-ioc 13177 df-ico 13178 df-icc 13179 df-fz 13333 df-fzo 13476 df-fl 13605 df-mod 13683 df-seq 13815 df-exp 13876 df-fac 14081 df-bc 14110 df-hash 14138 df-shft 14869 df-cj 14901 df-re 14902 df-im 14903 df-sqrt 15037 df-abs 15038 df-limsup 15271 df-clim 15288 df-rlim 15289 df-sum 15489 df-ef 15868 df-sin 15870 df-cos 15871 df-pi 15873 df-dvds 16055 df-gcd 16293 df-prm 16466 df-pc 16627 df-struct 16937 df-sets 16954 df-slot 16972 df-ndx 16984 df-base 17002 df-ress 17031 df-plusg 17064 df-mulr 17065 df-starv 17066 df-sca 17067 df-vsca 17068 df-ip 17069 df-tset 17070 df-ple 17071 df-ds 17073 df-unif 17074 df-hom 17075 df-cco 17076 df-rest 17222 df-topn 17223 df-0g 17241 df-gsum 17242 df-topgen 17243 df-pt 17244 df-prds 17247 df-xrs 17302 df-qtop 17307 df-imas 17308 df-xps 17310 df-mre 17384 df-mrc 17385 df-acs 17387 df-mgm 18415 df-sgrp 18464 df-mnd 18475 df-submnd 18520 df-mulg 18789 df-cntz 19011 df-cmn 19475 df-psmet 20687 df-xmet 20688 df-met 20689 df-bl 20690 df-mopn 20691 df-fbas 20692 df-fg 20693 df-cnfld 20696 df-top 22141 df-topon 22158 df-topsp 22180 df-bases 22194 df-cld 22268 df-ntr 22269 df-cls 22270 df-nei 22347 df-lp 22385 df-perf 22386 df-cn 22476 df-cnp 22477 df-haus 22564 df-tx 22811 df-hmeo 23004 df-fil 23095 df-fm 23187 df-flim 23188 df-flf 23189 df-xms 23571 df-ms 23572 df-tms 23573 df-cncf 24139 df-limc 25128 df-dv 25129 df-log 25810 df-cxp 25811 df-sgm 26349

This theorem is referenced by: perfect 26477 perfectALTV 45515

W3C validator