| 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 16440 | . 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 2113 (class class class)co 7358 ℤcz 12488 gcd cgcd 16421 |
| 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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-mulcl 11088 ax-i2m1 11094 ax-pre-lttri 11100 ax-pre-lttrn 11101 |
| 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 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-po 5532 df-so 5533 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-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-sup 9345 df-pnf 11168 df-mnf 11169 df-ltxr 11171 df-gcd 16422 |
| This theorem is referenced by: modgcd 16459 rplpwr 16485 rprpwr 16486 coprmprod 16588 rpexp12i 16651 phiprmpw 16703 eulerthlem1 16708 eulerthlem2 16709 prmdiv 16712 coprimeprodsq 16736 pythagtriplem3 16746 prmpwdvds 16832 prmgaplem7 16985 gexexlem 19781 ablfacrp2 19998 pgpfac1lem2 20006 mpodvdsmulf1o 27160 dvdsmulf1o 27162 perfect1 27195 perfectlem1 27196 lgslem1 27264 lgsqrlem2 27314 lgsqr 27318 gausslemma2dlem0c 27325 lgsquad2lem2 27352 lgsquad2 27353 lgsquad3 27354 2sqlem8 27393 2sqmod 27403 nn0prpwlem 36516 aks4d1p8d2 42335 aks4d1p8d3 42336 hashscontpow1 42371 aks6d1c4 42374 aks5 42454 fltbccoprm 42880 flt4lem3 42887 flt4lem5c 42893 flt4lem5d 42894 flt4lem5e 42895 flt4lem5f 42896 flt4lem7 42898 nna4b4nsq 42899 jm2.19lem2 43228 jm2.20nn 43235 perfectALTVlem1 47963 |
| Copyright terms: Public domain | W3C validator |