| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gcdid | Structured version Visualization version GIF version | ||
| Description: The gcd of a number and itself is its absolute value. (Contributed by Paul Chapman, 31-Mar-2011.) |
| Ref | Expression |
|---|---|
| gcdid | ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 𝑁) = (abs‘𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 1z 12533 | . . 3 ⊢ 1 ∈ ℤ | |
| 2 | 0z 12511 | . . 3 ⊢ 0 ∈ ℤ | |
| 3 | gcdaddm 16464 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → (𝑁 gcd 0) = (𝑁 gcd (0 + (1 · 𝑁)))) | |
| 4 | 1, 2, 3 | mp3an13 1455 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 0) = (𝑁 gcd (0 + (1 · 𝑁)))) |
| 5 | gcdid0 16459 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 0) = (abs‘𝑁)) | |
| 6 | zcn 12505 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 7 | mullid 11143 | . . . . . 6 ⊢ (𝑁 ∈ ℂ → (1 · 𝑁) = 𝑁) | |
| 8 | 7 | oveq2d 7384 | . . . . 5 ⊢ (𝑁 ∈ ℂ → (0 + (1 · 𝑁)) = (0 + 𝑁)) |
| 9 | addlid 11328 | . . . . 5 ⊢ (𝑁 ∈ ℂ → (0 + 𝑁) = 𝑁) | |
| 10 | 8, 9 | eqtrd 2772 | . . . 4 ⊢ (𝑁 ∈ ℂ → (0 + (1 · 𝑁)) = 𝑁) |
| 11 | 6, 10 | syl 17 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 + (1 · 𝑁)) = 𝑁) |
| 12 | 11 | oveq2d 7384 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd (0 + (1 · 𝑁))) = (𝑁 gcd 𝑁)) |
| 13 | 4, 5, 12 | 3eqtr3rd 2781 | 1 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 𝑁) = (abs‘𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 ℂcc 11036 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 ℤcz 12500 abscabs 15169 gcd cgcd 16433 |
| 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 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-sup 9357 df-inf 9358 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-n0 12414 df-z 12501 df-uz 12764 df-rp 12918 df-seq 13937 df-exp 13997 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-dvds 16192 df-gcd 16434 |
| This theorem is referenced by: 6gcd4e2 16477 lcmid 16548 lcmgcdeq 16551 3lcm2e6woprm 16554 phibndlem 16709 coprimeprodsq 16748 logbgcd1irr 26772 ex-gcd 30544 gcdabsorb 35963 gcdnn0id 42688 |
| Copyright terms: Public domain | W3C validator |