isppw - Metamath Proof Explorer

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

Theorem isppw 27095

Description: Two ways to say that 𝐴 is a prime power. (Contributed by Mario Carneiro, 7-Apr-2016.)

**Assertion**
Ref	Expression
isppw	⊢ (𝐴 ∈ ℕ → ((Λ‘𝐴) ≠ 0 ↔ ∃!𝑝 ∈ ℙ 𝑝 ∥ 𝐴))

Distinct variable group: 𝐴,𝑝

**Proof of Theorem isppw**
Step	Hyp	Ref	Expression
1		eqid 2739	. . . 4 ⊢ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} = {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}
2	1	vmaval 27094	. . 3 ⊢ (𝐴 ∈ ℕ → (Λ‘𝐴) = if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0))
3	2	neeq1d 2993	. 2 ⊢ (𝐴 ∈ ℕ → ((Λ‘𝐴) ≠ 0 ↔ if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0))
4		reuen1 8963	. . 3 ⊢ (∃!𝑝 ∈ ℙ 𝑝 ∥ 𝐴 ↔ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o)
5		hash1 14357	. . . . . . . . . 10 ⊢ (♯‘1_o) = 1
6	5	eqeq2i 2752	. . . . . . . . 9 ⊢ ((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = (♯‘1_o) ↔ (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1)
7		prmdvdsfi 27088	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ Fin)
8		1onn 8566	. . . . . . . . . . 11 ⊢ 1_o ∈ ω
9		nnfi 9092	. . . . . . . . . . 11 ⊢ (1_o ∈ ω → 1_o ∈ Fin)
10	8, 9	ax-mp 5	. . . . . . . . . 10 ⊢ 1_o ∈ Fin
11		hashen 14300	. . . . . . . . . 10 ⊢ (({𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ Fin ∧ 1_o ∈ Fin) → ((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = (♯‘1_o) ↔ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o))
12	7, 10, 11	sylancl 592	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → ((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = (♯‘1_o) ↔ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o))
13	6, 12	bitr3id 286	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1 ↔ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o))
14	13	biimpar 478	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1)
15	14	iftrued 4462	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) = (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}))
16		en1b 8962	. . . . . . . . . . . . 13 ⊢ ({𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o ↔ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} = {∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}})
17	16	bilani 505	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} = {∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}})
18		ssrab2 4011	. . . . . . . . . . . 12 ⊢ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ⊆ ℙ
19	17, 18	eqsstrrdi 3960	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → {∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}} ⊆ ℙ)
20	7	uniexd 7685	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℕ → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ V)
21	20	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ V)
22		snssg 4715	. . . . . . . . . . . 12 ⊢ (∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ V → (∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ ℙ ↔ {∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}} ⊆ ℙ))
23	21, 22	syl 17	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → (∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ ℙ ↔ {∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}} ⊆ ℙ))
24	19, 23	mpbird 258	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ ℙ)
25		prmuz2 16656	. . . . . . . . . 10 ⊢ (∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ ℙ → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ (ℤ_≥‘2))
26	24, 25	syl 17	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ (ℤ_≥‘2))
27		eluzelre 12790	. . . . . . . . 9 ⊢ (∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ (ℤ_≥‘2) → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ ℝ)
28	26, 27	syl 17	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ ℝ)
29		eluz2gt1 12861	. . . . . . . . 9 ⊢ (∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ∈ (ℤ_≥‘2) → 1 < ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})
30	26, 29	syl 17	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → 1 < ∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴})
31	28, 30	rplogcld 26611	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) ∈ ℝ⁺)
32	31	rpne0d 12982	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) ≠ 0)
33	15, 32	eqnetrd 3001	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o) → if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0)
34	33	ex 413	. . . 4 ⊢ (𝐴 ∈ ℕ → ({𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o → if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0))
35		iffalse 4463	. . . . . 6 ⊢ (¬ (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1 → if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) = 0)
36	35	necon1ai 2961	. . . . 5 ⊢ (if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0 → (♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1)
37	36, 13	imbitrid 245	. . . 4 ⊢ (𝐴 ∈ ℕ → (if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0 → {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o))
38	34, 37	impbid 213	. . 3 ⊢ (𝐴 ∈ ℕ → ({𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴} ≈ 1_o ↔ if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0))
39	4, 38	bitrid 284	. 2 ⊢ (𝐴 ∈ ℕ → (∃!𝑝 ∈ ℙ 𝑝 ∥ 𝐴 ↔ if((♯‘{𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}) = 1, (log‘∪ {𝑝 ∈ ℙ ∣ 𝑝 ∥ 𝐴}), 0) ≠ 0))
40	3, 39	bitr4d 283	1 ⊢ (𝐴 ∈ ℕ → ((Λ‘𝐴) ≠ 0 ↔ ∃!𝑝 ∈ ℙ 𝑝 ∥ 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ∃!wreu 3342 {crab 3391 Vcvv 3431 ⊆ wss 3883 ifcif 4454 {csn 4555 ∪ cuni 4838 class class class wbr 5072 ‘cfv 6485 ωcom 7806 1_oc1o 8388 ≈ cen 8880 Fincfn 8883 ℝcr 11028 0cc0 11029 1c1 11030 < clt 11170 ℕcn 12165 2c2 12227 ℤ_≥cuz 12779 ♯chash 14283 ∥ cdvds 16212 ℙcprime 16631 logclog 26536 Λcvma 27073

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 ax-addf 11108

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-of 7620 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-er 8633 df-map 8765 df-pm 8766 df-ixp 8836 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-fi 9314 df-sup 9345 df-inf 9346 df-oi 9415 df-dju 9816 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-dec 12636 df-uz 12780 df-q 12890 df-rp 12934 df-xneg 13054 df-xadd 13055 df-xmul 13056 df-ioo 13293 df-ioc 13294 df-ico 13295 df-icc 13296 df-fz 13453 df-fzo 13600 df-fl 13742 df-mod 13820 df-seq 13955 df-exp 14015 df-fac 14227 df-bc 14256 df-hash 14284 df-shft 15020 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-limsup 15424 df-clim 15441 df-rlim 15442 df-sum 15640 df-ef 16023 df-sin 16025 df-cos 16026 df-pi 16028 df-dvds 16213 df-prm 16632 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-mulr 17225 df-starv 17226 df-sca 17227 df-vsca 17228 df-ip 17229 df-tset 17230 df-ple 17231 df-ds 17233 df-unif 17234 df-hom 17235 df-cco 17236 df-rest 17376 df-topn 17377 df-0g 17395 df-gsum 17396 df-topgen 17397 df-pt 17398 df-prds 17401 df-xrs 17457 df-qtop 17462 df-imas 17463 df-xps 17465 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-mulg 19035 df-cntz 19283 df-cmn 19748 df-psmet 21339 df-xmet 21340 df-met 21341 df-bl 21342 df-mopn 21343 df-fbas 21344 df-fg 21345 df-cnfld 21348 df-top 22877 df-topon 22894 df-topsp 22916 df-bases 22929 df-cld 23002 df-ntr 23003 df-cls 23004 df-nei 23081 df-lp 23119 df-perf 23120 df-cn 23210 df-cnp 23211 df-haus 23298 df-tx 23545 df-hmeo 23738 df-fil 23829 df-fm 23921 df-flim 23922 df-flf 23923 df-xms 24303 df-ms 24304 df-tms 24305 df-cncf 24863 df-limc 25851 df-dv 25852 df-log 26538 df-vma 27079

This theorem is referenced by: isppw2 27096

W3C validator