![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > pcmptcl | Structured version Visualization version GIF version |
Description: Closure for the prime power map. (Contributed by Mario Carneiro, 12-Mar-2014.) |
Ref | Expression |
---|---|
pcmpt.1 | ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1)) |
pcmpt.2 | ⊢ (𝜑 → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0) |
Ref | Expression |
---|---|
pcmptcl | ⊢ (𝜑 → (𝐹:ℕ⟶ℕ ∧ seq1( · , 𝐹):ℕ⟶ℕ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pcmpt.2 | . . . 4 ⊢ (𝜑 → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0) | |
2 | pm2.27 42 | . . . . . . . 8 ⊢ (𝑛 ∈ ℙ → ((𝑛 ∈ ℙ → 𝐴 ∈ ℕ0) → 𝐴 ∈ ℕ0)) | |
3 | iftrue 4356 | . . . . . . . . . . 11 ⊢ (𝑛 ∈ ℙ → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = (𝑛↑𝐴)) | |
4 | 3 | adantr 473 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = (𝑛↑𝐴)) |
5 | prmnn 15874 | . . . . . . . . . . 11 ⊢ (𝑛 ∈ ℙ → 𝑛 ∈ ℕ) | |
6 | nnexpcl 13257 | . . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ ∧ 𝐴 ∈ ℕ0) → (𝑛↑𝐴) ∈ ℕ) | |
7 | 5, 6 | sylan 572 | . . . . . . . . . 10 ⊢ ((𝑛 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → (𝑛↑𝐴) ∈ ℕ) |
8 | 4, 7 | eqeltrd 2866 | . . . . . . . . 9 ⊢ ((𝑛 ∈ ℙ ∧ 𝐴 ∈ ℕ0) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ) |
9 | 8 | ex 405 | . . . . . . . 8 ⊢ (𝑛 ∈ ℙ → (𝐴 ∈ ℕ0 → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ)) |
10 | 2, 9 | syld 47 | . . . . . . 7 ⊢ (𝑛 ∈ ℙ → ((𝑛 ∈ ℙ → 𝐴 ∈ ℕ0) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ)) |
11 | iffalse 4359 | . . . . . . . . 9 ⊢ (¬ 𝑛 ∈ ℙ → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = 1) | |
12 | 1nn 11452 | . . . . . . . . 9 ⊢ 1 ∈ ℕ | |
13 | 11, 12 | syl6eqel 2874 | . . . . . . . 8 ⊢ (¬ 𝑛 ∈ ℙ → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ) |
14 | 13 | a1d 25 | . . . . . . 7 ⊢ (¬ 𝑛 ∈ ℙ → ((𝑛 ∈ ℙ → 𝐴 ∈ ℕ0) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ)) |
15 | 10, 14 | pm2.61i 177 | . . . . . 6 ⊢ ((𝑛 ∈ ℙ → 𝐴 ∈ ℕ0) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ) |
16 | 15 | a1d 25 | . . . . 5 ⊢ ((𝑛 ∈ ℙ → 𝐴 ∈ ℕ0) → (𝑛 ∈ ℕ → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ)) |
17 | 16 | ralimi2 3107 | . . . 4 ⊢ (∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0 → ∀𝑛 ∈ ℕ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ) |
18 | 1, 17 | syl 17 | . . 3 ⊢ (𝜑 → ∀𝑛 ∈ ℕ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ) |
19 | pcmpt.1 | . . . 4 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1)) | |
20 | 19 | fmpt 6697 | . . 3 ⊢ (∀𝑛 ∈ ℕ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ ℕ ↔ 𝐹:ℕ⟶ℕ) |
21 | 18, 20 | sylib 210 | . 2 ⊢ (𝜑 → 𝐹:ℕ⟶ℕ) |
22 | nnuz 12095 | . . 3 ⊢ ℕ = (ℤ≥‘1) | |
23 | 1zzd 11826 | . . 3 ⊢ (𝜑 → 1 ∈ ℤ) | |
24 | 21 | ffvelrnda 6676 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) ∈ ℕ) |
25 | nnmulcl 11464 | . . . 4 ⊢ ((𝑘 ∈ ℕ ∧ 𝑝 ∈ ℕ) → (𝑘 · 𝑝) ∈ ℕ) | |
26 | 25 | adantl 474 | . . 3 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ 𝑝 ∈ ℕ)) → (𝑘 · 𝑝) ∈ ℕ) |
27 | 22, 23, 24, 26 | seqf 13206 | . 2 ⊢ (𝜑 → seq1( · , 𝐹):ℕ⟶ℕ) |
28 | 21, 27 | jca 504 | 1 ⊢ (𝜑 → (𝐹:ℕ⟶ℕ ∧ seq1( · , 𝐹):ℕ⟶ℕ)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 387 = wceq 1507 ∈ wcel 2050 ∀wral 3088 ifcif 4350 ↦ cmpt 5008 ⟶wf 6184 (class class class)co 6976 1c1 10336 · cmul 10340 ℕcn 11439 ℕ0cn0 11707 seqcseq 13184 ↑cexp 13244 ℙcprime 15871 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2750 ax-sep 5060 ax-nul 5067 ax-pow 5119 ax-pr 5186 ax-un 7279 ax-cnex 10391 ax-resscn 10392 ax-1cn 10393 ax-icn 10394 ax-addcl 10395 ax-addrcl 10396 ax-mulcl 10397 ax-mulrcl 10398 ax-mulcom 10399 ax-addass 10400 ax-mulass 10401 ax-distr 10402 ax-i2m1 10403 ax-1ne0 10404 ax-1rid 10405 ax-rnegex 10406 ax-rrecex 10407 ax-cnre 10408 ax-pre-lttri 10409 ax-pre-lttrn 10410 ax-pre-ltadd 10411 ax-pre-mulgt0 10412 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3or 1069 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2584 df-clab 2759 df-cleq 2771 df-clel 2846 df-nfc 2918 df-ne 2968 df-nel 3074 df-ral 3093 df-rex 3094 df-reu 3095 df-rab 3097 df-v 3417 df-sbc 3682 df-csb 3787 df-dif 3832 df-un 3834 df-in 3836 df-ss 3843 df-pss 3845 df-nul 4179 df-if 4351 df-pw 4424 df-sn 4442 df-pr 4444 df-tp 4446 df-op 4448 df-uni 4713 df-iun 4794 df-br 4930 df-opab 4992 df-mpt 5009 df-tr 5031 df-id 5312 df-eprel 5317 df-po 5326 df-so 5327 df-fr 5366 df-we 5368 df-xp 5413 df-rel 5414 df-cnv 5415 df-co 5416 df-dm 5417 df-rn 5418 df-res 5419 df-ima 5420 df-pred 5986 df-ord 6032 df-on 6033 df-lim 6034 df-suc 6035 df-iota 6152 df-fun 6190 df-fn 6191 df-f 6192 df-f1 6193 df-fo 6194 df-f1o 6195 df-fv 6196 df-riota 6937 df-ov 6979 df-oprab 6980 df-mpo 6981 df-om 7397 df-1st 7501 df-2nd 7502 df-wrecs 7750 df-recs 7812 df-rdg 7850 df-er 8089 df-en 8307 df-dom 8308 df-sdom 8309 df-pnf 10476 df-mnf 10477 df-xr 10478 df-ltxr 10479 df-le 10480 df-sub 10672 df-neg 10673 df-nn 11440 df-n0 11708 df-z 11794 df-uz 12059 df-fz 12709 df-seq 13185 df-exp 13245 df-prm 15872 |
This theorem is referenced by: pcmpt 16084 pcmpt2 16085 pcmptdvds 16086 pcprod 16087 1arithlem4 16118 bposlem3 25564 bposlem5 25566 bposlem6 25567 |
Copyright terms: Public domain | W3C validator |