| 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 4235 | . . 3 ⊢ (( ∥ “ {𝑀}) ∖ (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁}))) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) | |
| 2 | nzprmdif.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℙ) | |
| 3 | prmz 16645 | . . . . . 6 ⊢ (𝑀 ∈ ℙ → 𝑀 ∈ ℤ) | |
| 4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | nzprmdif.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℙ) | |
| 6 | prmz 16645 | . . . . . 6 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℤ) | |
| 7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 8 | 4, 7 | nzin 44307 | . . . 4 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁})) = ( ∥ “ {(𝑀 lcm 𝑁)})) |
| 9 | 8 | difeq2d 4089 | . . 3 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁}))) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)}))) |
| 10 | 1, 9 | eqtr3id 2778 | . 2 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)}))) |
| 11 | lcmgcd 16577 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (abs‘(𝑀 · 𝑁))) | |
| 12 | 4, 7, 11 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (abs‘(𝑀 · 𝑁))) |
| 13 | nzprmdif.ne | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ≠ 𝑁) | |
| 14 | prmrp 16682 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℙ ∧ 𝑁 ∈ ℙ) → ((𝑀 gcd 𝑁) = 1 ↔ 𝑀 ≠ 𝑁)) | |
| 15 | 2, 5, 14 | syl2anc 584 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑀 gcd 𝑁) = 1 ↔ 𝑀 ≠ 𝑁)) |
| 16 | 13, 15 | mpbird 257 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 1) |
| 17 | 16 | oveq2d 7403 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = ((𝑀 lcm 𝑁) · 1)) |
| 18 | lcmcl 16571 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) ∈ ℕ0) | |
| 19 | 4, 7, 18 | syl2anc 584 | . . . . . . . . 9 ⊢ (𝜑 → (𝑀 lcm 𝑁) ∈ ℕ0) |
| 20 | 19 | nn0cnd 12505 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 lcm 𝑁) ∈ ℂ) |
| 21 | 20 | mulridd 11191 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · 1) = (𝑀 lcm 𝑁)) |
| 22 | 17, 21 | eqtrd 2764 | . . . . . 6 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (𝑀 lcm 𝑁)) |
| 23 | 4 | zred 12638 | . . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 24 | 7 | zred 12638 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 25 | 23, 24 | remulcld 11204 | . . . . . . 7 ⊢ (𝜑 → (𝑀 · 𝑁) ∈ ℝ) |
| 26 | prmnn 16644 | . . . . . . . . . . 11 ⊢ (𝑀 ∈ ℙ → 𝑀 ∈ ℕ) | |
| 27 | 2, 26 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 28 | 27 | nnnn0d 12503 | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 29 | 28 | nn0ge0d 12506 | . . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 30 | prmnn 16644 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℕ) | |
| 31 | 5, 30 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| 32 | 31 | nnnn0d 12503 | . . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 33 | 32 | nn0ge0d 12506 | . . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝑁) |
| 34 | 23, 24, 29, 33 | mulge0d 11755 | . . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑀 · 𝑁)) |
| 35 | 25, 34 | absidd 15389 | . . . . . 6 ⊢ (𝜑 → (abs‘(𝑀 · 𝑁)) = (𝑀 · 𝑁)) |
| 36 | 12, 22, 35 | 3eqtr3d 2772 | . . . . 5 ⊢ (𝜑 → (𝑀 lcm 𝑁) = (𝑀 · 𝑁)) |
| 37 | 36 | sneqd 4601 | . . . 4 ⊢ (𝜑 → {(𝑀 lcm 𝑁)} = {(𝑀 · 𝑁)}) |
| 38 | 37 | imaeq2d 6031 | . . 3 ⊢ (𝜑 → ( ∥ “ {(𝑀 lcm 𝑁)}) = ( ∥ “ {(𝑀 · 𝑁)})) |
| 39 | 38 | difeq2d 4089 | . 2 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| 40 | 10, 39 | eqtrd 2764 | 1 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∖ cdif 3911 ∩ cin 3913 {csn 4589 “ cima 5641 ‘cfv 6511 (class class class)co 7387 1c1 11069 · cmul 11073 ℕcn 12186 ℕ0cn0 12442 ℤcz 12529 abscabs 15200 ∥ cdvds 16222 gcd cgcd 16464 lcm clcm 16558 ℙcprime 16641 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-sup 9393 df-inf 9394 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-fl 13754 df-mod 13832 df-seq 13967 df-exp 14027 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-dvds 16223 df-gcd 16465 df-lcm 16560 df-prm 16642 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |