| Mathbox for Steve Rodriguez |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > nzprmdif | Structured version Visualization version GIF version | ||
| Description: Subtract one prime's multiples from an unequal prime's. (Contributed by Steve Rodriguez, 20-Jan-2020.) |
| Ref | Expression |
|---|---|
| nzprmdif.m | ⊢ (𝜑 → 𝑀 ∈ ℙ) |
| nzprmdif.n | ⊢ (𝜑 → 𝑁 ∈ ℙ) |
| nzprmdif.ne | ⊢ (𝜑 → 𝑀 ≠ 𝑁) |
| Ref | Expression |
|---|---|
| nzprmdif | ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | difin 4216 | . . 3 ⊢ (( ∥ “ {𝑀}) ∖ (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁}))) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) | |
| 2 | nzprmdif.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℙ) | |
| 3 | prmz 16859 | . . . . . 6 ⊢ (𝑀 ∈ ℙ → 𝑀 ∈ ℤ) | |
| 4 | 2, 3 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | nzprmdif.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℙ) | |
| 6 | prmz 16859 | . . . . . 6 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℤ) | |
| 7 | 5, 6 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 8 | 4, 7 | nzin 45439 | . . . 4 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁})) = ( ∥ “ {(𝑀 lcm 𝑁)})) |
| 9 | 8 | difeq2d 4062 | . . 3 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁}))) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)}))) |
| 10 | 1, 9 | eqtr3id 2809 | . 2 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)}))) |
| 11 | lcmgcd 16791 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (abs‘(𝑀 · 𝑁))) | |
| 12 | 4, 7, 11 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (abs‘(𝑀 · 𝑁))) |
| 13 | nzprmdif.ne | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ≠ 𝑁) | |
| 14 | prmrp 16897 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℙ ∧ 𝑁 ∈ ℙ) → ((𝑀 gcd 𝑁) = 1 ↔ 𝑀 ≠ 𝑁)) | |
| 15 | 2, 5, 14 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑀 gcd 𝑁) = 1 ↔ 𝑀 ≠ 𝑁)) |
| 16 | 13, 15 | mpbird 260 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 1) |
| 17 | 16 | oveq2d 7440 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = ((𝑀 lcm 𝑁) · 1)) |
| 18 | lcmcl 16785 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) ∈ ℕ0) | |
| 19 | 4, 7, 18 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → (𝑀 lcm 𝑁) ∈ ℕ0) |
| 20 | 19 | nn0cnd 12676 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 lcm 𝑁) ∈ ℂ) |
| 21 | 20 | mulridd 11333 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · 1) = (𝑀 lcm 𝑁)) |
| 22 | 17, 21 | eqtrd 2795 | . . . . . 6 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (𝑀 lcm 𝑁)) |
| 23 | 4 | zred 12810 | . . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 24 | 7 | zred 12810 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 25 | 23, 24 | remulcld 11346 | . . . . . . 7 ⊢ (𝜑 → (𝑀 · 𝑁) ∈ ℝ) |
| 26 | prmnn 16858 | . . . . . . . . . . 11 ⊢ (𝑀 ∈ ℙ → 𝑀 ∈ ℕ) | |
| 27 | 2, 26 | syl 18 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 28 | 27 | nnnn0d 12674 | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 29 | 28 | nn0ge0d 12677 | . . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 30 | prmnn 16858 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℕ) | |
| 31 | 5, 30 | syl 18 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| 32 | 31 | nnnn0d 12674 | . . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 33 | 32 | nn0ge0d 12677 | . . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝑁) |
| 34 | 23, 24, 29, 33 | mulge0d 11900 | . . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑀 · 𝑁)) |
| 35 | 25, 34 | absidd 15599 | . . . . . 6 ⊢ (𝜑 → (abs‘(𝑀 · 𝑁)) = (𝑀 · 𝑁)) |
| 36 | 12, 22, 35 | 3eqtr3d 2803 | . . . . 5 ⊢ (𝜑 → (𝑀 lcm 𝑁) = (𝑀 · 𝑁)) |
| 37 | 36 | sneqd 4592 | . . . 4 ⊢ (𝜑 → {(𝑀 lcm 𝑁)} = {(𝑀 · 𝑁)}) |
| 38 | 37 | imaeq2d 6054 | . . 3 ⊢ (𝜑 → ( ∥ “ {(𝑀 lcm 𝑁)}) = ( ∥ “ {(𝑀 · 𝑁)})) |
| 39 | 38 | difeq2d 4062 | . 2 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| 40 | 10, 39 | eqtrd 2795 | 1 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∖ cdif 4044 ∩ cin 4088 {csn 4584 “ cima 5654 ‘cfv 6543 (class class class)co 7424 1c1 11208 · cmul 11212 ℕcn 12342 ℕ0cn0 12613 ℤcz 12700 abscabs 15410 ∥ cdvds 16431 gcd cgcd 16673 lcm clcm 16772 ℙcprime 16855 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 ax-pre-sup 11285 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-2o 8485 df-er 8725 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-div 11981 df-nn 12343 df-2 12412 df-3 12413 df-n0 12614 df-z 12701 df-uz 12973 df-rp 13128 df-fl 13939 df-mod 14017 df-seq 14152 df-exp 14212 df-cj 15275 df-re 15276 df-im 15277 df-sqrt 15411 df-abs 15412 df-dvds 16432 df-gcd 16674 df-lcm 16774 df-prm 16856 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |