![]() |
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 460 | . . . . 5 ⊢ ((𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛) ↔ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)) | |
3 | 2 | rabbii 3435 | . . . 4 ⊢ {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)} = {𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)} |
4 | 3 | infeq1i 9502 | . . 3 ⊢ inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ) |
5 | 1, 4 | ifbieq2i 4554 | . 2 ⊢ if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < )) |
6 | lcmval 16563 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
7 | lcmval 16563 | . . 3 ⊢ ((𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑁 lcm 𝑀) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ))) | |
8 | 7 | ancoms 458 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 lcm 𝑀) = if((𝑁 = 0 ∨ 𝑀 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑁 ∥ 𝑛 ∧ 𝑀 ∥ 𝑛)}, ℝ, < ))) |
9 | 5, 6, 8 | 3eqtr4a 2794 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = (𝑁 lcm 𝑀)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∨ wo 846 = wceq 1534 ∈ wcel 2099 {crab 3429 ifcif 4529 class class class wbr 5148 (class class class)co 7420 infcinf 9465 ℝcr 11138 0cc0 11139 < clt 11279 ℕcn 12243 ℤcz 12589 ∥ cdvds 16231 lcm clcm 16559 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-resscn 11196 ax-1cn 11197 ax-icn 11198 ax-addcl 11199 ax-mulcl 11201 ax-i2m1 11207 ax-pre-lttri 11213 ax-pre-lttrn 11214 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3373 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5576 df-po 5590 df-so 5591 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-ov 7423 df-oprab 7424 df-mpo 7425 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-sup 9466 df-inf 9467 df-pnf 11281 df-mnf 11282 df-ltxr 11284 df-lcm 16561 |
This theorem is referenced by: dvdslcm 16569 lcmeq0 16571 lcmcl 16572 lcmneg 16574 neglcm 16575 lcmgcd 16578 lcmdvds 16579 lcmftp 16607 lcmfunsnlem2 16611 lcmfunsnlem 16612 lcmf2a3a4e12 16618 lcm2un 41485 lcm3un 41486 |
Copyright terms: Public domain | W3C validator |