| 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 31972 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 2729 | . . . . 5 ⊢ (Base‘𝐷) = (Base‘𝐷) | |
| 5 | eqid 2729 | . . . . 5 ⊢ (1r‘𝐷) = (1r‘𝐷) | |
| 6 | 3, 4, 5 | lmod1cl 20795 | . . . 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 2729 | . . . 4 ⊢ ( ·𝑠 ‘𝑊) = ( ·𝑠 ‘𝑊) | |
| 13 | lfladd.p | . . . 4 ⊢ ⨣ = (+g‘𝐷) | |
| 14 | eqid 2729 | . . . 4 ⊢ (.r‘𝐷) = (.r‘𝐷) | |
| 15 | lfladd.f | . . . 4 ⊢ 𝐹 = (LFnl‘𝑊) | |
| 16 | 10, 11, 3, 12, 4, 13, 14, 15 | lfli 39054 | . . 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 20796 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝑋 ∈ 𝑉) → ((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) = 𝑋) |
| 19 | 1, 8, 18 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) = 𝑋) |
| 20 | 19 | fvoveq1d 7409 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(((1r‘𝐷)( ·𝑠 ‘𝑊)𝑋) + 𝑌)) = (𝐺‘(𝑋 + 𝑌))) |
| 21 | 3 | lmodring 20774 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝐷 ∈ Ring) |
| 22 | 21 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → 𝐷 ∈ Ring) |
| 23 | 3, 4, 10, 15 | lflcl 39057 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ 𝑋 ∈ 𝑉) → (𝐺‘𝑋) ∈ (Base‘𝐷)) |
| 24 | 23 | 3adant3r 1182 | . . . 4 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘𝑋) ∈ (Base‘𝐷)) |
| 25 | 4, 14, 5 | ringlidm 20178 | . . . 4 ⊢ ((𝐷 ∈ Ring ∧ (𝐺‘𝑋) ∈ (Base‘𝐷)) → ((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) = (𝐺‘𝑋)) |
| 26 | 22, 24, 25 | syl2anc 584 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → ((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) = (𝐺‘𝑋)) |
| 27 | 26 | oveq1d 7402 | . 2 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((1r‘𝐷)(.r‘𝐷)(𝐺‘𝑋)) ⨣ (𝐺‘𝑌)) = ((𝐺‘𝑋) ⨣ (𝐺‘𝑌))) |
| 28 | 17, 20, 27 | 3eqtr3d 2772 | 1 ⊢ ((𝑊 ∈ LMod ∧ 𝐺 ∈ 𝐹 ∧ (𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (𝐺‘(𝑋 + 𝑌)) = ((𝐺‘𝑋) ⨣ (𝐺‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ‘cfv 6511 (class class class)co 7387 Basecbs 17179 +gcplusg 17220 .rcmulr 17221 Scalarcsca 17223 ·𝑠 cvsca 17224 1rcur 20090 Ringcrg 20142 LModclmod 20766 LFnlclfn 39050 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-0g 17404 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mgp 20050 df-ur 20091 df-ring 20144 df-lmod 20768 df-lfl 39051 |
| This theorem is referenced by: lfladdcl 39064 hdmaplna1 41901 |
| Copyright terms: Public domain | W3C validator |