| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lcmcom | Structured version Visualization version GIF version | ||
| Description: The lcm operator is commutative. (Contributed by Steve Rodriguez, 20-Jan-2020.) (Proof shortened by AV, 16-Sep-2020.) |
| Ref | Expression |
|---|---|
| lcmcom | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = (𝑁 lcm 𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orcom 870 | . . 3 ⊢ ((𝑀 = 0 ∨ 𝑁 = 0) ↔ (𝑁 = 0 ∨ 𝑀 = 0)) | |
| 2 | ancom 460 | . . . . 5 ⊢ ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)) | |
| 3 | 2 | rabbii 3400 | . . . 4 ⊢ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)} |
| 4 | 3 | infeq1i 9363 | . . 3 ⊢ inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ) |
| 5 | 1, 4 | ifbieq2i 4498 | . 2 ⊢ if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < )) |
| 6 | lcmval 16503 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
| 7 | lcmval 16503 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 lcm 𝑀) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ))) | |
| 8 | 7 | ancoms 458 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 lcm 𝑀) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ))) |
| 9 | 5, 6, 8 | 3eqtr4a 2792 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = (𝑁 lcm 𝑀)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2111 {crab 3395 ifcif 4472 class class class wbr 5089 (class class class)co 7346 infcinf 9325 ℝcr 11005 0cc0 11006 < clt 11146 ℕcn 12125 ℤcz 12468 ∥ cdvds 16163 lcm clcm 16499 |
| 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 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-mulcl 11068 ax-i2m1 11074 ax-pre-lttri 11080 ax-pre-lttrn 11081 |
| 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 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-br 5090 df-opab 5152 df-mpt 5171 df-id 5509 df-po 5522 df-so 5523 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-ov 7349 df-oprab 7350 df-mpo 7351 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-sup 9326 df-inf 9327 df-pnf 11148 df-mnf 11149 df-ltxr 11151 df-lcm 16501 |
| This theorem is referenced by: dvdslcm 16509 lcmeq0 16511 lcmcl 16512 lcmneg 16514 neglcm 16515 lcmgcd 16518 lcmdvds 16519 lcmftp 16547 lcmfunsnlem2 16551 lcmfunsnlem 16552 lcmf2a3a4e12 16558 lcm2un 42106 lcm3un 42107 |
| Copyright terms: Public domain | W3C validator |