| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lcmfpr | Structured version Visualization version GIF version | ||
| Description: The value of the lcm function for an unordered pair is the value of the lcm operator for both elements. (Contributed by AV, 22-Aug-2020.) (Proof shortened by AV, 16-Sep-2020.) |
| Ref | Expression |
|---|---|
| lcmfpr | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = (𝑀 lcm 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | c0ex 11101 | . . . . . 6 ⊢ 0 ∈ V | |
| 2 | 1 | elpr 4596 | . . . . 5 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (0 = 𝑀 ∨ 0 = 𝑁)) |
| 3 | eqcom 2738 | . . . . . 6 ⊢ (0 = 𝑀 ↔ 𝑀 = 0) | |
| 4 | eqcom 2738 | . . . . . 6 ⊢ (0 = 𝑁 ↔ 𝑁 = 0) | |
| 5 | 3, 4 | orbi12i 914 | . . . . 5 ⊢ ((0 = 𝑀 ∨ 0 = 𝑁) ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
| 6 | 2, 5 | bitri 275 | . . . 4 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
| 7 | 6 | a1i 11 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0))) |
| 8 | breq1 5089 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛)) | |
| 9 | breq1 5089 | . . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑚 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛)) | |
| 10 | 8, 9 | ralprg 4644 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛 ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))) |
| 11 | 10 | rabbidv 3402 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) |
| 12 | 11 | infeq1d 9357 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) |
| 13 | 7, 12 | ifbieq2d 4497 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) |
| 14 | prssi 4768 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑀, 𝑁} ⊆ ℤ) | |
| 15 | prfi 9203 | . . 3 ⊢ {𝑀, 𝑁} ∈ Fin | |
| 16 | lcmfval 16527 | . . 3 ⊢ (({𝑀, 𝑁} ⊆ ℤ ∧ {𝑀, 𝑁} ∈ Fin) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) | |
| 17 | 14, 15, 16 | sylancl 586 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) |
| 18 | lcmval 16498 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
| 19 | 13, 17, 18 | 3eqtr4d 2776 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = (𝑀 lcm 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2111 ∀wral 3047 {crab 3395 ⊆ wss 3897 ifcif 4470 {cpr 4573 class class class wbr 5086 ‘cfv 6476 (class class class)co 7341 Fincfn 8864 infcinf 9320 ℝcr 11000 0cc0 11001 < clt 11141 ℕcn 12120 ℤcz 12463 ∥ cdvds 16158 lcm clcm 16494 lcmclcmf 16495 |
| 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-rep 5212 ax-sep 5229 ax-nul 5239 ax-pow 5298 ax-pr 5365 ax-un 7663 ax-inf2 9526 ax-cnex 11057 ax-resscn 11058 ax-1cn 11059 ax-icn 11060 ax-addcl 11061 ax-addrcl 11062 ax-mulcl 11063 ax-mulrcl 11064 ax-mulcom 11065 ax-addass 11066 ax-mulass 11067 ax-distr 11068 ax-i2m1 11069 ax-1ne0 11070 ax-1rid 11071 ax-rnegex 11072 ax-rrecex 11073 ax-cnre 11074 ax-pre-lttri 11075 ax-pre-lttrn 11076 ax-pre-ltadd 11077 ax-pre-mulgt0 11078 ax-pre-sup 11079 |
| 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-reu 3347 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-pss 3917 df-nul 4279 df-if 4471 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4855 df-int 4893 df-iun 4938 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5506 df-eprel 5511 df-po 5519 df-so 5520 df-fr 5564 df-se 5565 df-we 5566 df-xp 5617 df-rel 5618 df-cnv 5619 df-co 5620 df-dm 5621 df-rn 5622 df-res 5623 df-ima 5624 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-isom 6485 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-1o 8380 df-2o 8381 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-fin 8868 df-sup 9321 df-inf 9322 df-oi 9391 df-card 9827 df-pnf 11143 df-mnf 11144 df-xr 11145 df-ltxr 11146 df-le 11147 df-sub 11341 df-neg 11342 df-div 11770 df-nn 12121 df-2 12183 df-3 12184 df-n0 12377 df-z 12464 df-uz 12728 df-rp 12886 df-fz 13403 df-fzo 13550 df-seq 13904 df-exp 13964 df-hash 14233 df-cj 15001 df-re 15002 df-im 15003 df-sqrt 15137 df-abs 15138 df-clim 15390 df-prod 15806 df-dvds 16159 df-lcm 16496 df-lcmf 16497 |
| This theorem is referenced by: lcmfsn 16541 |
| Copyright terms: Public domain | W3C validator |