| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isprm4 | Structured version Visualization version GIF version | ||
| Description: The predicate "is a prime number". A prime number is an integer greater than or equal to 2 whose only divisor greater than or equal to 2 is itself. (Contributed by Paul Chapman, 26-Oct-2012.) |
| Ref | Expression |
|---|---|
| isprm4 | ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isprm2 16730 | . 2 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) | |
| 2 | eluz2b3 12937 | . . . . . 6 ⊢ (𝑧 ∈ (ℤ≥‘2) ↔ (𝑧 ∈ ℕ ∧ 𝑧 ≠ 1)) | |
| 3 | 2 | imbi1i 352 | . . . . 5 ⊢ ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ ((𝑧 ∈ ℕ ∧ 𝑧 ≠ 1) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
| 4 | impexp 455 | . . . . . 6 ⊢ (((𝑧 ∈ ℕ ∧ 𝑧 ≠ 1) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)))) | |
| 5 | bi2.04 391 | . . . . . . . 8 ⊢ ((𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∥ 𝑃 → (𝑧 ≠ 1 → 𝑧 = 𝑃))) | |
| 6 | df-ne 2961 | . . . . . . . . . . 11 ⊢ (𝑧 ≠ 1 ↔ ¬ 𝑧 = 1) | |
| 7 | 6 | imbi1i 352 | . . . . . . . . . 10 ⊢ ((𝑧 ≠ 1 → 𝑧 = 𝑃) ↔ (¬ 𝑧 = 1 → 𝑧 = 𝑃)) |
| 8 | df-or 861 | . . . . . . . . . 10 ⊢ ((𝑧 = 1 ∨ 𝑧 = 𝑃) ↔ (¬ 𝑧 = 1 → 𝑧 = 𝑃)) | |
| 9 | 7, 8 | bitr4i 281 | . . . . . . . . 9 ⊢ ((𝑧 ≠ 1 → 𝑧 = 𝑃) ↔ (𝑧 = 1 ∨ 𝑧 = 𝑃)) |
| 10 | 9 | imbi2i 339 | . . . . . . . 8 ⊢ ((𝑧 ∥ 𝑃 → (𝑧 ≠ 1 → 𝑧 = 𝑃)) ↔ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))) |
| 11 | 5, 10 | bitri 278 | . . . . . . 7 ⊢ ((𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))) |
| 12 | 11 | imbi2i 339 | . . . . . 6 ⊢ ((𝑧 ∈ ℕ → (𝑧 ≠ 1 → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
| 13 | 4, 12 | bitri 278 | . . . . 5 ⊢ (((𝑧 ∈ ℕ ∧ 𝑧 ≠ 1) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
| 14 | 3, 13 | bitri 278 | . . . 4 ⊢ ((𝑧 ∈ (ℤ≥‘2) → (𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑧 ∈ ℕ → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
| 15 | 14 | ralbii2 3107 | . . 3 ⊢ (∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃) ↔ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))) |
| 16 | 15 | anbi2i 634 | . 2 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃)) ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))) |
| 17 | 1, 16 | bitr4i 281 | 1 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑧 ∈ (ℤ≥‘2)(𝑧 ∥ 𝑃 → 𝑧 = 𝑃))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 class class class wbr 5105 ‘cfv 6525 1c1 11089 ℕcn 12224 2c2 12286 ℤ≥cuz 12853 ∥ cdvds 16300 ℙcprime 16719 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-n0 12496 df-z 12583 df-uz 12854 df-rp 13008 df-seq 14029 df-exp 14089 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-dvds 16301 df-prm 16720 |
| This theorem is referenced by: nprm 16736 prmuz2 16744 dvdsprm 16752 isprm5 16756 |
| Copyright terms: Public domain | W3C validator |