| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lfladd | Structured version Visualization version GIF version | ||
| Description: Property of a linear functional. (lnfnaddi 32067 analog.) (Contributed by NM, 18-Apr-2014.) |
| Ref | Expression |
|---|---|
| lfladd.d | ⊢ 𝐷 = (Scalar‘𝑊) |
| lfladd.p | ⊢ ⨣ = (+g‘𝐷) |
| lfladd.v | ⊢ 𝑉 = (Base‘𝑊) |
| lfladd.a | ⊢ + = (+g‘𝑊) |
| lfladd.f | ⊢ 𝐹 = (LFnl‘𝑊) |
| Ref | Expression |
|---|---|
| lfladd | ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(𝑋 + 𝑌)) = ((𝐺‘𝑋) ⨣ (𝐺‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1136 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝑊 ∈ LMod) | |
| 2 | simp2 1137 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝐺 ∈ 𝐹) | |
| 3 | lfladd.d | . . . . 5 ⊢ 𝐷 = (Scalar‘𝑊) | |
| 4 | eqid 2734 | . . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 5 | eqid 2734 | . . . . 5 ⊢ (1r‘𝐷) = (1r‘𝐷) | |
| 6 | 3, 4, 5 | lmod1cl 20838 | . . . 4 ⊢ (𝑊 ∈ LMod → (1r‘𝐷) ∈ (Base‘𝐷)) |
| 7 | 6 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (1r‘𝐷) ∈ (Base‘𝐷)) |
| 8 | simp3l 1202 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝑋 ∈ 𝑉) | |
| 9 | simp3r 1203 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝑌 ∈ 𝑉) | |
| 10 | lfladd.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 11 | lfladd.a | . . . 4 ⊢ + = (+g‘𝑊) | |
| 12 | eqid 2734 | . . . 4 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊) | |
| 13 | lfladd.p | . . . 4 ⊢ ⨣ = (+g‘𝐷) | |
| 14 | eqid 2734 | . . . 4 ⊢ (.r‘𝐷) = (.r‘𝐷) | |
| 15 | lfladd.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑊) | |
| 16 | 10, 11, 3, 12, 4, 13, 14, 15 | lfli 39260 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ ((1r‘𝐷) ∈ (Base‘𝐷) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) + 𝑌)) = (((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) ⨣ (𝐺‘𝑌))) |
| 17 | 1, 2, 7, 8, 9, 16 | syl113anc 1384 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) + 𝑌)) = (((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) ⨣ (𝐺‘𝑌))) |
| 18 | 10, 3, 12, 5 | lmodvs1 20839 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) = 𝑋) |
| 19 | 1, 8, 18 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) = 𝑋) |
| 20 | 19 | fvoveq1d 7378 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) + 𝑌)) = (𝐺‘(𝑋 + 𝑌))) |
| 21 | 3 | lmodring 20817 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝐷 ∈ Ring) |
| 22 | 21 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝐷 ∈ Ring) |
| 23 | 3, 4, 10, 15 | lflcl 39263 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ 𝑋 ∈ 𝑉) → (𝐺‘𝑋) ∈ (Base‘𝐷)) |
| 24 | 23 | 3adant3r 1182 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘𝑋) ∈ (Base‘𝐷)) |
| 25 | 4, 14, 5 | ringlidm 20202 | . . . 4 ⊢ ((𝐷 ∈ Ring ∧ (𝐺‘𝑋) ∈ (Base‘𝐷)) → ((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) = (𝐺‘𝑋)) |
| 26 | 22, 24, 25 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) = (𝐺‘𝑋)) |
| 27 | 26 | oveq1d 7371 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) ⨣ (𝐺‘𝑌)) = ((𝐺‘𝑋) ⨣ (𝐺‘𝑌))) |
| 28 | 17, 20, 27 | 3eqtr3d 2777 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(𝑋 + 𝑌)) = ((𝐺‘𝑋) ⨣ (𝐺‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ‘cfv 6490 (class class class)co 7356 Basecbs 17134 +gcplusg 17175 .rcmulr 17176 Scalarcsca 17178 ·𝑠 cvsca 17179 1rcur 20114 Ringcrg 20166 LModclmod 20809 LFnlclfn 39256 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-map 8763 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-plusg 17188 df-0g 17359 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-mgp 20074 df-ur 20115 df-ring 20168 df-lmod 20811 df-lfl 39257 |
| This theorem is referenced by: lfladdcl 39270 hdmaplna1 42106 |
| Copyright terms: Public domain | W3C validator |