| 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 16483 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) | |
| 4 | 1, 2, 3 | syl2anc 584 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 (class class class)co 7387 ℤcz 12529 gcd cgcd 16464 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-mulcl 11130 ax-i2m1 11136 ax-pre-lttri 11142 ax-pre-lttrn 11143 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-po 5546 df-so 5547 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-sup 9393 df-pnf 11210 df-mnf 11211 df-ltxr 11213 df-gcd 16465 |
| This theorem is referenced by: modgcd 16502 rplpwr 16528 rprpwr 16529 coprmprod 16631 rpexp12i 16694 phiprmpw 16746 eulerthlem1 16751 eulerthlem2 16752 prmdiv 16755 coprimeprodsq 16779 pythagtriplem3 16789 prmpwdvds 16875 prmgaplem7 17028 gexexlem 19782 ablfacrp2 19999 pgpfac1lem2 20007 mpodvdsmulf1o 27104 dvdsmulf1o 27106 perfect1 27139 perfectlem1 27140 lgslem1 27208 lgsqrlem2 27258 lgsqr 27262 gausslemma2dlem0c 27269 lgsquad2lem2 27296 lgsquad2 27297 lgsquad3 27298 2sqlem8 27337 2sqmod 27347 nn0prpwlem 36310 aks4d1p8d2 42073 aks4d1p8d3 42074 hashscontpow1 42109 aks6d1c4 42112 aks5 42192 fltbccoprm 42629 flt4lem3 42636 flt4lem5c 42642 flt4lem5d 42643 flt4lem5e 42644 flt4lem5f 42645 flt4lem7 42647 nna4b4nsq 42648 jm2.19lem2 42979 jm2.20nn 42986 perfectALTVlem1 47722 |
| Copyright terms: Public domain | W3C validator |