| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gcdcomd | Structured version Visualization version GIF version | ||
| Description: The gcd operator is commutative, deduction version. (Contributed by SN, 24-Aug-2024.) |
| Ref | Expression |
|---|---|
| gcdcomd.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| gcdcomd.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| Ref | Expression |
|---|---|
| gcdcomd | ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | gcdcomd.m | . 2 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 2 | gcdcomd.n | . 2 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 3 | gcdcom 16471 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) | |
| 4 | 1, 2, 3 | syl2anc 585 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7356 ℤcz 12513 gcd cgcd 16452 |
| 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 2184 ax-ext 2707 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-mulcl 11089 ax-i2m1 11095 ax-pre-lttri 11101 ax-pre-lttrn 11102 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-rmo 3340 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-po 5528 df-so 5529 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-ov 7359 df-oprab 7360 df-mpo 7361 df-er 8632 df-en 8883 df-dom 8884 df-sdom 8885 df-sup 9344 df-pnf 11170 df-mnf 11171 df-ltxr 11173 df-gcd 16453 |
| This theorem is referenced by: modgcd 16490 rplpwr 16516 rprpwr 16517 coprmprod 16619 rpexp12i 16683 phiprmpw 16735 eulerthlem1 16740 eulerthlem2 16741 prmdiv 16744 coprimeprodsq 16768 pythagtriplem3 16778 prmpwdvds 16864 prmgaplem7 17017 gexexlem 19816 ablfacrp2 20033 pgpfac1lem2 20041 mpodvdsmulf1o 27145 dvdsmulf1o 27147 perfect1 27179 perfectlem1 27180 lgslem1 27248 lgsqrlem2 27298 lgsqr 27302 gausslemma2dlem0c 27309 lgsquad2lem2 27336 lgsquad2 27337 lgsquad3 27338 2sqlem8 27377 2sqmod 27387 nn0prpwlem 36492 aks4d1p8d2 42512 aks4d1p8d3 42513 hashscontpow1 42548 aks6d1c4 42551 aks5 42631 fltbccoprm 43062 flt4lem3 43069 flt4lem5c 43075 flt4lem5d 43076 flt4lem5e 43077 flt4lem5f 43078 flt4lem7 43080 nna4b4nsq 43081 jm2.19lem2 43406 jm2.20nn 43413 perfectALTVlem1 48185 |
| Copyright terms: Public domain | W3C validator |