| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvdsgcdidd | Structured version Visualization version GIF version | ||
| Description: The greatest common divisor of a positive integer and another integer it divides is itself. (Contributed by Rohan Ridenour, 3-Aug-2023.) |
| Ref | Expression |
|---|---|
| dvdsgcdidd.1 | ⊢ (𝜑 → 𝑀 ∈ ℕ) |
| dvdsgcdidd.2 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| dvdsgcdidd.3 | ⊢ (𝜑 → 𝑀 ∥ 𝑁) |
| Ref | Expression |
|---|---|
| dvdsgcdidd | ⊢ (𝜑 → (𝑀 gcd 𝑁) = 𝑀) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dvdsgcdidd.2 | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 2 | 1 | zcnd 12804 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
| 3 | dvdsgcdidd.1 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
| 4 | 3 | nncnd 12351 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
| 5 | 3 | nnne0d 12388 | . . . 4 ⊢ (𝜑 → 𝑀 ≠ 0) |
| 6 | 2, 4, 5 | divcan1d 12094 | . . 3 ⊢ (𝜑 → ((𝑁 / 𝑀) · 𝑀) = 𝑁) |
| 7 | 6 | oveq2d 7436 | . 2 ⊢ (𝜑 → (𝑀 gcd ((𝑁 / 𝑀) · 𝑀)) = (𝑀 gcd 𝑁)) |
| 8 | 3 | nnnn0d 12667 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
| 9 | dvdsgcdidd.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∥ 𝑁) | |
| 10 | 3 | nnzd 12719 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| 11 | dvdsval2 16425 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) | |
| 12 | 10, 5, 1, 11 | syl3anc 1398 | . . . 4 ⊢ (𝜑 → (𝑀 ∥ 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) |
| 13 | 9, 12 | mpbid 235 | . . 3 ⊢ (𝜑 → (𝑁 / 𝑀) ∈ ℤ) |
| 14 | 8, 13 | gcdmultipled 16707 | . 2 ⊢ (𝜑 → (𝑀 gcd ((𝑁 / 𝑀) · 𝑀)) = 𝑀) |
| 15 | 7, 14 | eqtr3d 2797 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 𝑀) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 class class class wbr 5102 (class class class)co 7420 0cc0 11200 · cmul 11205 / cdiv 11973 ℕcn 12335 ℤcz 12693 ∥ cdvds 16422 gcd cgcd 16664 |
| 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 5326 ax-pr 5390 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| 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 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-seq 14145 df-exp 14205 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-dvds 16423 df-gcd 16665 |
| This theorem is used by: fincygsubgodd 20328 |
| Copyright terms: Public domain | W3C validator |