| 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 11144 | . . . . . 6 ⊢ 0 ∈ V | |
| 2 | 1 | elpr 4610 | . . . . 5 ⊢ (0 ∈ {𝑀, 𝑁} ↔ (0 = 𝑀 ∨ 0 = 𝑁)) |
| 3 | eqcom 2736 | . . . . . 6 ⊢ (0 = 𝑀 ↔ 𝑀 = 0) | |
| 4 | eqcom 2736 | . . . . . 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 5105 | . . . . . 6 ⊢ (𝑚 = 𝑀 → (𝑚 ∥ 𝑛 ↔ 𝑀 ∥ 𝑛)) | |
| 9 | breq1 5105 | . . . . . 6 ⊢ (𝑚 = 𝑁 → (𝑚 ∥ 𝑛 ↔ 𝑁 ∥ 𝑛)) | |
| 10 | 8, 9 | ralprg 4656 | . . . . 5 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛 ↔ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛))) |
| 11 | 10 | rabbidv 3410 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛} = {𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}) |
| 12 | 11 | infeq1d 9405 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ) = inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < )) |
| 13 | 7, 12 | ifbieq2d 4511 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < )) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) |
| 14 | prssi 4781 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → {𝑀, 𝑁} ⊆ ℤ) | |
| 15 | prfi 9250 | . . 3 ⊢ {𝑀, 𝑁} ∈ Fin | |
| 16 | lcmfval 16567 | . . 3 ⊢ (({𝑀, 𝑁} ⊆ ℤ ∧ {𝑀, 𝑁} ∈ Fin) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) | |
| 17 | 14, 15, 16 | sylancl 586 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = if(0 ∈ {𝑀, 𝑁}, 0, inf({𝑛 ∈ ℕ ∣ ∀𝑚 ∈ {𝑀, 𝑁}𝑚 ∥ 𝑛}, ℝ, < ))) |
| 18 | lcmval 16538 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 lcm 𝑁) = if((𝑀 = 0 ∨ 𝑁 = 0), 0, inf({𝑛 ∈ ℕ ∣ (𝑀 ∥ 𝑛 ∧ 𝑁 ∥ 𝑛)}, ℝ, < ))) | |
| 19 | 13, 17, 18 | 3eqtr4d 2774 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (lcm‘{𝑀, 𝑁}) = (𝑀 lcm 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ∀wral 3044 {crab 3402 ⊆ wss 3911 ifcif 4484 {cpr 4587 class class class wbr 5102 ‘cfv 6499 (class class class)co 7369 Fincfn 8895 infcinf 9368 ℝcr 11043 0cc0 11044 < clt 11184 ℕcn 12162 ℤcz 12505 ∥ cdvds 16198 lcm clcm 16534 lcmclcmf 16535 |
| 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 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-inf2 9570 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 ax-pre-sup 11122 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9369 df-inf 9370 df-oi 9439 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-n0 12419 df-z 12506 df-uz 12770 df-rp 12928 df-fz 13445 df-fzo 13592 df-seq 13943 df-exp 14003 df-hash 14272 df-cj 15041 df-re 15042 df-im 15043 df-sqrt 15177 df-abs 15178 df-clim 15430 df-prod 15846 df-dvds 16199 df-lcm 16536 df-lcmf 16537 |
| This theorem is referenced by: lcmfsn 16581 |
| Copyright terms: Public domain | W3C validator |