1sgmprm - Intuitionistic Logic Explorer

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

Theorem 1sgmprm 15993

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 8237	. . 3 ⊢ 1 ∈ ℂ
2		1nn0 9533	. . 3 ⊢ 1 ∈ ℕ₀
3		sgmppw 15991	. . 3 ⊢ ((1 ∈ ℂ ∧ 𝑃 ∈ ℙ ∧ 1 ∈ ℕ₀) → (1 σ (𝑃↑1)) = Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘))
4	1, 2, 3	mp3an13 1365	. 2 ⊢ (𝑃 ∈ ℙ → (1 σ (𝑃↑1)) = Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘))
5		prmnn 12837	. . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
6	5	nncnd 9272	. . . 4 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℂ)
7	6	exp1d 11059	. . 3 ⊢ (𝑃 ∈ ℙ → (𝑃↑1) = 𝑃)
8	7	oveq2d 6075	. 2 ⊢ (𝑃 ∈ ℙ → (1 σ (𝑃↑1)) = (1 σ 𝑃))
9	5	adantr 276	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → 𝑃 ∈ ℕ)
10	9	nnrpd 10049	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → 𝑃 ∈ ℝ⁺)
11	10	rpcxp1d 15921	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → (𝑃↑_𝑐1) = 𝑃)
12	11	oveq1d 6074	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → ((𝑃↑_𝑐1)↑𝑘) = (𝑃↑𝑘))
13	12	sumeq2dv 12083	. . 3 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘) = Σ𝑘 ∈ (0...1)(𝑃↑𝑘))
14		1m1e0 9327	. . . . . . . 8 ⊢ (1 − 1) = 0
15	14	oveq2i 6070	. . . . . . 7 ⊢ (0...(1 − 1)) = (0...0)
16	15	sumeq1i 12078	. . . . . 6 ⊢ Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) = Σ𝑘 ∈ (0...0)(𝑃↑𝑘)
17		0z 9609	. . . . . . . 8 ⊢ 0 ∈ ℤ
18	6	exp0d 11058	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃↑0) = 1)
19	18, 1	eqeltrdi 2325	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → (𝑃↑0) ∈ ℂ)
20		oveq2 6067	. . . . . . . . 9 ⊢ (𝑘 = 0 → (𝑃↑𝑘) = (𝑃↑0))
21	20	fsum1 12128	. . . . . . . 8 ⊢ ((0 ∈ ℤ ∧ (𝑃↑0) ∈ ℂ) → Σ𝑘 ∈ (0...0)(𝑃↑𝑘) = (𝑃↑0))
22	17, 19, 21	sylancr 414	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...0)(𝑃↑𝑘) = (𝑃↑0))
23	22, 18	eqtrd 2267	. . . . . 6 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...0)(𝑃↑𝑘) = 1)
24	16, 23	eqtrid 2279	. . . . 5 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) = 1)
25	24, 7	oveq12d 6077	. . . 4 ⊢ (𝑃 ∈ ℙ → (Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) + (𝑃↑1)) = (1 + 𝑃))
26	2	a1i 9	. . . . . 6 ⊢ (𝑃 ∈ ℙ → 1 ∈ ℕ₀)
27		nn0uz 9911	. . . . . 6 ⊢ ℕ₀ = (ℤ_≥‘0)
28	26, 27	eleqtrdi 2327	. . . . 5 ⊢ (𝑃 ∈ ℙ → 1 ∈ (ℤ_≥‘0))
29		elfznn0 10474	. . . . . 6 ⊢ (𝑘 ∈ (0...1) → 𝑘 ∈ ℕ₀)
30		expcl 10947	. . . . . 6 ⊢ ((𝑃 ∈ ℂ ∧ 𝑘 ∈ ℕ₀) → (𝑃↑𝑘) ∈ ℂ)
31	6, 29, 30	syl2an 289	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝑘 ∈ (0...1)) → (𝑃↑𝑘) ∈ ℂ)
32		oveq2 6067	. . . . 5 ⊢ (𝑘 = 1 → (𝑃↑𝑘) = (𝑃↑1))
33	28, 31, 32	fsumm1 12132	. . . 4 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)(𝑃↑𝑘) = (Σ𝑘 ∈ (0...(1 − 1))(𝑃↑𝑘) + (𝑃↑1)))
34		addcom 8428	. . . . 5 ⊢ ((𝑃 ∈ ℂ ∧ 1 ∈ ℂ) → (𝑃 + 1) = (1 + 𝑃))
35	6, 1, 34	sylancl 413	. . . 4 ⊢ (𝑃 ∈ ℙ → (𝑃 + 1) = (1 + 𝑃))
36	25, 33, 35	3eqtr4d 2277	. . 3 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)(𝑃↑𝑘) = (𝑃 + 1))
37	13, 36	eqtrd 2267	. 2 ⊢ (𝑃 ∈ ℙ → Σ𝑘 ∈ (0...1)((𝑃↑_𝑐1)↑𝑘) = (𝑃 + 1))
38	4, 8, 37	3eqtr3d 2275	1 ⊢ (𝑃 ∈ ℙ → (1 σ 𝑃) = (𝑃 + 1))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ‘cfv 5358 (class class class)co 6059 ℂcc 8142 0cc0 8144 1c1 8145 + caddc 8147 − cmin 8462 ℕcn 9258 ℕ₀cn0 9517 ℤcz 9598 ℤ_≥cuz 9875 ...cfz 10365 ↑cexp 10928 Σcsu 12068 ℙcprime 12834 ↑_𝑐ccxp 15853 σ csgm 15980

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4231 ax-sep 4234 ax-nul 4242 ax-pow 4293 ax-pr 4328 ax-un 4560 ax-setind 4665 ax-iinf 4716 ax-cnex 8235 ax-resscn 8236 ax-1cn 8237 ax-1re 8238 ax-icn 8239 ax-addcl 8240 ax-addrcl 8241 ax-mulcl 8242 ax-mulrcl 8243 ax-addcom 8244 ax-mulcom 8245 ax-addass 8246 ax-mulass 8247 ax-distr 8248 ax-i2m1 8249 ax-0lt1 8250 ax-1rid 8251 ax-0id 8252 ax-rnegex 8253 ax-precex 8254 ax-cnre 8255 ax-pre-ltirr 8256 ax-pre-ltwlin 8257 ax-pre-lttrn 8258 ax-pre-apti 8259 ax-pre-ltadd 8260 ax-pre-mulgt0 8261 ax-pre-mulext 8262 ax-arch 8263 ax-caucvg 8264 ax-pre-suploc 8265 ax-addf 8266 ax-mulf 8267

