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 10034 | . . . . . 6 ⊢ 0 ∈ V | |
2 | 1 | elpr 4198 | . . . . 5 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (0 = 𝑀 ∨ 0 = 𝑁)) |
3 | eqcom 2629 | . . . . . 6 ⊢ (0 = 𝑀 ↔ 𝑀 = 0) | |
4 | eqcom 2629 | . . . . . 6 ⊢ (0 = 𝑁 ↔ 𝑁 = 0) | |
5 | 3, 4 | orbi12i 543 | . . . . 5 ⊢ ((0 = 𝑀 ∨ 0 = 𝑁) ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
6 | 2, 5 | bitri 264 | . . . 4 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0)) |
7 | 6 | a1i 11 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (0 ∈ {𝑀, 𝑁} ↔ (𝑀 = 0 ∨ 𝑁 = 0))) |
8 | breq1 4656 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛)) | |
9 | breq1 4656 | . . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑚 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛)) | |
10 | 8, 9 | ralprg 4234 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛 ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))) |
11 | 10 | rabbidv 3189 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) |
12 | 11 | infeq1d 8383 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) |
13 | 7, 12 | ifbieq2d 4111 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) |
14 | prssi 4353 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑀, 𝑁} ⊆ ℤ) | |
15 | prfi 8235 | . . 3 ⊢ {𝑀, 𝑁} ∈ Fin | |
16 | lcmfval 15334 | . . 3 ⊢ (({𝑀, 𝑁} ⊆ ℤ ∧ {𝑀, 𝑁} ∈ Fin) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) | |
17 | 14, 15, 16 | sylancl 694 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) |
18 | lcmval 15305 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
19 | 13, 17, 18 | 3eqtr4d 2666 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = (𝑀 lcm 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∨ wo 383 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∀wral 2912 {crab 2916 ⊆ wss 3574 ifcif 4086 {cpr 4179 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 Fincfn 7955 infcinf 8347 ℝcr 9935 0cc0 9936 < clt 10074 ℕcn 11020 ℤcz 11377 ∥ cdvds 14983 lcm clcm 15301 lcmclcmf 15302 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-fz 12327 df-fzo 12466 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-prod 14636 df-dvds 14984 df-lcm 15303 df-lcmf 15304 |
This theorem is referenced by: lcmfsn 15348 |
Copyright terms: Public domain | W3C validator |