Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > pcprod | GIF version |
Description: The product of the primes taken to their respective powers reconstructs the original number. (Contributed by Mario Carneiro, 12-Mar-2014.) |
Ref | Expression |
---|---|
pcprod.1 | ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝑁)), 1)) |
Ref | Expression |
---|---|
pcprod | ⊢ (𝑁 ∈ ℕ → (seq1( · , 𝐹)‘𝑁) = 𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pcprod.1 | . . . . . 6 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝑁)), 1)) | |
2 | pccl 12246 | . . . . . . . . 9 ⊢ ((𝑛 ∈ ℙ ∧ 𝑁 ∈ ℕ) → (𝑛 pCnt 𝑁) ∈ ℕ0) | |
3 | 2 | ancoms 266 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝑛 ∈ ℙ) → (𝑛 pCnt 𝑁) ∈ ℕ0) |
4 | 3 | ralrimiva 2543 | . . . . . . 7 ⊢ (𝑁 ∈ ℕ → ∀𝑛 ∈ ℙ (𝑛 pCnt 𝑁) ∈ ℕ0) |
5 | 4 | adantl 275 | . . . . . 6 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → ∀𝑛 ∈ ℙ (𝑛 pCnt 𝑁) ∈ ℕ0) |
6 | simpr 109 | . . . . . 6 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℕ) | |
7 | simpl 108 | . . . . . 6 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → 𝑝 ∈ ℙ) | |
8 | oveq1 5858 | . . . . . 6 ⊢ (𝑛 = 𝑝 → (𝑛 pCnt 𝑁) = (𝑝 pCnt 𝑁)) | |
9 | 1, 5, 6, 7, 8 | pcmpt 12288 | . . . . 5 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → (𝑝 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0)) |
10 | iftrue 3530 | . . . . . . 7 ⊢ (𝑝 ≤ 𝑁 → if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0) = (𝑝 pCnt 𝑁)) | |
11 | 10 | adantl 275 | . . . . . 6 ⊢ (((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) ∧ 𝑝 ≤ 𝑁) → if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0) = (𝑝 pCnt 𝑁)) |
12 | iffalse 3533 | . . . . . . . 8 ⊢ (¬ 𝑝 ≤ 𝑁 → if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0) = 0) | |
13 | 12 | adantl 275 | . . . . . . 7 ⊢ (((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) ∧ ¬ 𝑝 ≤ 𝑁) → if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0) = 0) |
14 | prmz 12058 | . . . . . . . . . 10 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℤ) | |
15 | dvdsle 11797 | . . . . . . . . . 10 ⊢ ((𝑝 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑝 ∥ 𝑁 → 𝑝 ≤ 𝑁)) | |
16 | 14, 15 | sylan 281 | . . . . . . . . 9 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → (𝑝 ∥ 𝑁 → 𝑝 ≤ 𝑁)) |
17 | 16 | con3dimp 630 | . . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) ∧ ¬ 𝑝 ≤ 𝑁) → ¬ 𝑝 ∥ 𝑁) |
18 | pceq0 12268 | . . . . . . . . 9 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → ((𝑝 pCnt 𝑁) = 0 ↔ ¬ 𝑝 ∥ 𝑁)) | |
19 | 18 | adantr 274 | . . . . . . . 8 ⊢ (((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) ∧ ¬ 𝑝 ≤ 𝑁) → ((𝑝 pCnt 𝑁) = 0 ↔ ¬ 𝑝 ∥ 𝑁)) |
20 | 17, 19 | mpbird 166 | . . . . . . 7 ⊢ (((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) ∧ ¬ 𝑝 ≤ 𝑁) → (𝑝 pCnt 𝑁) = 0) |
21 | 13, 20 | eqtr4d 2206 | . . . . . 6 ⊢ (((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) ∧ ¬ 𝑝 ≤ 𝑁) → if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0) = (𝑝 pCnt 𝑁)) |
22 | 14 | adantr 274 | . . . . . . . 8 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → 𝑝 ∈ ℤ) |
23 | 6 | nnzd 9326 | . . . . . . . 8 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → 𝑁 ∈ ℤ) |
24 | zdcle 9281 | . . . . . . . 8 ⊢ ((𝑝 ∈ ℤ ∧ 𝑁 ∈ ℤ) → DECID 𝑝 ≤ 𝑁) | |
25 | 22, 23, 24 | syl2anc 409 | . . . . . . 7 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → DECID 𝑝 ≤ 𝑁) |
26 | exmiddc 831 | . . . . . . 7 ⊢ (DECID 𝑝 ≤ 𝑁 → (𝑝 ≤ 𝑁 ∨ ¬ 𝑝 ≤ 𝑁)) | |
27 | 25, 26 | syl 14 | . . . . . 6 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → (𝑝 ≤ 𝑁 ∨ ¬ 𝑝 ≤ 𝑁)) |
28 | 11, 21, 27 | mpjaodan 793 | . . . . 5 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → if(𝑝 ≤ 𝑁, (𝑝 pCnt 𝑁), 0) = (𝑝 pCnt 𝑁)) |
29 | 9, 28 | eqtrd 2203 | . . . 4 ⊢ ((𝑝 ∈ ℙ ∧ 𝑁 ∈ ℕ) → (𝑝 pCnt (seq1( · , 𝐹)‘𝑁)) = (𝑝 pCnt 𝑁)) |
30 | 29 | ancoms 266 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑝 ∈ ℙ) → (𝑝 pCnt (seq1( · , 𝐹)‘𝑁)) = (𝑝 pCnt 𝑁)) |
31 | 30 | ralrimiva 2543 | . 2 ⊢ (𝑁 ∈ ℕ → ∀𝑝 ∈ ℙ (𝑝 pCnt (seq1( · , 𝐹)‘𝑁)) = (𝑝 pCnt 𝑁)) |
32 | 1, 4 | pcmptcl 12287 | . . . . . 6 ⊢ (𝑁 ∈ ℕ → (𝐹:ℕ⟶ℕ ∧ seq1( · , 𝐹):ℕ⟶ℕ)) |
33 | 32 | simprd 113 | . . . . 5 ⊢ (𝑁 ∈ ℕ → seq1( · , 𝐹):ℕ⟶ℕ) |
34 | ffvelrn 5627 | . . . . 5 ⊢ ((seq1( · , 𝐹):ℕ⟶ℕ ∧ 𝑁 ∈ ℕ) → (seq1( · , 𝐹)‘𝑁) ∈ ℕ) | |
35 | 33, 34 | mpancom 420 | . . . 4 ⊢ (𝑁 ∈ ℕ → (seq1( · , 𝐹)‘𝑁) ∈ ℕ) |
36 | 35 | nnnn0d 9181 | . . 3 ⊢ (𝑁 ∈ ℕ → (seq1( · , 𝐹)‘𝑁) ∈ ℕ0) |
37 | nnnn0 9135 | . . 3 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
38 | pc11 12277 | . . 3 ⊢ (((seq1( · , 𝐹)‘𝑁) ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → ((seq1( · , 𝐹)‘𝑁) = 𝑁 ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (seq1( · , 𝐹)‘𝑁)) = (𝑝 pCnt 𝑁))) | |
39 | 36, 37, 38 | syl2anc 409 | . 2 ⊢ (𝑁 ∈ ℕ → ((seq1( · , 𝐹)‘𝑁) = 𝑁 ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (seq1( · , 𝐹)‘𝑁)) = (𝑝 pCnt 𝑁))) |
40 | 31, 39 | mpbird 166 | 1 ⊢ (𝑁 ∈ ℕ → (seq1( · , 𝐹)‘𝑁) = 𝑁) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 703 DECID wdc 829 = wceq 1348 ∈ wcel 2141 ∀wral 2448 ifcif 3525 class class class wbr 3987 ↦ cmpt 4048 ⟶wf 5192 ‘cfv 5196 (class class class)co 5851 0cc0 7767 1c1 7768 · cmul 7772 ≤ cle 7948 ℕcn 8871 ℕ0cn0 9128 ℤcz 9205 seqcseq 10394 ↑cexp 10468 ∥ cdvds 11742 ℙcprime 12054 pCnt cpc 12231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4102 ax-sep 4105 ax-nul 4113 ax-pow 4158 ax-pr 4192 ax-un 4416 ax-setind 4519 ax-iinf 4570 ax-cnex 7858 ax-resscn 7859 ax-1cn 7860 ax-1re 7861 ax-icn 7862 ax-addcl 7863 ax-addrcl 7864 ax-mulcl 7865 ax-mulrcl 7866 ax-addcom 7867 ax-mulcom 7868 ax-addass 7869 ax-mulass 7870 ax-distr 7871 ax-i2m1 7872 ax-0lt1 7873 ax-1rid 7874 ax-0id 7875 ax-rnegex 7876 ax-precex 7877 ax-cnre 7878 ax-pre-ltirr 7879 ax-pre-ltwlin 7880 ax-pre-lttrn 7881 ax-pre-apti 7882 ax-pre-ltadd 7883 ax-pre-mulgt0 7884 ax-pre-mulext 7885 ax-arch 7886 ax-caucvg 7887 |
This theorem depends on definitions: df-bi 116 df-stab 826 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-if 3526 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-int 3830 df-iun 3873 df-br 3988 df-opab 4049 df-mpt 4050 df-tr 4086 df-id 4276 df-po 4279 df-iso 4280 df-iord 4349 df-on 4351 df-ilim 4352 df-suc 4354 df-iom 4573 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-rn 4620 df-res 4621 df-ima 4622 df-iota 5158 df-fun 5198 df-fn 5199 df-f 5200 df-f1 5201 df-fo 5202 df-f1o 5203 df-fv 5204 df-isom 5205 df-riota 5807 df-ov 5854 df-oprab 5855 df-mpo 5856 df-1st 6117 df-2nd 6118 df-recs 6282 df-frec 6368 df-1o 6393 df-2o 6394 df-er 6511 df-en 6717 df-fin 6719 df-sup 6959 df-inf 6960 df-pnf 7949 df-mnf 7950 df-xr 7951 df-ltxr 7952 df-le 7953 df-sub 8085 df-neg 8086 df-reap 8487 df-ap 8494 df-div 8583 df-inn 8872 df-2 8930 df-3 8931 df-4 8932 df-n0 9129 df-xnn0 9192 df-z 9206 df-uz 9481 df-q 9572 df-rp 9604 df-fz 9959 df-fzo 10092 df-fl 10219 df-mod 10272 df-seqfrec 10395 df-exp 10469 df-cj 10799 df-re 10800 df-im 10801 df-rsqrt 10955 df-abs 10956 df-dvds 11743 df-gcd 11891 df-prm 12055 df-pc 12232 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |