| 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 16600. (Contributed by NM, 4-May-2005.) |
| Ref | Expression |
|---|---|
| prime | ⊢ (𝐴 ∈ ℕ → (∀𝑥 ∈ ℕ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ∀𝑥 ∈ ℕ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bi2.04 387 | . . . 4 ⊢ ((𝑥 ≠ 1 → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 = 𝐴)) ↔ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 ≠ 1 → 𝑥 = 𝐴))) | |
| 2 | impexp 450 | . . . 4 ⊢ (((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴) ↔ (𝑥 ≠ 1 → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 = 𝐴))) | |
| 3 | neor 3024 | . . . . 5 ⊢ ((𝑥 = 1 ∨ 𝑥 = 𝐴) ↔ (𝑥 ≠ 1 → 𝑥 = 𝐴)) | |
| 4 | 3 | imbi2i 336 | . . . 4 ⊢ (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 ≠ 1 → 𝑥 = 𝐴))) |
| 5 | 1, 2, 4 | 3bitr4ri 304 | . . 3 ⊢ (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴)) |
| 6 | nngt1ne1 12174 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ → (1 < 𝑥 ↔ 𝑥 ≠ 1)) | |
| 7 | 6 | adantl 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (1 < 𝑥 ↔ 𝑥 ≠ 1)) |
| 8 | 7 | anbi1d 631 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 9 | nnz 12509 | . . . . . . . . 9 ⊢ ((𝐴 / 𝑥) ∈ ℕ → (𝐴 / 𝑥) ∈ ℤ) | |
| 10 | nnre 12152 | . . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℝ) | |
| 11 | gtndiv 12569 | . . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℕ ∧ 𝐴 < 𝑥) → ¬ (𝐴 / 𝑥) ∈ ℤ) | |
| 12 | 11 | 3expia 1121 | . . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℕ) → (𝐴 < 𝑥 → ¬ (𝐴 / 𝑥) ∈ ℤ)) |
| 13 | 10, 12 | sylan 580 | . . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 < 𝑥 → ¬ (𝐴 / 𝑥) ∈ ℤ)) |
| 14 | 13 | con2d 134 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → ¬ 𝐴 < 𝑥)) |
| 15 | nnre 12152 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
| 16 | lenlt 11211 | . . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ ¬ 𝐴 < 𝑥)) | |
| 17 | 10, 15, 16 | syl2an 596 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝑥 ≤ 𝐴 ↔ ¬ 𝐴 < 𝑥)) |
| 18 | 14, 17 | sylibrd 259 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → 𝑥 ≤ 𝐴)) |
| 19 | 18 | ancoms 458 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → 𝑥 ≤ 𝐴)) |
| 20 | 9, 19 | syl5 34 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 ≤ 𝐴)) |
| 21 | 20 | pm4.71rd 562 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℕ ↔ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 22 | 21 | anbi2d 630 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ)))) |
| 23 | 3anass 1094 | . . . . . 6 ⊢ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) | |
| 24 | 22, 23 | bitr4di 289 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 25 | 8, 24 | bitr3d 281 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
| 26 | 25 | imbi1d 341 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴) ↔ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| 27 | 5, 26 | bitrid 283 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| 28 | 27 | ralbidva 3157 | 1 ⊢ (𝐴 ∈ ℕ → (∀𝑥 ∈ ℕ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ∀𝑥 ∈ ℕ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∀wral 3051 class class class wbr 5098 (class class class)co 7358 ℝcr 11025 1c1 11027 < clt 11166 ≤ cle 11167 / cdiv 11794 ℕcn 12145 ℤcz 12488 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-n0 12402 df-z 12489 |
| This theorem is referenced by: infpnlem1 16838 |
| Copyright terms: Public domain | W3C validator |