| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lcmfass | Structured version Visualization version GIF version | ||
| Description: Associative law for the lcm function. (Contributed by AV, 27-Aug-2020.) |
| Ref | Expression |
|---|---|
| lcmfass | ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → (lcm‘({(lcm‘𝑌)} ∪ 𝑍)) = (lcm‘(𝑌 ∪ {(lcm‘𝑍)}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lcmfcl 16718 | . . . . . 6 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘𝑌) ∈ ℕ0) | |
| 2 | 1 | nn0zd 12640 | . . . . 5 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘𝑌) ∈ ℤ) |
| 3 | lcmfsn 16725 | . . . . 5 ⊢ ((lcm‘𝑌) ∈ ℤ → (lcm‘{(lcm‘𝑌)}) = (abs‘(lcm‘𝑌))) | |
| 4 | 2, 3 | syl 18 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘{(lcm‘𝑌)}) = (abs‘(lcm‘𝑌))) |
| 5 | nn0re 12537 | . . . . . 6 ⊢ ((lcm‘𝑌) ∈ ℕ0 → (lcm‘𝑌) ∈ ℝ) | |
| 6 | nn0ge0 12553 | . . . . . 6 ⊢ ((lcm‘𝑌) ∈ ℕ0 → 0 ≤ (lcm‘𝑌)) | |
| 7 | 5, 6 | jca 521 | . . . . 5 ⊢ ((lcm‘𝑌) ∈ ℕ0 → ((lcm‘𝑌) ∈ ℝ ∧ 0 ≤ (lcm‘𝑌))) |
| 8 | absid 15383 | . . . . 5 ⊢ (((lcm‘𝑌) ∈ ℝ ∧ 0 ≤ (lcm‘𝑌)) → (abs‘(lcm‘𝑌)) = (lcm‘𝑌)) | |
| 9 | 1, 7, 8 | 3syl 19 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (abs‘(lcm‘𝑌)) = (lcm‘𝑌)) |
| 10 | 4, 9 | eqtrd 2795 | . . 3 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘{(lcm‘𝑌)}) = (lcm‘𝑌)) |
| 11 | lcmfcl 16718 | . . . . . 6 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) ∈ ℕ0) | |
| 12 | 11 | nn0zd 12640 | . . . . 5 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) ∈ ℤ) |
| 13 | lcmfsn 16725 | . . . . 5 ⊢ ((lcm‘𝑍) ∈ ℤ → (lcm‘{(lcm‘𝑍)}) = (abs‘(lcm‘𝑍))) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘{(lcm‘𝑍)}) = (abs‘(lcm‘𝑍))) |
| 15 | nn0re 12537 | . . . . . 6 ⊢ ((lcm‘𝑍) ∈ ℕ0 → (lcm‘𝑍) ∈ ℝ) | |
| 16 | nn0ge0 12553 | . . . . . 6 ⊢ ((lcm‘𝑍) ∈ ℕ0 → 0 ≤ (lcm‘𝑍)) | |
| 17 | 15, 16 | jca 521 | . . . . 5 ⊢ ((lcm‘𝑍) ∈ ℕ0 → ((lcm‘𝑍) ∈ ℝ ∧ 0 ≤ (lcm‘𝑍))) |
| 18 | absid 15383 | . . . . 5 ⊢ (((lcm‘𝑍) ∈ ℝ ∧ 0 ≤ (lcm‘𝑍)) → (abs‘(lcm‘𝑍)) = (lcm‘𝑍)) | |
| 19 | 11, 17, 18 | 3syl 19 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (abs‘(lcm‘𝑍)) = (lcm‘𝑍)) |
| 20 | 14, 19 | eqtr2d 2796 | . . 3 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) = (lcm‘{(lcm‘𝑍)})) |
| 21 | 10, 20 | oveqan12d 7432 | . 2 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → ((lcm‘{(lcm‘𝑌)}) lcm (lcm‘𝑍)) = ((lcm‘𝑌) lcm (lcm‘{(lcm‘𝑍)}))) |
| 22 | 2 | snssd 4747 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → {(lcm‘𝑌)} ⊆ ℤ) |
| 23 | snfi 9050 | . . . 4 ⊢ {(lcm‘𝑌)} ∈ Fin | |
| 24 | 22, 23 | jctir 530 | . . 3 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → ({(lcm‘𝑌)} ⊆ ℤ ∧ {(lcm‘𝑌)} ∈ Fin)) |
| 25 | lcmfun 16735 | . . 3 ⊢ ((({(lcm‘𝑌)} ⊆ ℤ ∧ {(lcm‘𝑌)} ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → (lcm‘({(lcm‘𝑌)} ∪ 𝑍)) = ((lcm‘{(lcm‘𝑌)}) lcm (lcm‘𝑍))) | |
| 26 | 24, 25 | sylan 592 | . 2 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → (lcm‘({(lcm‘𝑌)} ∪ 𝑍)) = ((lcm‘{(lcm‘𝑌)}) lcm (lcm‘𝑍))) |
| 27 | 12 | snssd 4747 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → {(lcm‘𝑍)} ⊆ ℤ) |
| 28 | snfi 9050 | . . . 4 ⊢ {(lcm‘𝑍)} ∈ Fin | |
| 29 | 27, 28 | jctir 530 | . . 3 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → ({(lcm‘𝑍)} ⊆ ℤ ∧ {(lcm‘𝑍)} ∈ Fin)) |
| 30 | lcmfun 16735 | . . 3 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ ({(lcm‘𝑍)} ⊆ ℤ ∧ {(lcm‘𝑍)} ∈ Fin)) → (lcm‘(𝑌 ∪ {(lcm‘𝑍)})) = ((lcm‘𝑌) lcm (lcm‘{(lcm‘𝑍)}))) | |
| 31 | 29, 30 | sylan2 605 | . 2 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → (lcm‘(𝑌 ∪ {(lcm‘𝑍)})) = ((lcm‘𝑌) lcm (lcm‘{(lcm‘𝑍)}))) |
| 32 | 21, 26, 31 | 3eqtr4d 2805 | 1 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → (lcm‘({(lcm‘𝑌)} ∪ 𝑍)) = (lcm‘(𝑌 ∪ {(lcm‘𝑍)}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∪ cun 3897 ⊆ wss 3899 {csn 4584 class class class wbr 5103 ‘cfv 6533 (class class class)co 7413 Fincfn 8952 ℝcr 11123 0cc0 11124 ≤ cle 11268 ℕ0cn0 12528 ℤcz 12615 abscabs 15321 lcm clcm 16678 lcmclcmf 16679 |
| 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 7736 ax-inf2 9620 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| 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 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-oi 9482 df-card 9944 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-fz 13562 df-fzo 13710 df-fl 13853 df-mod 13931 df-seq 14066 df-exp 14126 df-hash 14395 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 df-clim 15575 df-prod 15993 df-dvds 16343 df-gcd 16585 df-lcm 16680 df-lcmf 16681 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |