![]() |
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 869 | . . 3 ⊢ ((𝑀 = 0 ∨ 𝑁 = 0) ↔ (𝑁 = 0 ∨ 𝑀 = 0)) | |
2 | ancom 462 | . . . . 5 ⊢ ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)) | |
3 | 2 | rabbii 3439 | . . . 4 ⊢ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)} |
4 | 3 | infeq1i 9473 | . . 3 ⊢ inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ) |
5 | 1, 4 | ifbieq2i 4554 | . 2 ⊢ if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < )) |
6 | lcmval 16529 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
7 | lcmval 16529 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 lcm 𝑀) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ))) | |
8 | 7 | ancoms 460 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 lcm 𝑀) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ))) |
9 | 5, 6, 8 | 3eqtr4a 2799 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = (𝑁 lcm 𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 {crab 3433 ifcif 4529 class class class wbr 5149 (class class class)co 7409 infcinf 9436 ℝcr 11109 0cc0 11110 < clt 11248 ℕcn 12212 ℤcz 12558 ∥ cdvds 16197 lcm clcm 16525 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-mulcl 11172 ax-i2m1 11178 ax-pre-lttri 11184 ax-pre-lttrn 11185 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9437 df-inf 9438 df-pnf 11250 df-mnf 11251 df-ltxr 11253 df-lcm 16527 |
This theorem is referenced by: dvdslcm 16535 lcmeq0 16537 lcmcl 16538 lcmneg 16540 neglcm 16541 lcmgcd 16544 lcmdvds 16545 lcmftp 16573 lcmfunsnlem2 16577 lcmfunsnlem 16578 lcmf2a3a4e12 16584 lcm2un 40879 lcm3un 40880 |
Copyright terms: Public domain | W3C validator |