| 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 1137 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → 𝐾 ∈ ℕ) | |
| 2 | eleq1 2824 | . . . . 5 ⊢ (𝑃 = ((2↑𝐾) + 1) → (𝑃 ∈ ℙ ↔ ((2↑𝐾) + 1) ∈ ℙ)) | |
| 3 | 2 | biimpa 476 | . . . 4 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ((2↑𝐾) + 1) ∈ ℙ) |
| 4 | 3 | 3adant1 1131 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ((2↑𝐾) + 1) ∈ ℙ) |
| 5 | 2pwp1prm 48052 | . . 3 ⊢ ((𝐾 ∈ ℕ ∧ ((2↑𝐾) + 1) ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝐾 = (2↑𝑛)) | |
| 6 | 1, 4, 5 | syl2anc 585 | . 2 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝐾 = (2↑𝑛)) |
| 7 | simpl 482 | . . . . . . . . 9 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛)) → 𝑃 = ((2↑𝐾) + 1)) | |
| 8 | oveq2 7375 | . . . . . . . . . . 11 ⊢ (𝐾 = (2↑𝑛) → (2↑𝐾) = (2↑(2↑𝑛))) | |
| 9 | 8 | oveq1d 7382 | . . . . . . . . . 10 ⊢ (𝐾 = (2↑𝑛) → ((2↑𝐾) + 1) = ((2↑(2↑𝑛)) + 1)) |
| 10 | 9 | adantl 481 | . . . . . . . . 9 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛)) → ((2↑𝐾) + 1) = ((2↑(2↑𝑛)) + 1)) |
| 11 | 7, 10 | eqtrd 2771 | . . . . . . . 8 ⊢ ((𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛)) → 𝑃 = ((2↑(2↑𝑛)) + 1)) |
| 12 | fmtno 47992 | . . . . . . . . 9 ⊢ (𝑛 ∈ ℕ0 → (FermatNo‘𝑛) = ((2↑(2↑𝑛)) + 1)) | |
| 13 | 12 | eqcomd 2742 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 → ((2↑(2↑𝑛)) + 1) = (FermatNo‘𝑛)) |
| 14 | 11, 13 | sylan9eqr 2793 | . . . . . . 7 ⊢ ((𝑛 ∈ ℕ0 ∧ (𝑃 = ((2↑𝐾) + 1) ∧ 𝐾 = (2↑𝑛))) → 𝑃 = (FermatNo‘𝑛)) |
| 15 | 14 | exp32 420 | . . . . . 6 ⊢ (𝑛 ∈ ℕ0 → (𝑃 = ((2↑𝐾) + 1) → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛)))) |
| 16 | 15 | com12 32 | . . . . 5 ⊢ (𝑃 = ((2↑𝐾) + 1) → (𝑛 ∈ ℕ0 → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛)))) |
| 17 | 16 | 3ad2ant2 1135 | . . . 4 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → (𝑛 ∈ ℕ0 → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛)))) |
| 18 | 17 | imp 406 | . . 3 ⊢ (((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) ∧ 𝑛 ∈ ℕ0) → (𝐾 = (2↑𝑛) → 𝑃 = (FermatNo‘𝑛))) |
| 19 | 18 | reximdva 3150 | . 2 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → (∃𝑛 ∈ ℕ0 𝐾 = (2↑𝑛) → ∃𝑛 ∈ ℕ0 𝑃 = (FermatNo‘𝑛))) |
| 20 | 6, 19 | mpd 15 | 1 ⊢ ((𝐾 ∈ ℕ ∧ 𝑃 = ((2↑𝐾) + 1) ∧ 𝑃 ∈ ℙ) → ∃𝑛 ∈ ℕ0 𝑃 = (FermatNo‘𝑛)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 ‘cfv 6498 (class class class)co 7367 1c1 11039 + caddc 11041 ℕcn 12174 2c2 12236 ℕ0cn0 12437 ↑cexp 14023 ℙcprime 16640 FermatNocfmtno 47990 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-oi 9425 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-q 12899 df-rp 12943 df-fz 13462 df-fzo 13609 df-fl 13751 df-mod 13829 df-seq 13964 df-exp 14024 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-clim 15450 df-sum 15649 df-dvds 16222 df-gcd 16464 df-prm 16641 df-pc 16808 df-fmtno 47991 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |