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 16359. (Contributed by NM, 4-May-2005.) |
Ref | Expression |
---|---|
prime | ⊢ (𝐴 ∈ ℕ → (∀𝑥 ∈ ℕ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ∀𝑥 ∈ ℕ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bi2.04 388 | . . . 4 ⊢ ((𝑥 ≠ 1 → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 = 𝐴)) ↔ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 ≠ 1 → 𝑥 = 𝐴))) | |
2 | impexp 450 | . . . 4 ⊢ (((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴) ↔ (𝑥 ≠ 1 → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 = 𝐴))) | |
3 | neor 3037 | . . . . 5 ⊢ ((𝑥 = 1 ∨ 𝑥 = 𝐴) ↔ (𝑥 ≠ 1 → 𝑥 = 𝐴)) | |
4 | 3 | imbi2i 335 | . . . 4 ⊢ (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 ≠ 1 → 𝑥 = 𝐴))) |
5 | 1, 2, 4 | 3bitr4ri 303 | . . 3 ⊢ (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴)) |
6 | nngt1ne1 11985 | . . . . . . 7 ⊢ (𝑥 ∈ ℕ → (1 < 𝑥 ↔ 𝑥 ≠ 1)) | |
7 | 6 | adantl 481 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (1 < 𝑥 ↔ 𝑥 ≠ 1)) |
8 | 7 | anbi1d 629 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
9 | nnz 12325 | . . . . . . . . 9 ⊢ ((𝐴 / 𝑥) ∈ ℕ → (𝐴 / 𝑥) ∈ ℤ) | |
10 | nnre 11963 | . . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℕ → 𝑥 ∈ ℝ) | |
11 | gtndiv 12380 | . . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℕ ∧ 𝐴 < 𝑥) → ¬ (𝐴 / 𝑥) ∈ ℤ) | |
12 | 11 | 3expia 1119 | . . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℕ) → (𝐴 < 𝑥 → ¬ (𝐴 / 𝑥) ∈ ℤ)) |
13 | 10, 12 | sylan 579 | . . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝐴 < 𝑥 → ¬ (𝐴 / 𝑥) ∈ ℤ)) |
14 | 13 | con2d 134 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → ¬ 𝐴 < 𝑥)) |
15 | nnre 11963 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℝ) | |
16 | lenlt 11037 | . . . . . . . . . . . 12 ⊢ ((𝑥 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑥 ≤ 𝐴 ↔ ¬ 𝐴 < 𝑥)) | |
17 | 10, 15, 16 | syl2an 595 | . . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → (𝑥 ≤ 𝐴 ↔ ¬ 𝐴 < 𝑥)) |
18 | 14, 17 | sylibrd 258 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℕ ∧ 𝐴 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → 𝑥 ≤ 𝐴)) |
19 | 18 | ancoms 458 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℤ → 𝑥 ≤ 𝐴)) |
20 | 9, 19 | syl5 34 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℕ → 𝑥 ≤ 𝐴)) |
21 | 20 | pm4.71rd 562 | . . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝐴 / 𝑥) ∈ ℕ ↔ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
22 | 21 | anbi2d 628 | . . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ)))) |
23 | 3anass 1093 | . . . . . 6 ⊢ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ (𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) | |
24 | 22, 23 | bitr4di 288 | . . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((1 < 𝑥 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
25 | 8, 24 | bitr3d 280 | . . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → ((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) ↔ (1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ))) |
26 | 25 | imbi1d 341 | . . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (((𝑥 ≠ 1 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴) ↔ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
27 | 5, 26 | syl5bb 282 | . 2 ⊢ ((𝐴 ∈ ℕ ∧ 𝑥 ∈ ℕ) → (((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
28 | 27 | ralbidva 3121 | 1 ⊢ (𝐴 ∈ ℕ → (∀𝑥 ∈ ℕ ((𝐴 / 𝑥) ∈ ℕ → (𝑥 = 1 ∨ 𝑥 = 𝐴)) ↔ ∀𝑥 ∈ ℕ ((1 < 𝑥 ∧ 𝑥 ≤ 𝐴 ∧ (𝐴 / 𝑥) ∈ ℕ) → 𝑥 = 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 843 ∧ w3a 1085 = wceq 1541 ∈ wcel 2109 ≠ wne 2944 ∀wral 3065 class class class wbr 5078 (class class class)co 7268 ℝcr 10854 1c1 10856 < clt 10993 ≤ cle 10994 / cdiv 11615 ℕcn 11956 ℤcz 12302 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-resscn 10912 ax-1cn 10913 ax-icn 10914 ax-addcl 10915 ax-addrcl 10916 ax-mulcl 10917 ax-mulrcl 10918 ax-mulcom 10919 ax-addass 10920 ax-mulass 10921 ax-distr 10922 ax-i2m1 10923 ax-1ne0 10924 ax-1rid 10925 ax-rnegex 10926 ax-rrecex 10927 ax-cnre 10928 ax-pre-lttri 10929 ax-pre-lttrn 10930 ax-pre-ltadd 10931 ax-pre-mulgt0 10932 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3072 df-rmo 3073 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-pss 3910 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4845 df-iun 4931 df-br 5079 df-opab 5141 df-mpt 5162 df-tr 5196 df-id 5488 df-eprel 5494 df-po 5502 df-so 5503 df-fr 5543 df-we 5545 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-pred 6199 df-ord 6266 df-on 6267 df-lim 6268 df-suc 6269 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7701 df-2nd 7818 df-frecs 8081 df-wrecs 8112 df-recs 8186 df-rdg 8225 df-er 8472 df-en 8708 df-dom 8709 df-sdom 8710 df-pnf 10995 df-mnf 10996 df-xr 10997 df-ltxr 10998 df-le 10999 df-sub 11190 df-neg 11191 df-div 11616 df-nn 11957 df-n0 12217 df-z 12303 |
This theorem is referenced by: infpnlem1 16592 |
Copyright terms: Public domain | W3C validator |