| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvdsprime | Structured version Visualization version GIF version | ||
| Description: If 𝑀 divides a prime, then 𝑀 is either the prime or one. (Contributed by Scott Fenton, 8-Apr-2014.) |
| Ref | Expression |
|---|---|
| dvdsprime | ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isprm2 16610 | . . 3 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)))) | |
| 2 | breq1 5089 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑃 ↔ 𝑀 ∥ 𝑃)) | |
| 3 | eqeq1 2741 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑚 = 1 ↔ 𝑀 = 1)) | |
| 4 | eqeq1 2741 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑚 = 𝑃 ↔ 𝑀 = 𝑃)) | |
| 5 | 3, 4 | orbi12d 919 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → ((𝑚 = 1 ∨ 𝑚 = 𝑃) ↔ (𝑀 = 1 ∨ 𝑀 = 𝑃))) |
| 6 | orcom 871 | . . . . . . 7 ⊢ ((𝑀 = 1 ∨ 𝑀 = 𝑃) ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1)) | |
| 7 | 5, 6 | bitrdi 287 | . . . . . 6 ⊢ (𝑚 = 𝑀 → ((𝑚 = 1 ∨ 𝑚 = 𝑃) ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 8 | 2, 7 | imbi12d 344 | . . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)) ↔ (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1)))) |
| 9 | 8 | rspccva 3564 | . . . 4 ⊢ ((∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)) ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 10 | 9 | adantll 715 | . . 3 ⊢ (((𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃))) ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 11 | 1, 10 | sylanb 582 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 12 | prmz 16603 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 13 | iddvds 16197 | . . . . . 6 ⊢ (𝑃 ∈ ℤ → 𝑃 ∥ 𝑃) | |
| 14 | 12, 13 | syl 17 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∥ 𝑃) |
| 15 | 14 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → 𝑃 ∥ 𝑃) |
| 16 | breq1 5089 | . . . 4 ⊢ (𝑀 = 𝑃 → (𝑀 ∥ 𝑃 ↔ 𝑃 ∥ 𝑃)) | |
| 17 | 15, 16 | syl5ibrcom 247 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 = 𝑃 → 𝑀 ∥ 𝑃)) |
| 18 | 1dvds 16198 | . . . . . 6 ⊢ (𝑃 ∈ ℤ → 1 ∥ 𝑃) | |
| 19 | 12, 18 | syl 17 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 1 ∥ 𝑃) |
| 20 | 19 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → 1 ∥ 𝑃) |
| 21 | breq1 5089 | . . . 4 ⊢ (𝑀 = 1 → (𝑀 ∥ 𝑃 ↔ 1 ∥ 𝑃)) | |
| 22 | 20, 21 | syl5ibrcom 247 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 = 1 → 𝑀 ∥ 𝑃)) |
| 23 | 17, 22 | jaod 860 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → ((𝑀 = 𝑃 ∨ 𝑀 = 1) → 𝑀 ∥ 𝑃)) |
| 24 | 11, 23 | impbid 212 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5086 ‘cfv 6490 1c1 11028 ℕcn 12146 2c2 12201 ℤcz 12489 ℤ≥cuz 12752 ∥ cdvds 16180 ℙcprime 16599 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-pre-sup 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-1o 8396 df-2o 8397 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-fin 8888 df-sup 9346 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-sub 11367 df-neg 11368 df-div 11796 df-nn 12147 df-2 12209 df-3 12210 df-n0 12403 df-z 12490 df-uz 12753 df-rp 12907 df-seq 13926 df-exp 13986 df-cj 15023 df-re 15024 df-im 15025 df-sqrt 15159 df-abs 15160 df-dvds 16181 df-prm 16600 |
| This theorem is referenced by: prm2orodd 16619 pythagtriplem4 16748 odcau 19537 prmcyg 19827 prmgrpsimpgd 20049 rtprmirr 26710 2lgs 27358 aks6d1c2p2 42550 goldbachthlem2 47980 fmtnofac1 48004 oddprmALTV 48121 |
| Copyright terms: Public domain | W3C validator |