This theorem depends on definitions: df-bi 117 df-stab 839 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-if 3626 df-pw 3677 df-sn 3701 df-pr 3702 df-op 3704 df-uni 3921 df-int 3956 df-iun 3999 df-disj 4092 df-br 4116 df-opab 4178 df-mpt 4179 df-tr 4215 df-id 4420 df-po 4423 df-iso 4424 df-iord 4493 df-on 4495 df-ilim 4496 df-suc 4498 df-iom 4719 df-xp 4761 df-rel 4762 df-cnv 4763 df-co 4764 df-dm 4765 df-rn 4766 df-res 4767 df-ima 4768 df-iota 5318 df-fun 5360 df-fn 5361 df-f 5362 df-f1 5363 df-fo 5364 df-f1o 5365 df-fv 5366 df-isom 5367 df-riota 6012 df-ov 6062 df-oprab 6063 df-mpo 6064 df-of 6276 df-1st 6348 df-2nd 6349 df-recs 6550 df-irdg 6615 df-frec 6636 df-1o 6661 df-2o 6662 df-oadd 6665 df-er 6781 df-map 6898 df-pm 6899 df-en 6990 df-dom 6991 df-fin 6992 df-sup 7289 df-inf 7290 df-pnf 8327 df-mnf 8328 df-xr 8329 df-ltxr 8330 df-le 8331 df-sub 8464 df-neg 8465 df-reap 8868 df-ap 8875 df-div 8968 df-inn 9259 df-2 9317 df-3 9318 df-4 9319 df-n0 9518 df-xnn0 9585 df-z 9599 df-uz 9876 df-q 9974 df-rp 10009 df-xneg 10128 df-xadd 10129 df-ioo 10248 df-ico 10250 df-icc 10251 df-fz 10366 df-fzo 10503 df-fl 10658 df-mod 10713 df-seqfrec 10838 df-exp 10929 df-fac 11117 df-bc 11139 df-ihash 11168 df-shft 11529 df-cj 11556 df-re 11557 df-im 11558 df-rsqrt 11713 df-abs 11714 df-clim 11994 df-sumdc 12069 df-ef 12364 df-e 12365 df-dvds 12504 df-gcd 12680 df-prm 12835 df-pc 13013 df-rest 13543 df-topgen 13562 df-psmet 14822 df-xmet 14823 df-met 14824 df-bl 14825 df-mopn 14826 df-top 14994 df-topon 15007 df-bases 15039 df-ntr 15092 df-cn 15184 df-cnp 15185 df-tx 15249 df-cncf 15567 df-limced 15652 df-dvap 15653 df-relog 15854 df-rpcxp 15855 df-sgm 15981

This theorem is referenced by: perfect1 15997

W3C validator