| 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 12425 | . . . 4 ⊢ 6 ∈ ℕ | |
| 2 | 1 | nnzi 12713 | . . 3 ⊢ 6 ∈ ℤ |
| 3 | 4z 12723 | . . 3 ⊢ 4 ∈ ℤ | |
| 4 | gcdcom 16678 | . . 3 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) = (4 gcd 6)) | |
| 5 | 2, 3, 4 | mp2an 705 | . 2 ⊢ (6 gcd 4) = (4 gcd 6) |
| 6 | 4cn 12421 | . . . 4 ⊢ 4 ∈ ℂ | |
| 7 | 2cn 12411 | . . . 4 ⊢ 2 ∈ ℂ | |
| 8 | 4p2e6 12488 | . . . 4 ⊢ (4 + 2) = 6 | |
| 9 | 6, 7, 8 | addcomli 11495 | . . 3 ⊢ (2 + 4) = 6 |
| 10 | 9 | oveq2i 7429 | . 2 ⊢ (4 gcd (2 + 4)) = (4 gcd 6) |
| 11 | 2z 12721 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 12 | gcdadd 16691 | . . . . 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 12470 | . . . . . 6 ⊢ (2 + 2) = 4 | |
| 15 | 14 | oveq2i 7429 | . . . . 5 ⊢ (2 gcd (2 + 2)) = (2 gcd 4) |
| 16 | gcdcom 16678 | . . . . . 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 2784 | . . . 4 ⊢ (2 gcd (2 + 2)) = (4 gcd 2) |
| 19 | 13, 18 | eqtri 2784 | . . 3 ⊢ (2 gcd 2) = (4 gcd 2) |
| 20 | gcdid 16692 | . . . . 5 ⊢ (2 ∈ ℤ → (2 gcd 2) = (abs‘2)) | |
| 21 | 11, 20 | ax-mp 5 | . . . 4 ⊢ (2 gcd 2) = (abs‘2) |
| 22 | 2re 12410 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 23 | 0le2 12438 | . . . . 5 ⊢ 0 ≤ 2 | |
| 24 | absid 15456 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 0 ≤ 2) → (abs‘2) = 2) | |
| 25 | 22, 23, 24 | mp2an 705 | . . . 4 ⊢ (abs‘2) = 2 |
| 26 | 21, 25 | eqtri 2784 | . . 3 ⊢ (2 gcd 2) = 2 |
| 27 | gcdadd 16691 | . . . 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 2793 | . 2 ⊢ (4 gcd (2 + 4)) = 2 |
| 30 | 5, 10, 29 | 3eqtr2i 2790 | 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 6537 (class class class)co 7418 ℝcr 11192 0cc0 11193 + caddc 11196 ≤ cle 11337 2c2 12390 4c4 12392 6c6 12394 ℤcz 12686 abscabs 15394 gcd cgcd 16657 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7749 ax-cnex 11249 ax-resscn 11250 ax-1cn 11251 ax-icn 11252 ax-addcl 11253 ax-addrcl 11254 ax-mulcl 11255 ax-mulrcl 11256 ax-mulcom 11257 ax-addass 11258 ax-mulass 11259 ax-distr 11260 ax-i2m1 11261 ax-1ne0 11262 ax-1rid 11263 ax-rnegex 11264 ax-rrecex 11265 ax-cnre 11266 ax-pre-lttri 11267 ax-pre-lttrn 11268 ax-pre-ltadd 11269 ax-pre-mulgt0 11270 ax-pre-sup 11271 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7375 df-ov 7421 df-oprab 7422 df-mpo 7423 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 df-er 8710 df-en 8967 df-dom 8968 df-sdom 8969 df-sup 9427 df-inf 9428 df-pnf 11338 df-mnf 11339 df-xr 11340 df-ltxr 11341 df-le 11342 df-sub 11536 df-neg 11537 df-div 11967 df-nn 12329 df-2 12398 df-3 12399 df-4 12400 df-5 12401 df-6 12402 df-n0 12600 df-z 12687 df-uz 12959 df-rp 13114 df-seq 14138 df-exp 14198 df-cj 15259 df-re 15260 df-im 15261 df-sqrt 15395 df-abs 15396 df-dvds 16416 df-gcd 16658 |
| This theorem is used by: 6lcm4e12 16784 |
| Copyright terms: Public domain | W3C validator |