| 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 16746 | . . 3 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)))) | |
| 2 | breq1 5111 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑃 ↔ 𝑀 ∥ 𝑃)) | |
| 3 | eqeq1 2766 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑚 = 1 ↔ 𝑀 = 1)) | |
| 4 | eqeq1 2766 | . . . . . . . 8 ⊢ (𝑚 = 𝑀 → (𝑚 = 𝑃 ↔ 𝑀 = 𝑃)) | |
| 5 | 3, 4 | orbi12d 931 | . . . . . . 7 ⊢ (𝑚 = 𝑀 → ((𝑚 = 1 ∨ 𝑚 = 𝑃) ↔ (𝑀 = 1 ∨ 𝑀 = 𝑃))) |
| 6 | orcom 883 | . . . . . . 7 ⊢ ((𝑀 = 1 ∨ 𝑀 = 𝑃) ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1)) | |
| 7 | 5, 6 | bitrdi 290 | . . . . . 6 ⊢ (𝑚 = 𝑀 → ((𝑚 = 1 ∨ 𝑚 = 𝑃) ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 8 | 2, 7 | imbi12d 347 | . . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)) ↔ (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1)))) |
| 9 | 8 | rspccva 3579 | . . . 4 ⊢ ((∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)) ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 10 | 9 | adantll 726 | . . 3 ⊢ (((𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃))) ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 11 | 1, 10 | sylanb 592 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 12 | prmz 16739 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 13 | iddvds 16333 | . . . . . 6 ⊢ (𝑃 ∈ ℤ → 𝑃 ∥ 𝑃) | |
| 14 | 12, 13 | syl 18 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∥ 𝑃) |
| 15 | 14 | adantr 485 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → 𝑃 ∥ 𝑃) |
| 16 | breq1 5111 | . . . 4 ⊢ (𝑀 = 𝑃 → (𝑀 ∥ 𝑃 ↔ 𝑃 ∥ 𝑃)) | |
| 17 | 15, 16 | syl5ibrcom 250 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 = 𝑃 → 𝑀 ∥ 𝑃)) |
| 18 | 1dvds 16334 | . . . . . 6 ⊢ (𝑃 ∈ ℤ → 1 ∥ 𝑃) | |
| 19 | 12, 18 | syl 18 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 1 ∥ 𝑃) |
| 20 | 19 | adantr 485 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → 1 ∥ 𝑃) |
| 21 | breq1 5111 | . . . 4 ⊢ (𝑀 = 1 → (𝑀 ∥ 𝑃 ↔ 1 ∥ 𝑃)) | |
| 22 | 20, 21 | syl5ibrcom 250 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 = 1 → 𝑀 ∥ 𝑃)) |
| 23 | 17, 22 | jaod 872 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → ((𝑀 = 𝑃 ∨ 𝑀 = 1) → 𝑀 ∥ 𝑃)) |
| 24 | 11, 23 | impbid 215 | 1 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 ↔ (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1569 ∈ wcel 2142 ∀wral 3078 class class class wbr 5108 ‘cfv 6536 1c1 11107 ℕcn 12239 2c2 12301 ℤcz 12597 ℤ≥cuz 12868 ∥ cdvds 16316 ℙcprime 16735 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-1o 8451 df-2o 8452 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9400 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-3 12310 df-n0 12511 df-z 12598 df-uz 12869 df-rp 13023 df-seq 14045 df-exp 14105 df-cj 15157 df-re 15158 df-im 15159 df-sqrt 15293 df-abs 15294 df-dvds 16317 df-prm 16736 |
| This theorem is used by: prm2orodd 16755 pythagtriplem4 16885 odcau 19680 prmcyg 19970 prmgrpsimpgd 20192 rtprmirr 26936 2lgs 27582 aks6d1c2p2 42914 goldbachthlem2 48326 fmtnofac1 48350 oddprmALTV 48480 |
| Copyright terms: Public domain | W3C validator |