![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > gcdmultiplez | Structured version Visualization version GIF version |
Description: The GCD of a multiple of an integer is the integer itself. (Contributed by Scott Fenton, 18-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) (Proof shortened by AV, 12-Jan-2023.) |
Ref | Expression |
---|---|
gcdmultiplez | ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 𝑁)) = 𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nncn 12207 | . . . . 5 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℂ) | |
2 | 1 | adantr 482 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℂ) |
3 | zcn 12550 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
4 | 3 | adantl 483 | . . . 4 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℂ) |
5 | 2, 4 | mulcomd 11222 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 · 𝑁) = (𝑁 · 𝑀)) |
6 | 5 | oveq2d 7412 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 𝑁)) = (𝑀 gcd (𝑁 · 𝑀))) |
7 | nnnn0 12466 | . . . 4 ⊢ (𝑀 ∈ ℕ → 𝑀 ∈ ℕ0) | |
8 | 7 | adantr 482 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℕ0) |
9 | simpr 486 | . . 3 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℤ) | |
10 | 8, 9 | gcdmultipled 16463 | . 2 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑁 · 𝑀)) = 𝑀) |
11 | 6, 10 | eqtrd 2773 | 1 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd (𝑀 · 𝑁)) = 𝑀) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 (class class class)co 7396 ℂcc 11095 · cmul 11102 ℕcn 12199 ℕ0cn0 12459 ℤcz 12545 gcd cgcd 16422 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5295 ax-nul 5302 ax-pow 5359 ax-pr 5423 ax-un 7712 ax-cnex 11153 ax-resscn 11154 ax-1cn 11155 ax-icn 11156 ax-addcl 11157 ax-addrcl 11158 ax-mulcl 11159 ax-mulrcl 11160 ax-mulcom 11161 ax-addass 11162 ax-mulass 11163 ax-distr 11164 ax-i2m1 11165 ax-1ne0 11166 ax-1rid 11167 ax-rnegex 11168 ax-rrecex 11169 ax-cnre 11170 ax-pre-lttri 11171 ax-pre-lttrn 11172 ax-pre-ltadd 11173 ax-pre-mulgt0 11174 ax-pre-sup 11175 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-pss 3965 df-nul 4321 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4905 df-iun 4995 df-br 5145 df-opab 5207 df-mpt 5228 df-tr 5262 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6292 df-ord 6359 df-on 6360 df-lim 6361 df-suc 6362 df-iota 6487 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7352 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7843 df-2nd 7963 df-frecs 8253 df-wrecs 8284 df-recs 8358 df-rdg 8397 df-er 8691 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9424 df-inf 9425 df-pnf 11237 df-mnf 11238 df-xr 11239 df-ltxr 11240 df-le 11241 df-sub 11433 df-neg 11434 df-div 11859 df-nn 12200 df-2 12262 df-3 12263 df-n0 12460 df-z 12546 df-uz 12810 df-rp 12962 df-seq 13954 df-exp 14015 df-cj 15033 df-re 15034 df-im 15035 df-sqrt 15169 df-abs 15170 df-dvds 16185 df-gcd 16423 |
This theorem is referenced by: gcdmultiple 16465 |
Copyright terms: Public domain | W3C validator |