| 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 16803 | . . . . . 6 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘𝑌) ∈ ℕ0) | |
| 2 | 1 | nn0zd 12718 | . . . . 5 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘𝑌) ∈ ℤ) |
| 3 | lcmfsn 16810 | . . . . 5 ⊢ ((lcm‘𝑌) ∈ ℤ → (lcm‘{(lcm‘𝑌)}) = (abs‘(lcm‘𝑌))) | |
| 4 | 2, 3 | syl 18 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘{(lcm‘𝑌)}) = (abs‘(lcm‘𝑌))) |
| 5 | nn0re 12615 | . . . . . 6 ⊢ ((lcm‘𝑌) ∈ ℕ0 → (lcm‘𝑌) ∈ ℝ) | |
| 6 | nn0ge0 12631 | . . . . . 6 ⊢ ((lcm‘𝑌) ∈ ℕ0 → 0 ≤ (lcm‘𝑌)) | |
| 7 | 5, 6 | jca 521 | . . . . 5 ⊢ ((lcm‘𝑌) ∈ ℕ0 → ((lcm‘𝑌) ∈ ℝ ∧ 0 ≤ (lcm‘𝑌))) |
| 8 | absid 15463 | . . . . 5 ⊢ (((lcm‘𝑌) ∈ ℝ ∧ 0 ≤ (lcm‘𝑌)) → (abs‘(lcm‘𝑌)) = (lcm‘𝑌)) | |
| 9 | 1, 7, 8 | 3syl 19 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (abs‘(lcm‘𝑌)) = (lcm‘𝑌)) |
| 10 | 4, 9 | eqtrd 2796 | . . 3 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘{(lcm‘𝑌)}) = (lcm‘𝑌)) |
| 11 | lcmfcl 16803 | . . . . . 6 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) ∈ ℕ0) | |
| 12 | 11 | nn0zd 12718 | . . . . 5 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) ∈ ℤ) |
| 13 | lcmfsn 16810 | . . . . 5 ⊢ ((lcm‘𝑍) ∈ ℤ → (lcm‘{(lcm‘𝑍)}) = (abs‘(lcm‘𝑍))) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘{(lcm‘𝑍)}) = (abs‘(lcm‘𝑍))) |
| 15 | nn0re 12615 | . . . . . 6 ⊢ ((lcm‘𝑍) ∈ ℕ0 → (lcm‘𝑍) ∈ ℝ) | |
| 16 | nn0ge0 12631 | . . . . . 6 ⊢ ((lcm‘𝑍) ∈ ℕ0 → 0 ≤ (lcm‘𝑍)) | |
| 17 | 15, 16 | jca 521 | . . . . 5 ⊢ ((lcm‘𝑍) ∈ ℕ0 → ((lcm‘𝑍) ∈ ℝ ∧ 0 ≤ (lcm‘𝑍))) |
| 18 | absid 15463 | . . . . 5 ⊢ (((lcm‘𝑍) ∈ ℝ ∧ 0 ≤ (lcm‘𝑍)) → (abs‘(lcm‘𝑍)) = (lcm‘𝑍)) | |
| 19 | 11, 17, 18 | 3syl 19 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (abs‘(lcm‘𝑍)) = (lcm‘𝑍)) |
| 20 | 14, 19 | eqtr2d 2797 | . . 3 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) = (lcm‘{(lcm‘𝑍)})) |
| 21 | 10, 20 | oveqan12d 7439 | . 2 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → ((lcm‘{(lcm‘𝑌)}) lcm (lcm‘𝑍)) = ((lcm‘𝑌) lcm (lcm‘{(lcm‘𝑍)}))) |
| 22 | 2 | snssd 4747 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → {(lcm‘𝑌)} ⊆ ℤ) |
| 23 | snfi 9071 | . . . 4 ⊢ {(lcm‘𝑌)} ∈ Fin | |
| 24 | 22, 23 | jctir 530 | . . 3 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → ({(lcm‘𝑌)} ⊆ ℤ ∧ {(lcm‘𝑌)} ∈ Fin)) |
| 25 | lcmfun 16820 | . . 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 9071 | . . . 4 ⊢ {(lcm‘𝑍)} ∈ Fin | |
| 29 | 27, 28 | jctir 530 | . . 3 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → ({(lcm‘𝑍)} ⊆ ℤ ∧ {(lcm‘𝑍)} ∈ Fin)) |
| 30 | lcmfun 16820 | . . 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 2806 | 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 6538 (class class class)co 7420 Fincfn 8973 ℝcr 11199 0cc0 11200 ≤ cle 11344 ℕ0cn0 12606 ℤcz 12693 abscabs 15401 lcm clcm 16763 lcmclcmf 16764 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-inf2 9642 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-inf 9435 df-oi 9504 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-fz 13640 df-fzo 13789 df-fl 13932 df-mod 14010 df-seq 14145 df-exp 14205 df-hash 14475 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-clim 15655 df-prod 16073 df-dvds 16423 df-gcd 16665 df-lcm 16765 df-lcmf 16766 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |