| 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 11225 | . . . . . 6 ⊢ 0 ∈ V | |
| 2 | 1 | elpr 4609 | . . . . 5 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (0 = 𝑀 ∨ 0 = 𝑁)) |
| 3 | eqcom 2767 | . . . . . 6 ⊢ (0 = 𝑀 ↔ 𝑀 = 0) | |
| 4 | eqcom 2767 | . . . . . 6 ⊢ (0 = 𝑁 ↔ 𝑁 = 0) | |
| 5 | 3, 4 | orbi12i 928 | . . . . 5 ⊢ ((0 = 𝑀 ∨ 0 = 𝑁) ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
| 6 | 2, 5 | bitri 278 | . . . 4 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
| 7 | 6 | a1i 11 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0))) |
| 8 | breq1 5106 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛)) | |
| 9 | breq1 5106 | . . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑚 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛)) | |
| 10 | 8, 9 | ralprg 4657 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛 ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))) |
| 11 | 10 | rabbidv 3419 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) |
| 12 | 11 | infeq1d 9449 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) |
| 13 | 7, 12 | ifbieq2d 4509 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) |
| 14 | prssi 4782 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑀, 𝑁} ⊆ ℤ) | |
| 15 | prfi 9294 | . . 3 ⊢ {𝑀, 𝑁} ∈ Fin | |
| 16 | lcmfval 16712 | . . 3 ⊢ (({𝑀, 𝑁} ⊆ ℤ ∧ {𝑀, 𝑁} ∈ Fin) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) | |
| 17 | 14, 15, 16 | sylancl 598 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) |
| 18 | lcmval 16683 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
| 19 | 13, 17, 18 | 3eqtr4d 2805 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = (𝑀 lcm 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3076 {crab 3412 ⊆ wss 3899 ifcif 4482 {cpr 4586 class class class wbr 5103 ‘cfv 6533 (class class class)co 7414 Fincfn 8953 infcinf 9412 ℝcr 11124 0cc0 11125 < clt 11268 ℕcn 12258 ℤcz 12616 ∥ cdvds 16343 lcm clcm 16679 lcmclcmf 16680 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-inf2 9621 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 ax-pre-sup 11203 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-2o 8457 df-er 8697 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-sup 9413 df-inf 9414 df-oi 9483 df-card 9945 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-div 11897 df-nn 12259 df-2 12328 df-3 12329 df-n0 12530 df-z 12617 df-uz 12889 df-rp 13044 df-fz 13563 df-fzo 13711 df-seq 14067 df-exp 14127 df-hash 14396 df-cj 15187 df-re 15188 df-im 15189 df-sqrt 15323 df-abs 15324 df-clim 15576 df-prod 15994 df-dvds 16344 df-lcm 16681 df-lcmf 16682 |
| This theorem is used by: lcmfsn 16726 |
| Copyright terms: Public domain | W3C validator |