| 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 12354 | . . . 4 ⊢ 6 ∈ ℕ | |
| 2 | 1 | nnzi 12642 | . . 3 ⊢ 6 ∈ ℤ |
| 3 | 4z 12652 | . . 3 ⊢ 4 ∈ ℤ | |
| 4 | gcdcom 16603 | . . 3 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) = (4 gcd 6)) | |
| 5 | 2, 3, 4 | mp2an 705 | . 2 ⊢ (6 gcd 4) = (4 gcd 6) |
| 6 | 4cn 12350 | . . . 4 ⊢ 4 ∈ ℂ | |
| 7 | 2cn 12340 | . . . 4 ⊢ 2 ∈ ℂ | |
| 8 | 4p2e6 12417 | . . . 4 ⊢ (4 + 2) = 6 | |
| 9 | 6, 7, 8 | addcomli 11426 | . . 3 ⊢ (2 + 4) = 6 |
| 10 | 9 | oveq2i 7424 | . 2 ⊢ (4 gcd (2 + 4)) = (4 gcd 6) |
| 11 | 2z 12650 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 12 | gcdadd 16616 | . . . . 5 ⊢ ((2 ∈ ℤ ∧ 2 ∈ ℤ) → (2 gcd 2) = (2 gcd (2 + 2))) | |
| 13 | 11, 11, 12 | mp2an 705 | . . . 4 ⊢ (2 gcd 2) = (2 gcd (2 + 2)) |
| 14 | 2p2e4 12399 | . . . . . 6 ⊢ (2 + 2) = 4 | |
| 15 | 14 | oveq2i 7424 | . . . . 5 ⊢ (2 gcd (2 + 2)) = (2 gcd 4) |
| 16 | gcdcom 16603 | . . . . . 6 ⊢ ((2 ∈ ℤ ∧ 4 ∈ ℤ) → (2 gcd 4) = (4 gcd 2)) | |
| 17 | 11, 3, 16 | mp2an 705 | . . . . 5 ⊢ (2 gcd 4) = (4 gcd 2) |
| 18 | 15, 17 | eqtri 2783 | . . . 4 ⊢ (2 gcd (2 + 2)) = (4 gcd 2) |
| 19 | 13, 18 | eqtri 2783 | . . 3 ⊢ (2 gcd 2) = (4 gcd 2) |
| 20 | gcdid 16617 | . . . . 5 ⊢ (2 ∈ ℤ → (2 gcd 2) = (abs‘2)) | |
| 21 | 11, 20 | ax-mp 5 | . . . 4 ⊢ (2 gcd 2) = (abs‘2) |
| 22 | 2re 12339 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 23 | 0le2 12367 | . . . . 5 ⊢ 0 ≤ 2 | |
| 24 | absid 15383 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 0 ≤ 2) → (abs‘2) = 2) | |
| 25 | 22, 23, 24 | mp2an 705 | . . . 4 ⊢ (abs‘2) = 2 |
| 26 | 21, 25 | eqtri 2783 | . . 3 ⊢ (2 gcd 2) = 2 |
| 27 | gcdadd 16616 | . . . 4 ⊢ ((4 ∈ ℤ ∧ 2 ∈ ℤ) → (4 gcd 2) = (4 gcd (2 + 4))) | |
| 28 | 3, 11, 27 | mp2an 705 | . . 3 ⊢ (4 gcd 2) = (4 gcd (2 + 4)) |
| 29 | 19, 26, 28 | 3eqtr3ri 2792 | . 2 ⊢ (4 gcd (2 + 4)) = 2 |
| 30 | 5, 10, 29 | 3eqtr2i 2789 | 1 ⊢ (6 gcd 4) = 2 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6533 (class class class)co 7413 ℝcr 11123 0cc0 11124 + caddc 11127 ≤ cle 11268 2c2 12319 4c4 12321 6c6 12323 ℤcz 12615 abscabs 15321 gcd cgcd 16584 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-inf 9413 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-seq 14066 df-exp 14126 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-dvds 16343 df-gcd 16585 |
| This theorem is used by: 6lcm4e12 16706 |
| Copyright terms: Public domain | W3C validator |