| 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 12472 | . . . 4 ⊢ 6 ∈ ℕ | |
| 2 | 1 | nnzi 12760 | . . 3 ⊢ 6 ∈ ℤ |
| 3 | 4z 12770 | . . 3 ⊢ 4 ∈ ℤ | |
| 4 | gcdcom 16729 | . . 3 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) = (4 gcd 6)) | |
| 5 | 2, 3, 4 | mp2an 705 | . 2 ⊢ (6 gcd 4) = (4 gcd 6) |
| 6 | 4cn 12468 | . . . 4 ⊢ 4 ∈ ℂ | |
| 7 | 2cn 12458 | . . . 4 ⊢ 2 ∈ ℂ | |
| 8 | 4p2e6 12535 | . . . 4 ⊢ (4 + 2) = 6 | |
| 9 | 6, 7, 8 | addcomli 11541 | . . 3 ⊢ (2 + 4) = 6 |
| 10 | 9 | oveq2i 7462 | . 2 ⊢ (4 gcd (2 + 4)) = (4 gcd 6) |
| 11 | 2z 12768 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 12 | gcdadd 16742 | . . . . 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 12517 | . . . . . 6 ⊢ (2 + 2) = 4 | |
| 15 | 14 | oveq2i 7462 | . . . . 5 ⊢ (2 gcd (2 + 2)) = (2 gcd 4) |
| 16 | gcdcom 16729 | . . . . . 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 2786 | . . . 4 ⊢ (2 gcd (2 + 2)) = (4 gcd 2) |
| 19 | 13, 18 | eqtri 2786 | . . 3 ⊢ (2 gcd 2) = (4 gcd 2) |
| 20 | gcdid 16743 | . . . . 5 ⊢ (2 ∈ ℤ → (2 gcd 2) = (abs‘2)) | |
| 21 | 11, 20 | ax-mp 5 | . . . 4 ⊢ (2 gcd 2) = (abs‘2) |
| 22 | 2re 12457 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 23 | 0le2 12485 | . . . . 5 ⊢ 0 ≤ 2 | |
| 24 | absid 15506 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 0 ≤ 2) → (abs‘2) = 2) | |
| 25 | 22, 23, 24 | mp2an 705 | . . . 4 ⊢ (abs‘2) = 2 |
| 26 | 21, 25 | eqtri 2786 | . . 3 ⊢ (2 gcd 2) = 2 |
| 27 | gcdadd 16742 | . . . 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 2795 | . 2 ⊢ (4 gcd (2 + 4)) = 2 |
| 30 | 5, 10, 29 | 3eqtr2i 2792 | 1 ⊢ (6 gcd 4) = 2 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 ℝcr 11238 0cc0 11239 + caddc 11242 ≤ cle 11383 2c2 12437 4c4 12439 6c6 12441 ℤcz 12733 abscabs 15444 gcd cgcd 16708 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-dvds 16467 df-gcd 16709 |
| This theorem is used by: 6lcm4e12 16835 |
| Copyright terms: Public domain | W3C validator |