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 12082 | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℂ) |
3 | dvdsgcdidd.1 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℕ) | |
4 | 3 | nncnd 11647 | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℂ) |
5 | 3 | nnne0d 11681 | . . . 4 ⊢ (𝜑 → 𝑀 ≠ 0) |
6 | 2, 4, 5 | divcan1d 11410 | . . 3 ⊢ (𝜑 → ((𝑁 / 𝑀) · 𝑀) = 𝑁) |
7 | 6 | oveq2d 7165 | . 2 ⊢ (𝜑 → (𝑀 gcd ((𝑁 / 𝑀) · 𝑀)) = (𝑀 gcd 𝑁)) |
8 | 3 | nnnn0d 11949 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℕ0) |
9 | dvdsgcdidd.3 | . . . 4 ⊢ (𝜑 → 𝑀 ∥ 𝑁) | |
10 | 3 | nnzd 12080 | . . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℤ) |
11 | dvdsval2 15603 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑀 ≠ 0 ∧ 𝑁 ∈ ℤ) → (𝑀 ∥ 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) | |
12 | 10, 5, 1, 11 | syl3anc 1366 | . . . 4 ⊢ (𝜑 → (𝑀 ∥ 𝑁 ↔ (𝑁 / 𝑀) ∈ ℤ)) |
13 | 9, 12 | mpbid 234 | . . 3 ⊢ (𝜑 → (𝑁 / 𝑀) ∈ ℤ) |
14 | 8, 13 | gcdmultipled 15875 | . 2 ⊢ (𝜑 → (𝑀 gcd ((𝑁 / 𝑀) · 𝑀)) = 𝑀) |
15 | 7, 14 | eqtr3d 2857 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = 𝑀) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1536 ∈ wcel 2113 ≠ wne 3015 class class class wbr 5059 (class class class)co 7149 0cc0 10530 · cmul 10535 / cdiv 11290 ℕcn 11631 ℤcz 11975 ∥ cdvds 15600 gcd cgcd 15836 |
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 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-cnex 10586 ax-resscn 10587 ax-1cn 10588 ax-icn 10589 ax-addcl 10590 ax-addrcl 10591 ax-mulcl 10592 ax-mulrcl 10593 ax-mulcom 10594 ax-addass 10595 ax-mulass 10596 ax-distr 10597 ax-i2m1 10598 ax-1ne0 10599 ax-1rid 10600 ax-rnegex 10601 ax-rrecex 10602 ax-cnre 10603 ax-pre-lttri 10604 ax-pre-lttrn 10605 ax-pre-ltadd 10606 ax-pre-mulgt0 10607 ax-pre-sup 10608 |
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 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-pss 3947 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7107 df-ov 7152 df-oprab 7153 df-mpo 7154 df-om 7574 df-2nd 7683 df-wrecs 7940 df-recs 8001 df-rdg 8039 df-er 8282 df-en 8503 df-dom 8504 df-sdom 8505 df-sup 8899 df-inf 8900 df-pnf 10670 df-mnf 10671 df-xr 10672 df-ltxr 10673 df-le 10674 df-sub 10865 df-neg 10866 df-div 11291 df-nn 11632 df-2 11694 df-3 11695 df-n0 11892 df-z 11976 df-uz 12238 df-rp 12384 df-seq 13367 df-exp 13427 df-cj 14451 df-re 14452 df-im 14453 df-sqrt 14587 df-abs 14588 df-dvds 15601 df-gcd 15837 |
This theorem is referenced by: fincygsubgodd 19227 |
Copyright terms: Public domain | W3C validator |