| 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 16416 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) | |
| 4 | 1, 2, 3 | syl2anc 584 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2110 (class class class)co 7341 ℤcz 12460 gcd cgcd 16397 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-mulcl 11060 ax-i2m1 11066 ax-pre-lttri 11072 ax-pre-lttrn 11073 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3344 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-po 5522 df-so 5523 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-ov 7344 df-oprab 7345 df-mpo 7346 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-sup 9321 df-pnf 11140 df-mnf 11141 df-ltxr 11143 df-gcd 16398 |
| This theorem is referenced by: modgcd 16435 rplpwr 16461 rprpwr 16462 coprmprod 16564 rpexp12i 16627 phiprmpw 16679 eulerthlem1 16684 eulerthlem2 16685 prmdiv 16688 coprimeprodsq 16712 pythagtriplem3 16722 prmpwdvds 16808 prmgaplem7 16961 gexexlem 19757 ablfacrp2 19974 pgpfac1lem2 19982 mpodvdsmulf1o 27124 dvdsmulf1o 27126 perfect1 27159 perfectlem1 27160 lgslem1 27228 lgsqrlem2 27278 lgsqr 27282 gausslemma2dlem0c 27289 lgsquad2lem2 27316 lgsquad2 27317 lgsquad3 27318 2sqlem8 27357 2sqmod 27367 nn0prpwlem 36335 aks4d1p8d2 42097 aks4d1p8d3 42098 hashscontpow1 42133 aks6d1c4 42136 aks5 42216 fltbccoprm 42653 flt4lem3 42660 flt4lem5c 42666 flt4lem5d 42667 flt4lem5e 42668 flt4lem5f 42669 flt4lem7 42671 nna4b4nsq 42672 jm2.19lem2 43002 jm2.20nn 43009 perfectALTVlem1 47731 |
| Copyright terms: Public domain | W3C validator |