![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > infpn2 | GIF version |
Description: There exist infinitely many prime numbers: the set of all primes 𝑆 is unbounded by infpn 12493, so by unbendc 12605 it is infinite. This is Metamath 100 proof #11. (Contributed by NM, 5-May-2005.) |
Ref | Expression |
---|---|
infpn2.1 | ⊢ 𝑆 = {𝑛 ∈ ℕ ∣ (1 < 𝑛 ∧ ∀𝑚 ∈ ℕ ((𝑛 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑛)))} |
Ref | Expression |
---|---|
infpn2 | ⊢ 𝑆 ≈ ℕ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eluz2nn 9625 | . . . . . . 7 ⊢ (𝑟 ∈ (ℤ≥‘2) → 𝑟 ∈ ℕ) | |
2 | 1 | adantr 276 | . . . . . 6 ⊢ ((𝑟 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟))) → 𝑟 ∈ ℕ) |
3 | simpll 527 | . . . . . 6 ⊢ (((𝑟 ∈ ℕ ∧ 1 < 𝑟) ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))) → 𝑟 ∈ ℕ) | |
4 | eluz2b2 9662 | . . . . . . . 8 ⊢ (𝑟 ∈ (ℤ≥‘2) ↔ (𝑟 ∈ ℕ ∧ 1 < 𝑟)) | |
5 | 4 | a1i 9 | . . . . . . 7 ⊢ (𝑟 ∈ ℕ → (𝑟 ∈ (ℤ≥‘2) ↔ (𝑟 ∈ ℕ ∧ 1 < 𝑟))) |
6 | nndivdvds 11933 | . . . . . . . . 9 ⊢ ((𝑟 ∈ ℕ ∧ 𝑚 ∈ ℕ) → (𝑚 ∥ 𝑟 ↔ (𝑟 / 𝑚) ∈ ℕ)) | |
7 | 6 | imbi1d 231 | . . . . . . . 8 ⊢ ((𝑟 ∈ ℕ ∧ 𝑚 ∈ ℕ) → ((𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟)) ↔ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟)))) |
8 | 7 | ralbidva 2490 | . . . . . . 7 ⊢ (𝑟 ∈ ℕ → (∀𝑚 ∈ ℕ (𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟)) ↔ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟)))) |
9 | 5, 8 | anbi12d 473 | . . . . . 6 ⊢ (𝑟 ∈ ℕ → ((𝑟 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟))) ↔ ((𝑟 ∈ ℕ ∧ 1 < 𝑟) ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))))) |
10 | 2, 3, 9 | pm5.21nii 705 | . . . . 5 ⊢ ((𝑟 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟))) ↔ ((𝑟 ∈ ℕ ∧ 1 < 𝑟) ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟)))) |
11 | anass 401 | . . . . 5 ⊢ (((𝑟 ∈ ℕ ∧ 1 < 𝑟) ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))) ↔ (𝑟 ∈ ℕ ∧ (1 < 𝑟 ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))))) | |
12 | 10, 11 | bitri 184 | . . . 4 ⊢ ((𝑟 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟))) ↔ (𝑟 ∈ ℕ ∧ (1 < 𝑟 ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))))) |
13 | isprm2 12249 | . . . 4 ⊢ (𝑟 ∈ ℙ ↔ (𝑟 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑟 → (𝑚 = 1 ∨ 𝑚 = 𝑟)))) | |
14 | breq2 4033 | . . . . . 6 ⊢ (𝑛 = 𝑟 → (1 < 𝑛 ↔ 1 < 𝑟)) | |
15 | oveq1 5921 | . . . . . . . . 9 ⊢ (𝑛 = 𝑟 → (𝑛 / 𝑚) = (𝑟 / 𝑚)) | |
16 | 15 | eleq1d 2262 | . . . . . . . 8 ⊢ (𝑛 = 𝑟 → ((𝑛 / 𝑚) ∈ ℕ ↔ (𝑟 / 𝑚) ∈ ℕ)) |
17 | equequ2 1724 | . . . . . . . . 9 ⊢ (𝑛 = 𝑟 → (𝑚 = 𝑛 ↔ 𝑚 = 𝑟)) | |
18 | 17 | orbi2d 791 | . . . . . . . 8 ⊢ (𝑛 = 𝑟 → ((𝑚 = 1 ∨ 𝑚 = 𝑛) ↔ (𝑚 = 1 ∨ 𝑚 = 𝑟))) |
19 | 16, 18 | imbi12d 234 | . . . . . . 7 ⊢ (𝑛 = 𝑟 → (((𝑛 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑛)) ↔ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟)))) |
20 | 19 | ralbidv 2494 | . . . . . 6 ⊢ (𝑛 = 𝑟 → (∀𝑚 ∈ ℕ ((𝑛 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑛)) ↔ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟)))) |
21 | 14, 20 | anbi12d 473 | . . . . 5 ⊢ (𝑛 = 𝑟 → ((1 < 𝑛 ∧ ∀𝑚 ∈ ℕ ((𝑛 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑛))) ↔ (1 < 𝑟 ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))))) |
22 | infpn2.1 | . . . . 5 ⊢ 𝑆 = {𝑛 ∈ ℕ ∣ (1 < 𝑛 ∧ ∀𝑚 ∈ ℕ ((𝑛 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑛)))} | |
23 | 21, 22 | elrab2 2919 | . . . 4 ⊢ (𝑟 ∈ 𝑆 ↔ (𝑟 ∈ ℕ ∧ (1 < 𝑟 ∧ ∀𝑚 ∈ ℕ ((𝑟 / 𝑚) ∈ ℕ → (𝑚 = 1 ∨ 𝑚 = 𝑟))))) |
24 | 12, 13, 23 | 3bitr4i 212 | . . 3 ⊢ (𝑟 ∈ ℙ ↔ 𝑟 ∈ 𝑆) |
25 | 24 | eqriv 2190 | . 2 ⊢ ℙ = 𝑆 |
26 | prminf 12606 | . 2 ⊢ ℙ ≈ ℕ | |
27 | 25, 26 | eqbrtrri 4052 | 1 ⊢ 𝑆 ≈ ℕ |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 = wceq 1364 ∈ wcel 2164 ∀wral 2472 {crab 2476 class class class wbr 4029 ‘cfv 5250 (class class class)co 5914 ≈ cen 6787 1c1 7867 < clt 8048 / cdiv 8685 ℕcn 8976 2c2 9027 ℤ≥cuz 9586 ∥ cdvds 11924 ℙcprime 12239 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4462 ax-setind 4567 ax-iinf 4618 ax-cnex 7957 ax-resscn 7958 ax-1cn 7959 ax-1re 7960 ax-icn 7961 ax-addcl 7962 ax-addrcl 7963 ax-mulcl 7964 ax-mulrcl 7965 ax-addcom 7966 ax-mulcom 7967 ax-addass 7968 ax-mulass 7969 ax-distr 7970 ax-i2m1 7971 ax-0lt1 7972 ax-1rid 7973 ax-0id 7974 ax-rnegex 7975 ax-precex 7976 ax-cnre 7977 ax-pre-ltirr 7978 ax-pre-ltwlin 7979 ax-pre-lttrn 7980 ax-pre-apti 7981 ax-pre-ltadd 7982 ax-pre-mulgt0 7983 ax-pre-mulext 7984 ax-arch 7985 ax-caucvg 7986 |
This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4322 df-po 4325 df-iso 4326 df-iord 4395 df-on 4397 df-ilim 4398 df-suc 4400 df-iom 4621 df-xp 4663 df-rel 4664 df-cnv 4665 df-co 4666 df-dm 4667 df-rn 4668 df-res 4669 df-ima 4670 df-iota 5211 df-fun 5252 df-fn 5253 df-f 5254 df-f1 5255 df-fo 5256 df-f1o 5257 df-fv 5258 df-isom 5259 df-riota 5869 df-ov 5917 df-oprab 5918 df-mpo 5919 df-1st 6188 df-2nd 6189 df-recs 6353 df-frec 6439 df-1o 6464 df-2o 6465 df-er 6582 df-pm 6700 df-en 6790 df-dom 6791 df-fin 6792 df-sup 7037 df-inf 7038 df-dju 7091 df-inl 7100 df-inr 7101 df-case 7137 df-pnf 8050 df-mnf 8051 df-xr 8052 df-ltxr 8053 df-le 8054 df-sub 8186 df-neg 8187 df-reap 8588 df-ap 8595 df-div 8686 df-inn 8977 df-2 9035 df-3 9036 df-4 9037 df-n0 9235 df-z 9312 df-uz 9587 df-q 9679 df-rp 9714 df-fz 10069 df-fzo 10203 df-fl 10333 df-mod 10388 df-seqfrec 10513 df-exp 10604 df-fac 10791 df-cj 10980 df-re 10981 df-im 10982 df-rsqrt 11136 df-abs 11137 df-dvds 11925 df-prm 12240 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |