| 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 16557 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) | |
| 4 | 1, 2, 3 | syl2anc 593 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1561 ∈ wcel 2143 (class class class)co 7396 ℤcz 12578 gcd cgcd 16538 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7718 ax-resscn 11141 ax-1cn 11142 ax-icn 11143 ax-addcl 11144 ax-mulcl 11146 ax-i2m1 11152 ax-pre-lttri 11158 ax-pre-lttrn 11159 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3368 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5102 df-opab 5164 df-mpt 5183 df-id 5543 df-po 5556 df-so 5557 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-er 8678 df-en 8928 df-dom 8929 df-sdom 8930 df-sup 9386 df-pnf 11229 df-mnf 11230 df-ltxr 11232 df-gcd 16539 |
| This theorem is referenced by: modgcd 16576 rplpwr 16602 rprpwr 16603 coprmprod 16705 rpexp12i 16769 phiprmpw 16821 eulerthlem1 16826 eulerthlem2 16827 prmdiv 16830 coprimeprodsq 16854 pythagtriplem3 16864 prmpwdvds 16950 prmgaplem7 17103 gexexlem 19902 ablfacrp2 20119 pgpfac1lem2 20127 mpodvdsmulf1o 27265 dvdsmulf1o 27267 perfect1 27299 perfectlem1 27300 lgslem1 27368 lgsqrlem2 27418 lgsqr 27422 gausslemma2dlem0c 27429 lgsquad2lem2 27456 lgsquad2 27457 lgsquad3 27458 2sqlem8 27497 2sqmod 27507 nn0prpwlem 36687 aks4d1p8d2 42707 aks4d1p8d3 42708 hashscontpow1 42743 aks6d1c4 42746 aks5 42826 fltbccoprm 43228 flt4lem3 43235 flt4lem5c 43241 flt4lem5d 43242 flt4lem5e 43243 flt4lem5f 43244 flt4lem7 43246 nna4b4nsq 43247 jm2.19lem2 43572 jm2.20nn 43579 perfectALTVlem1 48334 |
| Copyright terms: Public domain | W3C validator |