| 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 12261 | . . . 4 ⊢ 6 ∈ ℕ | |
| 2 | 1 | nnzi 12542 | . . 3 ⊢ 6 ∈ ℤ |
| 3 | 4z 12552 | . . 3 ⊢ 4 ∈ ℤ | |
| 4 | gcdcom 16473 | . . 3 ⊢ ((6 ∈ ℤ ∧ 4 ∈ ℤ) → (6 gcd 4) = (4 gcd 6)) | |
| 5 | 2, 3, 4 | mp2an 693 | . 2 ⊢ (6 gcd 4) = (4 gcd 6) |
| 6 | 4cn 12257 | . . . 4 ⊢ 4 ∈ ℂ | |
| 7 | 2cn 12247 | . . . 4 ⊢ 2 ∈ ℂ | |
| 8 | 4p2e6 12320 | . . . 4 ⊢ (4 + 2) = 6 | |
| 9 | 6, 7, 8 | addcomli 11329 | . . 3 ⊢ (2 + 4) = 6 |
| 10 | 9 | oveq2i 7371 | . 2 ⊢ (4 gcd (2 + 4)) = (4 gcd 6) |
| 11 | 2z 12550 | . . . . 5 ⊢ 2 ∈ ℤ | |
| 12 | gcdadd 16486 | . . . . 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 12302 | . . . . . 6 ⊢ (2 + 2) = 4 | |
| 15 | 14 | oveq2i 7371 | . . . . 5 ⊢ (2 gcd (2 + 2)) = (2 gcd 4) |
| 16 | gcdcom 16473 | . . . . . 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 2760 | . . . 4 ⊢ (2 gcd (2 + 2)) = (4 gcd 2) |
| 19 | 13, 18 | eqtri 2760 | . . 3 ⊢ (2 gcd 2) = (4 gcd 2) |
| 20 | gcdid 16487 | . . . . 5 ⊢ (2 ∈ ℤ → (2 gcd 2) = (abs‘2)) | |
| 21 | 11, 20 | ax-mp 5 | . . . 4 ⊢ (2 gcd 2) = (abs‘2) |
| 22 | 2re 12246 | . . . . 5 ⊢ 2 ∈ ℝ | |
| 23 | 0le2 12274 | . . . . 5 ⊢ 0 ≤ 2 | |
| 24 | absid 15249 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 0 ≤ 2) → (abs‘2) = 2) | |
| 25 | 22, 23, 24 | mp2an 693 | . . . 4 ⊢ (abs‘2) = 2 |
| 26 | 21, 25 | eqtri 2760 | . . 3 ⊢ (2 gcd 2) = 2 |
| 27 | gcdadd 16486 | . . . 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 2769 | . 2 ⊢ (4 gcd (2 + 4)) = 2 |
| 30 | 5, 10, 29 | 3eqtr2i 2766 | 1 ⊢ (6 gcd 4) = 2 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 class class class wbr 5086 ‘cfv 6492 (class class class)co 7360 ℝcr 11028 0cc0 11029 + caddc 11032 ≤ cle 11171 2c2 12227 4c4 12229 6c6 12231 ℤcz 12515 abscabs 15187 gcd cgcd 16454 |
| 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 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-er 8636 df-en 8887 df-dom 8888 df-sdom 8889 df-sup 9348 df-inf 9349 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-n0 12429 df-z 12516 df-uz 12780 df-rp 12934 df-seq 13955 df-exp 14015 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-dvds 16213 df-gcd 16455 |
| This theorem is referenced by: 6lcm4e12 16576 |
| Copyright terms: Public domain | W3C validator |