Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gcdmultiplezOLD | Structured version Visualization version GIF version |
Description: Obsolete proof of gcdmultiplez 15879 as of 12-Jan-2024. Extend gcdmultiple 15880 so 𝑁 can be an integer. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
gcdmultiplezOLD | ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 𝑁)) = 𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 7161 | . . . 4 ⊢ (𝑁 = 0 → (𝑀 · 𝑁) = (𝑀 · 0)) | |
2 | 1 | oveq2d 7169 | . . 3 ⊢ (𝑁 = 0 → (𝑀 gcd (𝑀 · 𝑁)) = (𝑀 gcd (𝑀 · 0))) |
3 | 2 | eqeq1d 2822 | . 2 ⊢ (𝑁 = 0 → ((𝑀 gcd (𝑀 · 𝑁)) = 𝑀 ↔ (𝑀 gcd (𝑀 · 0)) = 𝑀)) |
4 | nncn 11643 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℂ) | |
5 | zcn 11984 | . . . . . . 7 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
6 | absmul 14650 | . . . . . . 7 ⊢ ((𝑀 ∈ ℂ ∧ 𝑁 ∈ ℂ) → (abs‘(𝑀 · 𝑁)) = ((abs‘𝑀) · (abs‘𝑁))) | |
7 | 4, 5, 6 | syl2an 597 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (abs‘(𝑀 · 𝑁)) = ((abs‘𝑀) · (abs‘𝑁))) |
8 | nnre 11642 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℝ) | |
9 | nnnn0 11902 | . . . . . . . . . 10 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ0) | |
10 | 9 | nn0ge0d 11956 | . . . . . . . . 9 ⊢ (𝑀 ∈ ℕ → 0 ≤ 𝑀) |
11 | 8, 10 | absidd 14778 | . . . . . . . 8 ⊢ (𝑀 ∈ ℕ → (abs‘𝑀) = 𝑀) |
12 | 11 | oveq1d 7168 | . . . . . . 7 ⊢ (𝑀 ∈ ℕ → ((abs‘𝑀) · (abs‘𝑁)) = (𝑀 · (abs‘𝑁))) |
13 | 12 | adantr 483 | . . . . . 6 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → ((abs‘𝑀) · (abs‘𝑁)) = (𝑀 · (abs‘𝑁))) |
14 | 7, 13 | eqtrd 2855 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (abs‘(𝑀 · 𝑁)) = (𝑀 · (abs‘𝑁))) |
15 | 14 | oveq2d 7169 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (abs‘(𝑀 · 𝑁))) = (𝑀 gcd (𝑀 · (abs‘𝑁)))) |
16 | 15 | adantr 483 | . . 3 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → (𝑀 gcd (abs‘(𝑀 · 𝑁))) = (𝑀 gcd (𝑀 · (abs‘𝑁)))) |
17 | simpll 765 | . . . . 5 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → 𝑀 ∈ ℕ) | |
18 | 17 | nnzd 12084 | . . . 4 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → 𝑀 ∈ ℤ) |
19 | nnz 12002 | . . . . . 6 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℤ) | |
20 | zmulcl 12029 | . . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 · 𝑁) ∈ ℤ) | |
21 | 19, 20 | sylan 582 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 · 𝑁) ∈ ℤ) |
22 | 21 | adantr 483 | . . . 4 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → (𝑀 · 𝑁) ∈ ℤ) |
23 | gcdabs2 15875 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ (𝑀 · 𝑁) ∈ ℤ) → (𝑀 gcd (abs‘(𝑀 · 𝑁))) = (𝑀 gcd (𝑀 · 𝑁))) | |
24 | 18, 22, 23 | syl2anc 586 | . . 3 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → (𝑀 gcd (abs‘(𝑀 · 𝑁))) = (𝑀 gcd (𝑀 · 𝑁))) |
25 | nnabscl 14681 | . . . . 5 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 ≠ 0) → (abs‘𝑁) ∈ ℕ) | |
26 | gcdmultiple 15880 | . . . . 5 ⊢ ((𝑀 ∈ ℕ ∧ (abs‘𝑁) ∈ ℕ) → (𝑀 gcd (𝑀 · (abs‘𝑁))) = 𝑀) | |
27 | 25, 26 | sylan2 594 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ (𝑁 ∈ ℤ ∧ 𝑁 ≠ 0)) → (𝑀 gcd (𝑀 · (abs‘𝑁))) = 𝑀) |
28 | 27 | anassrs 470 | . . 3 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → (𝑀 gcd (𝑀 · (abs‘𝑁))) = 𝑀) |
29 | 16, 24, 28 | 3eqtr3d 2863 | . 2 ⊢ (((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) ∧ 𝑁 ≠ 0) → (𝑀 gcd (𝑀 · 𝑁)) = 𝑀) |
30 | mul01 10816 | . . . . . 6 ⊢ (𝑀 ∈ ℂ → (𝑀 · 0) = 0) | |
31 | 30 | oveq2d 7169 | . . . . 5 ⊢ (𝑀 ∈ ℂ → (𝑀 gcd (𝑀 · 0)) = (𝑀 gcd 0)) |
32 | 4, 31 | syl 17 | . . . 4 ⊢ (𝑀 ∈ ℕ → (𝑀 gcd (𝑀 · 0)) = (𝑀 gcd 0)) |
33 | 32 | adantr 483 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 0)) = (𝑀 gcd 0)) |
34 | nn0gcdid0 15865 | . . . . 5 ⊢ (𝑀 ∈ ℕ0 → (𝑀 gcd 0) = 𝑀) | |
35 | 9, 34 | syl 17 | . . . 4 ⊢ (𝑀 ∈ ℕ → (𝑀 gcd 0) = 𝑀) |
36 | 35 | adantr 483 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 0) = 𝑀) |
37 | 33, 36 | eqtrd 2855 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 0)) = 𝑀) |
38 | 3, 29, 37 | pm2.61ne 3101 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 𝑁)) = 𝑀) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ≠ wne 3015 ‘cfv 6352 (class class class)co 7153 ℂcc 10532 0cc0 10534 · cmul 10539 ℕcn 11635 ℕ0cn0 11895 ℤcz 11979 abscabs 14589 gcd cgcd 15839 |
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 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5200 ax-nul 5207 ax-pow 5263 ax-pr 5327 ax-un 7458 ax-cnex 10590 ax-resscn 10591 ax-1cn 10592 ax-icn 10593 ax-addcl 10594 ax-addrcl 10595 ax-mulcl 10596 ax-mulrcl 10597 ax-mulcom 10598 ax-addass 10599 ax-mulass 10600 ax-distr 10601 ax-i2m1 10602 ax-1ne0 10603 ax-1rid 10604 ax-rnegex 10605 ax-rrecex 10606 ax-cnre 10607 ax-pre-lttri 10608 ax-pre-lttrn 10609 ax-pre-ltadd 10610 ax-pre-mulgt0 10611 ax-pre-sup 10612 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rmo 3145 df-rab 3146 df-v 3495 df-sbc 3771 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4465 df-pw 4538 df-sn 4565 df-pr 4567 df-tp 4569 df-op 4571 df-uni 4836 df-iun 4918 df-br 5064 df-opab 5126 df-mpt 5144 df-tr 5170 df-id 5457 df-eprel 5462 df-po 5471 df-so 5472 df-fr 5511 df-we 5513 df-xp 5558 df-rel 5559 df-cnv 5560 df-co 5561 df-dm 5562 df-rn 5563 df-res 5564 df-ima 5565 df-pred 6145 df-ord 6191 df-on 6192 df-lim 6193 df-suc 6194 df-iota 6311 df-fun 6354 df-fn 6355 df-f 6356 df-f1 6357 df-fo 6358 df-f1o 6359 df-fv 6360 df-riota 7111 df-ov 7156 df-oprab 7157 df-mpo 7158 df-om 7578 df-2nd 7687 df-wrecs 7944 df-recs 8005 df-rdg 8043 df-er 8286 df-en 8507 df-dom 8508 df-sdom 8509 df-sup 8903 df-inf 8904 df-pnf 10674 df-mnf 10675 df-xr 10676 df-ltxr 10677 df-le 10678 df-sub 10869 df-neg 10870 df-div 11295 df-nn 11636 df-2 11698 df-3 11699 df-n0 11896 df-z 11980 df-uz 12242 df-rp 12388 df-seq 13368 df-exp 13428 df-cj 14454 df-re 14455 df-im 14456 df-sqrt 14590 df-abs 14591 df-dvds 15604 df-gcd 15840 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |