| 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 16708 | . . . . . 6 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘𝑌) ∈ ℕ0) | |
| 2 | 1 | nn0zd 12631 | . . . . 5 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘𝑌) ∈ ℤ) |
| 3 | lcmfsn 16715 | . . . . 5 ⊢ ((lcm‘𝑌) ∈ ℤ → (lcm‘{(lcm‘𝑌)}) = (abs‘(lcm‘𝑌))) | |
| 4 | 2, 3 | syl 18 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘{(lcm‘𝑌)}) = (abs‘(lcm‘𝑌))) |
| 5 | nn0re 12528 | . . . . . 6 ⊢ ((lcm‘𝑌) ∈ ℕ0 → (lcm‘𝑌) ∈ ℝ) | |
| 6 | nn0ge0 12544 | . . . . . 6 ⊢ ((lcm‘𝑌) ∈ ℕ0 → 0 ≤ (lcm‘𝑌)) | |
| 7 | 5, 6 | jca 521 | . . . . 5 ⊢ ((lcm‘𝑌) ∈ ℕ0 → ((lcm‘𝑌) ∈ ℝ ∧ 0 ≤ (lcm‘𝑌))) |
| 8 | absid 15371 | . . . . 5 ⊢ (((lcm‘𝑌) ∈ ℝ ∧ 0 ≤ (lcm‘𝑌)) → (abs‘(lcm‘𝑌)) = (lcm‘𝑌)) | |
| 9 | 1, 7, 8 | 3syl 19 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (abs‘(lcm‘𝑌)) = (lcm‘𝑌)) |
| 10 | 4, 9 | eqtrd 2800 | . . 3 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → (lcm‘{(lcm‘𝑌)}) = (lcm‘𝑌)) |
| 11 | lcmfcl 16708 | . . . . . 6 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) ∈ ℕ0) | |
| 12 | 11 | nn0zd 12631 | . . . . 5 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) ∈ ℤ) |
| 13 | lcmfsn 16715 | . . . . 5 ⊢ ((lcm‘𝑍) ∈ ℤ → (lcm‘{(lcm‘𝑍)}) = (abs‘(lcm‘𝑍))) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘{(lcm‘𝑍)}) = (abs‘(lcm‘𝑍))) |
| 15 | nn0re 12528 | . . . . . 6 ⊢ ((lcm‘𝑍) ∈ ℕ0 → (lcm‘𝑍) ∈ ℝ) | |
| 16 | nn0ge0 12544 | . . . . . 6 ⊢ ((lcm‘𝑍) ∈ ℕ0 → 0 ≤ (lcm‘𝑍)) | |
| 17 | 15, 16 | jca 521 | . . . . 5 ⊢ ((lcm‘𝑍) ∈ ℕ0 → ((lcm‘𝑍) ∈ ℝ ∧ 0 ≤ (lcm‘𝑍))) |
| 18 | absid 15371 | . . . . 5 ⊢ (((lcm‘𝑍) ∈ ℝ ∧ 0 ≤ (lcm‘𝑍)) → (abs‘(lcm‘𝑍)) = (lcm‘𝑍)) | |
| 19 | 11, 17, 18 | 3syl 19 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (abs‘(lcm‘𝑍)) = (lcm‘𝑍)) |
| 20 | 14, 19 | eqtr2d 2801 | . . 3 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → (lcm‘𝑍) = (lcm‘{(lcm‘𝑍)})) |
| 21 | 10, 20 | oveqan12d 7438 | . 2 ⊢ (((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) ∧ (𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin)) → ((lcm‘{(lcm‘𝑌)}) lcm (lcm‘𝑍)) = ((lcm‘𝑌) lcm (lcm‘{(lcm‘𝑍)}))) |
| 22 | 2 | snssd 4754 | . . . 4 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → {(lcm‘𝑌)} ⊆ ℤ) |
| 23 | snfi 9047 | . . . 4 ⊢ {(lcm‘𝑌)} ∈ Fin | |
| 24 | 22, 23 | jctir 530 | . . 3 ⊢ ((𝑌 ⊆ ℤ ∧ 𝑌 ∈ Fin) → ({(lcm‘𝑌)} ⊆ ℤ ∧ {(lcm‘𝑌)} ∈ Fin)) |
| 25 | lcmfun 16725 | . . 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 4754 | . . . 4 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → {(lcm‘𝑍)} ⊆ ℤ) |
| 28 | snfi 9047 | . . . 4 ⊢ {(lcm‘𝑍)} ∈ Fin | |
| 29 | 27, 28 | jctir 530 | . . 3 ⊢ ((𝑍 ⊆ ℤ ∧ 𝑍 ∈ Fin) → ({(lcm‘𝑍)} ⊆ ℤ ∧ {(lcm‘𝑍)} ∈ Fin)) |
| 30 | lcmfun 16725 | . . 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 2810 | 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 2146 ∪ cun 3904 ⊆ wss 3906 {csn 4591 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 Fincfn 8949 ℝcr 11114 0cc0 11115 ≤ cle 11259 ℕ0cn0 12519 ℤcz 12606 abscabs 15309 lcm clcm 16668 lcmclcmf 16669 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-inf2 9617 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 ax-pre-sup 11193 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-sup 9409 df-inf 9410 df-oi 9479 df-card 9941 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-div 11887 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-z 12607 df-uz 12879 df-rp 13033 df-fz 13552 df-fzo 13700 df-fl 13843 df-mod 13921 df-seq 14056 df-exp 14116 df-hash 14385 df-cj 15174 df-re 15175 df-im 15176 df-sqrt 15310 df-abs 15311 df-clim 15563 df-prod 15981 df-dvds 16333 df-gcd 16575 df-lcm 16670 df-lcmf 16671 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |