| 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 16444 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) | |
| 4 | 1, 2, 3 | syl2anc 585 | 1 ⊢ (𝜑 → (𝑀 gcd 𝑁) = (𝑁 gcd 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 (class class class)co 7360 ℤcz 12492 gcd cgcd 16425 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-mulcl 11092 ax-i2m1 11098 ax-pre-lttri 11104 ax-pre-lttrn 11105 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rmo 3351 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-ov 7363 df-oprab 7364 df-mpo 7365 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-sup 9349 df-pnf 11172 df-mnf 11173 df-ltxr 11175 df-gcd 16426 |
| This theorem is referenced by: modgcd 16463 rplpwr 16489 rprpwr 16490 coprmprod 16592 rpexp12i 16655 phiprmpw 16707 eulerthlem1 16712 eulerthlem2 16713 prmdiv 16716 coprimeprodsq 16740 pythagtriplem3 16750 prmpwdvds 16836 prmgaplem7 16989 gexexlem 19785 ablfacrp2 20002 pgpfac1lem2 20010 mpodvdsmulf1o 27164 dvdsmulf1o 27166 perfect1 27199 perfectlem1 27200 lgslem1 27268 lgsqrlem2 27318 lgsqr 27322 gausslemma2dlem0c 27329 lgsquad2lem2 27356 lgsquad2 27357 lgsquad3 27358 2sqlem8 27397 2sqmod 27407 nn0prpwlem 36497 aks4d1p8d2 42376 aks4d1p8d3 42377 hashscontpow1 42412 aks6d1c4 42415 aks5 42495 fltbccoprm 42920 flt4lem3 42927 flt4lem5c 42933 flt4lem5d 42934 flt4lem5e 42935 flt4lem5f 42936 flt4lem7 42938 nna4b4nsq 42939 jm2.19lem2 43268 jm2.20nn 43275 perfectALTVlem1 48003 |
| Copyright terms: Public domain | W3C validator |