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 11019 | . . . . . 6 ⊢ 0 ∈ V | |
2 | 1 | elpr 4588 | . . . . 5 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (0 = 𝑀 ∨ 0 = 𝑁)) |
3 | eqcom 2743 | . . . . . 6 ⊢ (0 = 𝑀 ↔ 𝑀 = 0) | |
4 | eqcom 2743 | . . . . . 6 ⊢ (0 = 𝑁 ↔ 𝑁 = 0) | |
5 | 3, 4 | orbi12i 913 | . . . . 5 ⊢ ((0 = 𝑀 ∨ 0 = 𝑁) ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
6 | 2, 5 | bitri 275 | . . . 4 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
7 | 6 | a1i 11 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0))) |
8 | breq1 5084 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛)) | |
9 | breq1 5084 | . . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑚 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛)) | |
10 | 8, 9 | ralprg 4634 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛 ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))) |
11 | 10 | rabbidv 3421 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) |
12 | 11 | infeq1d 9284 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) |
13 | 7, 12 | ifbieq2d 4491 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) |
14 | prssi 4760 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑀, 𝑁} ⊆ ℤ) | |
15 | prfi 9137 | . . 3 ⊢ {𝑀, 𝑁} ∈ Fin | |
16 | lcmfval 16375 | . . 3 ⊢ (({𝑀, 𝑁} ⊆ ℤ ∧ {𝑀, 𝑁} ∈ Fin) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) | |
17 | 14, 15, 16 | sylancl 587 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) |
18 | lcmval 16346 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
19 | 13, 17, 18 | 3eqtr4d 2786 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = (𝑀 lcm 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 845 = wceq 1539 ∈ wcel 2104 ∀wral 3062 {crab 3303 ⊆ wss 3892 ifcif 4465 {cpr 4567 class class class wbr 5081 ‘cfv 6458 (class class class)co 7307 Fincfn 8764 infcinf 9248 ℝcr 10920 0cc0 10921 < clt 11059 ℕcn 12023 ℤcz 12369 ∥ cdvds 16012 lcm clcm 16342 lcmclcmf 16343 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-rep 5218 ax-sep 5232 ax-nul 5239 ax-pow 5297 ax-pr 5361 ax-un 7620 ax-inf2 9447 ax-cnex 10977 ax-resscn 10978 ax-1cn 10979 ax-icn 10980 ax-addcl 10981 ax-addrcl 10982 ax-mulcl 10983 ax-mulrcl 10984 ax-mulcom 10985 ax-addass 10986 ax-mulass 10987 ax-distr 10988 ax-i2m1 10989 ax-1ne0 10990 ax-1rid 10991 ax-rnegex 10992 ax-rrecex 10993 ax-cnre 10994 ax-pre-lttri 10995 ax-pre-lttrn 10996 ax-pre-ltadd 10997 ax-pre-mulgt0 10998 ax-pre-sup 10999 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3or 1088 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3304 df-reu 3305 df-rab 3306 df-v 3439 df-sbc 3722 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4566 df-pr 4568 df-op 4572 df-uni 4845 df-int 4887 df-iun 4933 df-br 5082 df-opab 5144 df-mpt 5165 df-tr 5199 df-id 5500 df-eprel 5506 df-po 5514 df-so 5515 df-fr 5555 df-se 5556 df-we 5557 df-xp 5606 df-rel 5607 df-cnv 5608 df-co 5609 df-dm 5610 df-rn 5611 df-res 5612 df-ima 5613 df-pred 6217 df-ord 6284 df-on 6285 df-lim 6286 df-suc 6287 df-iota 6410 df-fun 6460 df-fn 6461 df-f 6462 df-f1 6463 df-fo 6464 df-f1o 6465 df-fv 6466 df-isom 6467 df-riota 7264 df-ov 7310 df-oprab 7311 df-mpo 7312 df-om 7745 df-1st 7863 df-2nd 7864 df-frecs 8128 df-wrecs 8159 df-recs 8233 df-rdg 8272 df-1o 8328 df-er 8529 df-en 8765 df-dom 8766 df-sdom 8767 df-fin 8768 df-sup 9249 df-inf 9250 df-oi 9317 df-card 9745 df-pnf 11061 df-mnf 11062 df-xr 11063 df-ltxr 11064 df-le 11065 df-sub 11257 df-neg 11258 df-div 11683 df-nn 12024 df-2 12086 df-3 12087 df-n0 12284 df-z 12370 df-uz 12633 df-rp 12781 df-fz 13290 df-fzo 13433 df-seq 13772 df-exp 13833 df-hash 14095 df-cj 14859 df-re 14860 df-im 14861 df-sqrt 14995 df-abs 14996 df-clim 15246 df-prod 15665 df-dvds 16013 df-lcm 16344 df-lcmf 16345 |
This theorem is referenced by: lcmfsn 16389 |
Copyright terms: Public domain | W3C validator |