1sgmprm - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > 1sgmprm		GIF version

Theorem 1sgmprm 16300

Description: The sum of divisors for a prime is 𝑃 + 1 because the only divisors are 1 and 𝑃. (Contributed by Mario Carneiro, 17-May-2016.)

**Assertion**
Ref	Expression
1sgmprm	⊢ (𝑃 ∈ ℙ → (1 σ 𝑃) = (𝑃 + 1))

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

Step	Hyp	Ref	Expression
1		ax-1cn 8279	. . 3 ⊢ 1 ∈ ℂ
2		1nn0 9591	. . 3 ⊢ 1 ∈ ℕ₀
3		sgmppw 16298	. . 3 ⊢ ((1 ∈ ℂ ∧ 𝑃 ∈ ℙ ∧ 1 ∈ ℕ₀) → (1 σ (𝑃↑1)) = Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘))
4	1, 2, 3	mp3an13 1369	. 2 ⊢ (𝑃 ∈ ℙ → (1 σ (𝑃↑1)) = Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘))
5		prmnn 12914	. . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
6	5	nncnd 9328	. . . 4 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℂ)
7	6	exp1d 11128	. . 3 ⊢ (𝑃 ∈ ℙ → (𝑃↑1) = 𝑃)
8	7	oveq2d 6104	. 2 ⊢ (𝑃 ∈ ℙ → (1 σ (𝑃↑1)) = (1 σ 𝑃))
9	5	adantr 276	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → 𝑃 ∈ ℕ)
10	9	nnrpd 10113	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → 𝑃 ∈ ℝ⁺)
11	10	rpcxp1d 16172	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → (𝑃↑_𝑐1) = 𝑃)
12	11	oveq1d 6103	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → ((𝑃↑_𝑐1)↑𝑘) = (𝑃↑𝑘))
13	12	sumeq2dv 12160	. . 3 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘) = Σ𝑘 ∈ (0...1)(𝑃↑𝑘))
14		1m1e0 9383	. . . . . . . 8 ⊢ (1 − 1) = 0
15	14	oveq2i 6099	. . . . . . 7 ⊢ (0...(1 − 1)) = (0...0)
16	15	sumeq1i 12155	. . . . . 6 ⊢ Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) = Σ𝑘 ∈ (0...0)(𝑃↑𝑘)
17		0z 9667	. . . . . . . 8 ⊢ 0 ∈ ℤ
18	6	exp0d 11127	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃↑0) = 1)
19	18, 1	eqeltrdi 2329	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃↑0) ∈ ℂ)
20		oveq2 6096	. . . . . . . . 9 ⊢ (𝑘 = 0 → (𝑃↑𝑘) = (𝑃↑0))
21	20	fsum1 12205	. . . . . . . 8 ⊢ ((0 ∈ ℤ ∧ (𝑃↑0) ∈ ℂ) → Σ𝑘 ∈ (0...0)(𝑃↑𝑘) = (𝑃↑0))
22	17, 19, 21	sylancr 418	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...0)(𝑃↑𝑘) = (𝑃↑0))
23	22, 18	eqtrd 2271	. . . . . 6 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...0)(𝑃↑𝑘) = 1)
24	16, 23	eqtrid 2283	. . . . 5 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) = 1)
25	24, 7	oveq12d 6106	. . . 4 ⊢ (𝑃 ∈ ℙ → (Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) + (𝑃↑1)) = (1 + 𝑃))
26	2	a1i 9	. . . . . 6 ⊢ (𝑃 ∈ ℙ → 1 ∈ ℕ₀)
27		nn0uz 9974	. . . . . 6 ⊢ ℕ₀ = (ℤ_≥‘0)
28	26, 27	eleqtrdi 2331	. . . . 5 ⊢ (𝑃 ∈ ℙ → 1 ∈ (ℤ_≥‘0))
29		elfznn0 10539	. . . . . 6 ⊢ (𝑘 ∈ (0...1) → 𝑘 ∈ ℕ₀)
30		expcl 11016	. . . . . 6 ⊢ ((𝑃 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝑃↑𝑘) ∈ ℂ)
31	6, 29, 30	syl2an 289	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → (𝑃↑𝑘) ∈ ℂ)
32		oveq2 6096	. . . . 5 ⊢ (𝑘 = 1 → (𝑃↑𝑘) = (𝑃↑1))
33	28, 31, 32	fsumm1 12209	. . . 4 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)(𝑃↑𝑘) = (Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) + (𝑃↑1)))
34		addcom 8471	. . . . 5 ⊢ ((𝑃 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑃 + 1) = (1 + 𝑃))
35	6, 1, 34	sylancl 417	. . . 4 ⊢ (𝑃 ∈ ℙ → (𝑃 + 1) = (1 + 𝑃))
36	25, 33, 35	3eqtr4d 2281	. . 3 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)(𝑃↑𝑘) = (𝑃 + 1))
37	13, 36	eqtrd 2271	. 2 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘) = (𝑃 + 1))
38	4, 8, 37	3eqtr3d 2279	1 ⊢ (𝑃 ∈ ℙ → (1 σ 𝑃) = (𝑃 + 1))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 ℂcc 8184 0cc0 8186 1c1 8187 + caddc 8189 − cmin 8505 ℕcn 9314 ℕ₀cn0 9575 ℤcz 9656 ℤ_≥cuz 9938 ...cfz 10429 ↑cexp 10997 Σcsu 12145 ℙcprime 12911 ↑_𝑐ccxp 16098 σ csgm 16247

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-mulrcl 8285 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-precex 8296 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-apti 8301 ax-pre-ltadd 8302 ax-pre-mulgt0 8303 ax-pre-mulext 8304 ax-arch 8305 ax-caucvg 8306 ax-pre-suploc 8307 ax-addf 8308 ax-mulf 8309

This proof depends on definitions: df-bi 117 df-stab 843 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-disj 4107 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-of 6305 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-2o 6692 df-oadd 6695 df-er 6811 df-map 6928 df-pm 6929 df-en 7028 df-dom 7029 df-fin 7030 df-sup 7331 df-inf 7332 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-reap 8912 df-ap 8919 df-div 9012 df-inn 9315 df-2 9373 df-3 9374 df-4 9375 df-n0 9576 df-xnn0 9643 df-z 9657 df-uz 9939 df-q 10037 df-rp 10073 df-xneg 10192 df-xadd 10193 df-ioo 10312 df-ico 10314 df-icc 10315 df-fz 10430 df-fzo 10568 df-fl 10723 df-mod 10782 df-seqfrec 10907 df-exp 10998 df-fac 11187 df-bc 11209 df-ihash 11238 df-shft 11603 df-cj 11630 df-re 11631 df-im 11632 df-rsqrt 11787 df-abs 11788 df-clim 12071 df-sumdc 12146 df-ef 12441 df-e 12442 df-dvds 12581 df-gcd 12757 df-prm 12912 df-pc 13094 df-rest 13655 df-topgen 13674 df-psmet 14990 df-xmet 14991 df-met 14992 df-bl 14993 df-mopn 14994 df-top 15236 df-topon 15249 df-bases 15281 df-ntr 15334 df-cn 15426 df-cnp 15427 df-tx 15491 df-cncf 15809 df-limced 15894 df-dvap 15895 df-relog 16099 df-rpcxp 16100 df-sgm 16250

This theorem is used by: perfect1 16310

W3C validator