| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prime | Structured version Visualization version GIF version | ||
| Description: Two ways to express "𝐴 is a prime number (or 1)". See also isprm 16721. (Contributed by NM, 4-May-2005.) |
| Ref | Expression |
|---|---|
| prime | ⊢ (𝐴 ∈ ℕ → (∀𝑥 ∈ ℕ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ∀𝑥 ∈ ℕ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bi2.04 391 | . . . 4 ⊢ ((𝑥 ≠ 1 → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 = 𝐴)) ↔ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 ≠ 1 → 𝑥 = 𝐴))) | |
| 2 | impexp 455 | . . . 4 ⊢ (((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴) ↔ (𝑥 ≠ 1 → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 = 𝐴))) | |
| 3 | neor 3052 | . . . . 5 ⊢ ((𝑥 = 1 ∨ 𝑥 = 𝐴) ↔ (𝑥 ≠ 1 → 𝑥 = 𝐴)) | |
| 4 | 3 | imbi2i 339 | . . . 4 ⊢ (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 ≠ 1 → 𝑥 = 𝐴))) |
| 5 | 1, 2, 4 | 3bitr4ri 307 | . . 3 ⊢ (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴)) |
| 6 | nngt1ne1 12256 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ → (1 < 𝑥 ↔ 𝑥 ≠ 1)) | |
| 7 | 6 | adantl 486 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (1 < 𝑥 ↔ 𝑥 ≠ 1)) |
| 8 | 7 | anbi1d 642 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 9 | nnz 12603 | . . . . . . . . 9 ⊢ ((𝐴 / 𝑥) ∈ ℕ → (𝐴 / 𝑥) ∈ ℤ) | |
| 10 | nnre 12231 | . . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℝ) | |
| 11 | gtndiv 12664 | . . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℕ ∧ 𝐴 < 𝑥) → ¬ (𝐴 / 𝑥) ∈ ℤ) | |
| 12 | 11 | 3expia 1137 | . . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℕ) → (𝐴 < 𝑥 → ¬ (𝐴 / 𝑥) ∈ ℤ)) |
| 13 | 10, 12 | sylan 591 | . . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 < 𝑥 → ¬ (𝐴 / 𝑥) ∈ ℤ)) |
| 14 | 13 | con2d 135 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → ¬ 𝐴 < 𝑥)) |
| 15 | nnre 12231 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
| 16 | lenlt 11276 | . . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ ¬ 𝐴 < 𝑥)) | |
| 17 | 10, 15, 16 | syl2an 607 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝑥 ≤ 𝐴 ↔ ¬ 𝐴 < 𝑥)) |
| 18 | 14, 17 | sylibrd 262 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → 𝑥 ≤ 𝐴)) |
| 19 | 18 | ancoms 463 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → 𝑥 ≤ 𝐴)) |
| 20 | 9, 19 | syl5 35 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 ≤ 𝐴)) |
| 21 | 20 | pm4.71rd 571 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℕ ↔ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 22 | 21 | anbi2d 641 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ)))) |
| 23 | 3anass 1109 | . . . . . 6 ⊢ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) | |
| 24 | 22, 23 | bitr4di 292 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 25 | 8, 24 | bitr3d 284 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 26 | 25 | imbi1d 344 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴) ↔ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| 27 | 5, 26 | bitrid 286 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| 28 | 27 | ralbidva 3186 | 1 ⊢ (𝐴 ∈ ℕ → (∀𝑥 ∈ ℕ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ∀𝑥 ∈ ℕ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 class class class wbr 5105 (class class class)co 7400 ℝcr 11087 1c1 11089 < clt 11231 ≤ cle 11232 / cdiv 11859 ℕcn 12224 ℤcz 12582 |
| 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-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 |
| 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-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 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-n0 12496 df-z 12583 |
| This theorem is referenced by: infpnlem1 16960 |
| Copyright terms: Public domain | W3C validator |