| 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 16614 | . . 3 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)))) | |
| 2 | breq1 5102 | . . . . . 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 3576 | . . . 4 ⊢ ((∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃)) ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 10 | 9 | adantll 715 | . . 3 ⊢ (((𝑃 ∈ (ℤ≥‘2) ∧ ∀𝑚 ∈ ℕ (𝑚 ∥ 𝑃 → (𝑚 = 1 ∨ 𝑚 = 𝑃))) ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 11 | 1, 10 | sylanb 582 | . 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 ∥ 𝑃 → (𝑀 = 𝑃 ∨ 𝑀 = 1))) |
| 12 | prmz 16607 | . . . . . 6 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ) | |
| 13 | iddvds 16201 | . . . . . 6 ⊢ (𝑃 ∈ ℤ → 𝑃 ∥ 𝑃) | |
| 14 | 12, 13 | syl 17 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 𝑃 ∥ 𝑃) |
| 15 | 14 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → 𝑃 ∥ 𝑃) |
| 16 | breq1 5102 | . . . 4 ⊢ (𝑀 = 𝑃 → (𝑀 ∥ 𝑃 ↔ 𝑃 ∥ 𝑃)) | |
| 17 | 15, 16 | syl5ibrcom 247 | . . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → (𝑀 = 𝑃 → 𝑀 ∥ 𝑃)) |
| 18 | 1dvds 16202 | . . . . . 6 ⊢ (𝑃 ∈ ℤ → 1 ∥ 𝑃) | |
| 19 | 12, 18 | syl 17 | . . . . 5 ⊢ (𝑃 ∈ ℙ → 1 ∥ 𝑃) |
| 20 | 19 | adantr 480 | . . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝑀 ∈ ℕ) → 1 ∥ 𝑃) |
| 21 | breq1 5102 | . . . 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 5099 ‘cfv 6493 1c1 11032 ℕcn 12150 2c2 12205 ℤcz 12493 ℤ≥cuz 12756 ∥ cdvds 16184 ℙcprime 16603 |
| 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 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108 ax-pre-sup 11109 |
| 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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-2o 8401 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-sup 9350 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-div 11800 df-nn 12151 df-2 12213 df-3 12214 df-n0 12407 df-z 12494 df-uz 12757 df-rp 12911 df-seq 13930 df-exp 13990 df-cj 15027 df-re 15028 df-im 15029 df-sqrt 15163 df-abs 15164 df-dvds 16185 df-prm 16604 |
| This theorem is referenced by: prm2orodd 16623 pythagtriplem4 16752 odcau 19538 prmcyg 19828 prmgrpsimpgd 20050 rtprmirr 26731 2lgs 27379 aks6d1c2p2 42452 goldbachthlem2 47869 fmtnofac1 47893 oddprmALTV 48010 |
| Copyright terms: Public domain | W3C validator |