| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > gcdid | 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 9480 | . . 3 ⊢ 1 ∈ ℤ | |
| 2 | 0z 9465 | . . 3 ⊢ 0 ∈ ℤ | |
| 3 | gcdaddm 12513 | . . 3 ⊢ ((1 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 0 ∈ ℤ) → (𝑁 gcd 0) = (𝑁 gcd (0 + (1 · 𝑁)))) | |
| 4 | 1, 2, 3 | mp3an13 1362 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 0) = (𝑁 gcd (0 + (1 · 𝑁)))) |
| 5 | gcdid0 12509 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 0) = (abs‘𝑁)) | |
| 6 | zcn 9459 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 7 | mullid 8152 | . . . . . 6 ⊢ (𝑁 ∈ ℂ → (1 · 𝑁) = 𝑁) | |
| 8 | 7 | oveq2d 6023 | . . . . 5 ⊢ (𝑁 ∈ ℂ → (0 + (1 · 𝑁)) = (0 + 𝑁)) |
| 9 | addlid 8293 | . . . . 5 ⊢ (𝑁 ∈ ℂ → (0 + 𝑁) = 𝑁) | |
| 10 | 8, 9 | eqtrd 2262 | . . . 4 ⊢ (𝑁 ∈ ℂ → (0 + (1 · 𝑁)) = 𝑁) |
| 11 | 6, 10 | syl 14 | . . 3 ⊢ (𝑁 ∈ ℤ → (0 + (1 · 𝑁)) = 𝑁) |
| 12 | 11 | oveq2d 6023 | . 2 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd (0 + (1 · 𝑁))) = (𝑁 gcd 𝑁)) |
| 13 | 4, 5, 12 | 3eqtr3rd 2271 | 1 ⊢ (𝑁 ∈ ℤ → (𝑁 gcd 𝑁) = (abs‘𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 ∈ wcel 2200 ‘cfv 5318 (class class class)co 6007 ℂcc 8005 0cc0 8007 1c1 8008 + caddc 8010 · cmul 8012 ℤcz 9454 abscabs 11516 gcd cgcd 12482 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 ax-cnex 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-mulrcl 8106 ax-addcom 8107 ax-mulcom 8108 ax-addass 8109 ax-mulass 8110 ax-distr 8111 ax-i2m1 8112 ax-0lt1 8113 ax-1rid 8114 ax-0id 8115 ax-rnegex 8116 ax-precex 8117 ax-cnre 8118 ax-pre-ltirr 8119 ax-pre-ltwlin 8120 ax-pre-lttrn 8121 ax-pre-apti 8122 ax-pre-ltadd 8123 ax-pre-mulgt0 8124 ax-pre-mulext 8125 ax-arch 8126 ax-caucvg 8127 |
| This theorem depends on definitions: df-bi 117 df-stab 836 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-po 4387 df-iso 4388 df-iord 4457 df-on 4459 df-ilim 4460 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-riota 5960 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-frec 6543 df-sup 7159 df-pnf 8191 df-mnf 8192 df-xr 8193 df-ltxr 8194 df-le 8195 df-sub 8327 df-neg 8328 df-reap 8730 df-ap 8737 df-div 8828 df-inn 9119 df-2 9177 df-3 9178 df-4 9179 df-n0 9378 df-z 9455 df-uz 9731 df-q 9823 df-rp 9858 df-fz 10213 df-fzo 10347 df-fl 10498 df-mod 10553 df-seqfrec 10678 df-exp 10769 df-cj 11361 df-re 11362 df-im 11363 df-rsqrt 11517 df-abs 11518 df-dvds 12307 df-gcd 12483 |
| This theorem is referenced by: 6gcd4e2 12524 gcdmultiple 12549 lcmid 12610 lcmgcdeq 12613 3lcm2e6woprm 12616 phibndlem 12746 coprimeprodsq 12788 logbgcd1irr 15649 logbgcd1irraplemexp 15650 ex-gcd 16119 |
| Copyright terms: Public domain | W3C validator |