| 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 16519 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) | |
| 4 | 1, 2, 3 | syl2anc 592 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1550 ∈ wcel 2132 (class class class)co 7381 ℤcz 12554 gcd cgcd 16500 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-mulcl 11121 ax-i2m1 11127 ax-pre-lttri 11133 ax-pre-lttrn 11134 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-br 5091 df-opab 5153 df-mpt 5172 df-id 5531 df-po 5544 df-so 5545 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-ov 7384 df-oprab 7385 df-mpo 7386 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-sup 9374 df-pnf 11204 df-mnf 11205 df-ltxr 11207 df-gcd 16501 |
| This theorem is referenced by: modgcd 16538 rplpwr 16564 rprpwr 16565 coprmprod 16667 rpexp12i 16731 phiprmpw 16783 eulerthlem1 16788 eulerthlem2 16789 prmdiv 16792 coprimeprodsq 16816 pythagtriplem3 16826 prmpwdvds 16912 prmgaplem7 17065 gexexlem 19864 ablfacrp2 20081 pgpfac1lem2 20089 mpodvdsmulf1o 27224 dvdsmulf1o 27226 perfect1 27258 perfectlem1 27259 lgslem1 27327 lgsqrlem2 27377 lgsqr 27381 gausslemma2dlem0c 27388 lgsquad2lem2 27415 lgsquad2 27416 lgsquad3 27417 2sqlem8 27456 2sqmod 27466 nn0prpwlem 36620 aks4d1p8d2 42640 aks4d1p8d3 42641 hashscontpow1 42676 aks6d1c4 42679 aks5 42759 fltbccoprm 43161 flt4lem3 43168 flt4lem5c 43174 flt4lem5d 43175 flt4lem5e 43176 flt4lem5f 43177 flt4lem7 43179 nna4b4nsq 43180 jm2.19lem2 43505 jm2.20nn 43512 perfectALTVlem1 48281 |
| Copyright terms: Public domain | W3C validator |