| 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 4212 | . . 3 ⊢ (( ∥ “ {𝑀}) ∖ (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁}))) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) | |
| 2 | nzprmdif.m | . . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℙ) | |
| 3 | prmz 16644 | . . . . . 6 ⊢ (𝑀 ∈ ℙ → 𝑀 ∈ ℤ) | |
| 4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 5 | nzprmdif.n | . . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℙ) | |
| 6 | prmz 16644 | . . . . . 6 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℤ) | |
| 7 | 5, 6 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| 8 | 4, 7 | nzin 44745 | . . . 4 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁})) = ( ∥ “ {(𝑀 lcm 𝑁)})) |
| 9 | 8 | difeq2d 4066 | . . 3 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ (( ∥ “ {𝑀}) ∩ ( ∥ “ {𝑁}))) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)}))) |
| 10 | 1, 9 | eqtr3id 2785 | . 2 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)}))) |
| 11 | lcmgcd 16576 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (abs‘(𝑀 · 𝑁))) | |
| 12 | 4, 7, 11 | syl2anc 585 | . . . . . 6 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (abs‘(𝑀 · 𝑁))) |
| 13 | nzprmdif.ne | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ≠ 𝑁) | |
| 14 | prmrp 16682 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℙ ∧ 𝑁 ∈ ℙ) → ((𝑀 gcd 𝑁) = 1 ↔ 𝑀 ≠ 𝑁)) | |
| 15 | 2, 5, 14 | syl2anc 585 | . . . . . . . . 9 ⊢ (𝜑 → ((𝑀 gcd 𝑁) = 1 ↔ 𝑀 ≠ 𝑁)) |
| 16 | 13, 15 | mpbird 257 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 1) |
| 17 | 16 | oveq2d 7383 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = ((𝑀 lcm 𝑁) · 1)) |
| 18 | lcmcl 16570 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) ∈ ℕ0) | |
| 19 | 4, 7, 18 | syl2anc 585 | . . . . . . . . 9 ⊢ (𝜑 → (𝑀 lcm 𝑁) ∈ ℕ0) |
| 20 | 19 | nn0cnd 12500 | . . . . . . . 8 ⊢ (𝜑 → (𝑀 lcm 𝑁) ∈ ℂ) |
| 21 | 20 | mulridd 11162 | . . . . . . 7 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · 1) = (𝑀 lcm 𝑁)) |
| 22 | 17, 21 | eqtrd 2771 | . . . . . 6 ⊢ (𝜑 → ((𝑀 lcm 𝑁) · (𝑀 gcd 𝑁)) = (𝑀 lcm 𝑁)) |
| 23 | 4 | zred 12633 | . . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 24 | 7 | zred 12633 | . . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 25 | 23, 24 | remulcld 11175 | . . . . . . 7 ⊢ (𝜑 → (𝑀 · 𝑁) ∈ ℝ) |
| 26 | prmnn 16643 | . . . . . . . . . . 11 ⊢ (𝑀 ∈ ℙ → 𝑀 ∈ ℕ) | |
| 27 | 2, 26 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| 28 | 27 | nnnn0d 12498 | . . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 29 | 28 | nn0ge0d 12501 | . . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝑀) |
| 30 | prmnn 16643 | . . . . . . . . . . 11 ⊢ (𝑁 ∈ ℙ → 𝑁 ∈ ℕ) | |
| 31 | 5, 30 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℕ) |
| 32 | 31 | nnnn0d 12498 | . . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ0) |
| 33 | 32 | nn0ge0d 12501 | . . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝑁) |
| 34 | 23, 24, 29, 33 | mulge0d 11727 | . . . . . . 7 ⊢ (𝜑 → 0 ≤ (𝑀 · 𝑁)) |
| 35 | 25, 34 | absidd 15385 | . . . . . 6 ⊢ (𝜑 → (abs‘(𝑀 · 𝑁)) = (𝑀 · 𝑁)) |
| 36 | 12, 22, 35 | 3eqtr3d 2779 | . . . . 5 ⊢ (𝜑 → (𝑀 lcm 𝑁) = (𝑀 · 𝑁)) |
| 37 | 36 | sneqd 4579 | . . . 4 ⊢ (𝜑 → {(𝑀 lcm 𝑁)} = {(𝑀 · 𝑁)}) |
| 38 | 37 | imaeq2d 6025 | . . 3 ⊢ (𝜑 → ( ∥ “ {(𝑀 lcm 𝑁)}) = ( ∥ “ {(𝑀 · 𝑁)})) |
| 39 | 38 | difeq2d 4066 | . 2 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 lcm 𝑁)})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| 40 | 10, 39 | eqtrd 2771 | 1 ⊢ (𝜑 → (( ∥ “ {𝑀}) ∖ ( ∥ “ {𝑁})) = (( ∥ “ {𝑀}) ∖ ( ∥ “ {(𝑀 · 𝑁)}))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ∖ cdif 3886 ∩ cin 3888 {csn 4567 “ cima 5634 ‘cfv 6498 (class class class)co 7367 1c1 11039 · cmul 11043 ℕcn 12174 ℕ0cn0 12437 ℤcz 12524 abscabs 15196 ∥ cdvds 16221 gcd cgcd 16463 lcm clcm 16557 ℙcprime 16640 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-fl 13751 df-mod 13829 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-dvds 16222 df-gcd 16464 df-lcm 16559 df-prm 16641 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |