| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > 2pwp1prmfmtno | Structured version Visualization version GIF version | ||
| Description: Every prime number of the form ((2↑𝑘) + 1) must be a Fermat number. (Contributed by AV, 7-Aug-2021.) |
| Ref | Expression |
|---|---|
| 2pwp1prmfmtno | ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝑃 = (FermatNo‘𝑛)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1152 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → 𝐾 ∈ ℕ) | |
| 2 | eleq1 2857 | . . . . 5 ⊢ (𝑃 = ((2↑𝐾) + 1) → (𝑃 ∈ ℙ ↔ ((2↑𝐾) + 1) ∈ ℙ)) | |
| 3 | 2 | biimpa 481 | . . . 4 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ((2↑𝐾) + 1) ∈ ℙ) |
| 4 | 3 | 3adant1 1146 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ((2↑𝐾) + 1) ∈ ℙ) |
| 5 | 2pwp1prm 48229 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ ((2↑𝐾) + 1) ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝐾 = (2↑𝑛)) | |
| 6 | 1, 4, 5 | syl2anc 595 | . 2 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝐾 = (2↑𝑛)) |
| 7 | simpl 487 | . . . . . . . . 9 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛)) → 𝑃 = ((2↑𝐾) + 1)) | |
| 8 | oveq2 7419 | . . . . . . . . . . 11 ⊢ (𝐾 = (2↑𝑛) → (2↑𝐾) = (2↑(2↑𝑛))) | |
| 9 | 8 | oveq1d 7426 | . . . . . . . . . 10 ⊢ (𝐾 = (2↑𝑛) → ((2↑𝐾) + 1) = ((2↑(2↑𝑛)) + 1)) |
| 10 | 9 | adantl 486 | . . . . . . . . 9 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛)) → ((2↑𝐾) + 1) = ((2↑(2↑𝑛)) + 1)) |
| 11 | 7, 10 | eqtrd 2804 | . . . . . . . 8 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛)) → 𝑃 = ((2↑(2↑𝑛)) + 1)) |
| 12 | fmtno 48169 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 → (FermatNo‘𝑛) = ((2↑(2↑𝑛)) + 1)) | |
| 13 | 12 | eqcomd 2775 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 → ((2↑(2↑𝑛)) + 1) = (FermatNo‘𝑛)) |
| 14 | 11, 13 | sylan9eqr 2826 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0 ∧ (𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛))) → 𝑃 = (FermatNo‘𝑛)) |
| 15 | 14 | exp32 425 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑃 = ((2↑𝐾) + 1) → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛)))) |
| 16 | 15 | com12 33 | . . . . 5 ⊢ (𝑃 = ((2↑𝐾) + 1) → (𝑛 ∈ ℕ0 → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛)))) |
| 17 | 16 | 3ad2ant2 1150 | . . . 4 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → (𝑛 ∈ ℕ0 → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛)))) |
| 18 | 17 | imp 411 | . . 3 ⊢ (((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) ∧ 𝑛 ∈ ℕ0) → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛))) |
| 19 | 18 | reximdva 3184 | . 2 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → (∃𝑛 ∈ ℕ0 𝐾 = (2↑𝑛) → ∃𝑛 ∈ ℕ0 𝑃 = (FermatNo‘𝑛))) |
| 20 | 6, 19 | mpd 16 | 1 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝑃 = (FermatNo‘𝑛)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 ‘cfv 6537 (class class class)co 7411 1c1 11100 + caddc 11102 ℕcn 12232 2c2 12294 ℕ0cn0 12503 ↑cexp 14096 ℙcprime 16728 FermatNocfmtno 48167 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-inf2 9609 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 ax-pre-sup 11177 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-sup 9401 df-inf 9402 df-oi 9471 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-div 11871 df-nn 12233 df-2 12302 df-3 12303 df-n0 12504 df-z 12591 df-uz 12862 df-q 12972 df-rp 13016 df-fz 13535 df-fzo 13682 df-fl 13824 df-mod 13902 df-seq 14037 df-exp 14097 df-hash 14366 df-cj 15149 df-re 15150 df-im 15151 df-sqrt 15285 df-abs 15286 df-clim 15538 df-sum 15737 df-dvds 16310 df-gcd 16552 df-prm 16729 df-pc 16896 df-fmtno 48168 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |