| 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 16430 | . 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 2111 (class class class)co 7352 ℤcz 12474 gcd cgcd 16411 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-resscn 11069 ax-1cn 11070 ax-icn 11071 ax-addcl 11072 ax-mulcl 11074 ax-i2m1 11080 ax-pre-lttri 11086 ax-pre-lttrn 11087 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-br 5094 df-opab 5156 df-mpt 5175 df-id 5514 df-po 5527 df-so 5528 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 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 7355 df-oprab 7356 df-mpo 7357 df-er 8628 df-en 8876 df-dom 8877 df-sdom 8878 df-sup 9332 df-pnf 11154 df-mnf 11155 df-ltxr 11157 df-gcd 16412 |
| This theorem is referenced by: modgcd 16449 rplpwr 16475 rprpwr 16476 coprmprod 16578 rpexp12i 16641 phiprmpw 16693 eulerthlem1 16698 eulerthlem2 16699 prmdiv 16702 coprimeprodsq 16726 pythagtriplem3 16736 prmpwdvds 16822 prmgaplem7 16975 gexexlem 19770 ablfacrp2 19987 pgpfac1lem2 19995 mpodvdsmulf1o 27137 dvdsmulf1o 27139 perfect1 27172 perfectlem1 27173 lgslem1 27241 lgsqrlem2 27291 lgsqr 27295 gausslemma2dlem0c 27302 lgsquad2lem2 27329 lgsquad2 27330 lgsquad3 27331 2sqlem8 27370 2sqmod 27380 nn0prpwlem 36373 aks4d1p8d2 42184 aks4d1p8d3 42185 hashscontpow1 42220 aks6d1c4 42223 aks5 42303 fltbccoprm 42740 flt4lem3 42747 flt4lem5c 42753 flt4lem5d 42754 flt4lem5e 42755 flt4lem5f 42756 flt4lem7 42758 nna4b4nsq 42759 jm2.19lem2 43088 jm2.20nn 43095 perfectALTVlem1 47826 |
| Copyright terms: Public domain | W3C validator |