| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lfladdass | Structured version Visualization version GIF version | ||
| Description: Associativity of functional addition. (Contributed by NM, 19-Oct-2014.) |
| Ref | Expression |
|---|---|
| lfladdcl.r | ⊢ 𝑅 = (Scalar‘𝑊) |
| lfladdcl.p | ⊢ + = (+g‘𝑅) |
| lfladdcl.f | ⊢ 𝐹 = (LFnl‘𝑊) |
| lfladdcl.w | ⊢ (𝜑 → 𝑊 ∈ LMod) |
| lfladdcl.g | ⊢ (𝜑 → 𝐺 ∈ 𝐹) |
| lfladdcl.h | ⊢ (𝜑 → 𝐻 ∈ 𝐹) |
| lfladdass.i | ⊢ (𝜑 → 𝐼 ∈ 𝐹) |
| Ref | Expression |
|---|---|
| lfladdass | ⊢ (𝜑 → ((𝐺 ∘f + 𝐻) ∘f + 𝐼) = (𝐺 ∘f + (𝐻 ∘f + 𝐼))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvexd 6888 | . 2 ⊢ (𝜑 → (Base‘𝑊) ∈ V) | |
| 2 | lfladdcl.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ LMod) | |
| 3 | lfladdcl.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐹) | |
| 4 | lfladdcl.r | . . . 4 ⊢ 𝑅 = (Scalar‘𝑊) | |
| 5 | eqid 2760 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 6 | eqid 2760 | . . . 4 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 7 | lfladdcl.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑊) | |
| 8 | 4, 5, 6, 7 | lflf 40040 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹) → 𝐺:(Base‘𝑊)⟶(Base‘𝑅)) |
| 9 | 2, 3, 8 | syl2anc 596 | . 2 ⊢ (𝜑 → 𝐺:(Base‘𝑊)⟶(Base‘𝑅)) |
| 10 | lfladdcl.h | . . 3 ⊢ (𝜑 → 𝐻 ∈ 𝐹) | |
| 11 | 4, 5, 6, 7 | lflf 40040 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐻 ∈ 𝐹) → 𝐻:(Base‘𝑊)⟶(Base‘𝑅)) |
| 12 | 2, 10, 11 | syl2anc 596 | . 2 ⊢ (𝜑 → 𝐻:(Base‘𝑊)⟶(Base‘𝑅)) |
| 13 | lfladdass.i | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝐹) | |
| 14 | 4, 5, 6, 7 | lflf 40040 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐼 ∈ 𝐹) → 𝐼:(Base‘𝑊)⟶(Base‘𝑅)) |
| 15 | 2, 13, 14 | syl2anc 596 | . 2 ⊢ (𝜑 → 𝐼:(Base‘𝑊)⟶(Base‘𝑅)) |
| 16 | 4 | lmodring 21105 | . . . 4 ⊢ (𝑊 ∈ LMod → 𝑅 ∈ Ring) |
| 17 | ringgrp 20426 | . . . 4 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 18 | 2, 16, 17 | 3syl 19 | . . 3 ⊢ (𝜑 → 𝑅 ∈ Grp) |
| 19 | lfladdcl.p | . . . 4 ⊢ + = (+g‘𝑅) | |
| 20 | 5, 19 | grpass 19115 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 21 | 18, 20 | sylan 592 | . 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅) ∧ 𝑧 ∈ (Base‘𝑅))) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧))) |
| 22 | 1, 9, 12, 15, 21 | caofass 7716 | 1 ⊢ (𝜑 → ((𝐺 ∘f + 𝐻) ∘f + 𝐼) = (𝐺 ∘f + (𝐻 ∘f + 𝐼))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ⟶wf 6523 ‘cfv 6527 (class class class)co 7408 ∘f cof 7674 Basecbs 17349 +gcplusg 17390 Scalarcsca 17393 Grpcgrp 19106 Ringcrg 20421 LModclmod 21097 LFnlclfn 40034 |
| 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 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-ov 7411 df-oprab 7412 df-mpo 7413 df-of 7676 df-map 8827 df-sgrp 18870 df-mnd 18886 df-grp 19109 df-ring 20423 df-lmod 21099 df-lfl 40035 |
| This theorem is used by: ldualgrplem 40122 |
| Copyright terms: Public domain | W3C validator |