| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 6gcd4e2 | Structured version Visualization version GIF version | ||
| Description: The greatest common divisor of six and four is two. To calculate this gcd, a simple form of Euclid's algorithm is used: (6 gcd 4) = ((4 + 2) gcd 4) = (2 gcd 4) and (2 gcd 4) = (2 gcd (2 + 2)) = (2 gcd 2) = 2. (Contributed by AV, 27-Aug-2020.) |
| Ref | Expression |
|---|---|
| 6gcd4e2 | ⊢ (6 gcd 4) = 2 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 6nn 12270 | . . . 4 ⊢ 6 ∈ ℕ | |
| 2 | 1 | nnzi 12551 | . . 3 ⊢ 6 ∈ ℤ |
| 3 | 4z 12561 | . . 3 ⊢ 4 ∈ ℤ | |
| 4 | gcdcom 16482 | . . 3 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) = (4 gcd 6)) | |
| 5 | 2, 3, 4 | mp2an 693 | . 2 ⊢ (6 gcd 4) = (4 gcd 6) |
| 6 | 4cn 12266 | . . . 4 ⊢ 4 ∈ ℂ | |
| 7 | 2cn 12256 | . . . 4 ⊢ 2 ∈ ℂ | |
| 8 | 4p2e6 12329 | . . . 4 ⊢ (4 + 2) = 6 | |
| 9 | 6, 7, 8 | addcomli 11338 | . . 3 ⊢ (2 + 4) = 6 |
| 10 | 9 | oveq2i 7378 | . 2 ⊢ (4 gcd (2 + 4)) = (4 gcd 6) |
| 11 | 2z 12559 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 12 | gcdadd 16495 | . . . . 5 ⊢ ((2 ∈ ℤ ∧ 2 ∈ ℤ) → (2 gcd 2) = (2 gcd (2 + 2))) | |
| 13 | 11, 11, 12 | mp2an 693 | . . . 4 ⊢ (2 gcd 2) = (2 gcd (2 + 2)) |
| 14 | 2p2e4 12311 | . . . . . 6 ⊢ (2 + 2) = 4 | |
| 15 | 14 | oveq2i 7378 | . . . . 5 ⊢ (2 gcd (2 + 2)) = (2 gcd 4) |
| 16 | gcdcom 16482 | . . . . . 6 ⊢ ((2 ∈ ℤ ∧ 4 ∈ ℤ) → (2 gcd 4) = (4 gcd 2)) | |
| 17 | 11, 3, 16 | mp2an 693 | . . . . 5 ⊢ (2 gcd 4) = (4 gcd 2) |
| 18 | 15, 17 | eqtri 2759 | . . . 4 ⊢ (2 gcd (2 + 2)) = (4 gcd 2) |
| 19 | 13, 18 | eqtri 2759 | . . 3 ⊢ (2 gcd 2) = (4 gcd 2) |
| 20 | gcdid 16496 | . . . . 5 ⊢ (2 ∈ ℤ → (2 gcd 2) = (abs‘2)) | |
| 21 | 11, 20 | ax-mp 5 | . . . 4 ⊢ (2 gcd 2) = (abs‘2) |
| 22 | 2re 12255 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 23 | 0le2 12283 | . . . . 5 ⊢ 0 ≤ 2 | |
| 24 | absid 15258 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 0 ≤ 2) → (abs‘2) = 2) | |
| 25 | 22, 23, 24 | mp2an 693 | . . . 4 ⊢ (abs‘2) = 2 |
| 26 | 21, 25 | eqtri 2759 | . . 3 ⊢ (2 gcd 2) = 2 |
| 27 | gcdadd 16495 | . . . 4 ⊢ ((4 ∈ ℤ ∧ 2 ∈ ℤ) → (4 gcd 2) = (4 gcd (2 + 4))) | |
| 28 | 3, 11, 27 | mp2an 693 | . . 3 ⊢ (4 gcd 2) = (4 gcd (2 + 4)) |
| 29 | 19, 26, 28 | 3eqtr3ri 2768 | . 2 ⊢ (4 gcd (2 + 4)) = 2 |
| 30 | 5, 10, 29 | 3eqtr2i 2765 | 1 ⊢ (6 gcd 4) = 2 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 ℝcr 11037 0cc0 11038 + caddc 11041 ≤ cle 11180 2c2 12236 4c4 12238 6c6 12240 ℤcz 12524 abscabs 15196 gcd cgcd 16463 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-sup 9355 df-inf 9356 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-seq 13964 df-exp 14024 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-dvds 16222 df-gcd 16464 |
| This theorem is referenced by: 6lcm4e12 16585 |
| Copyright terms: Public domain | W3C validator |