![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sravsca | Structured version Visualization version GIF version |
Description: The scalar product operation of a subring algebra. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Proof shortened by AV, 12-Nov-2024.) |
Ref | Expression |
---|---|
srapart.a | ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
srapart.s | ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) |
Ref | Expression |
---|---|
sravsca | ⊢ (𝜑 → (.r‘𝑊) = ( ·𝑠 ‘𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ovex 7481 | . . . . 5 ⊢ (𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) ∈ V | |
2 | fvex 6933 | . . . . 5 ⊢ (.r‘𝑊) ∈ V | |
3 | vscaid 17379 | . . . . . 6 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
4 | 3 | setsid 17255 | . . . . 5 ⊢ (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) ∈ V ∧ (.r‘𝑊) ∈ V) → (.r‘𝑊) = ( ·𝑠 ‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉))) |
5 | 1, 2, 4 | mp2an 691 | . . . 4 ⊢ (.r‘𝑊) = ( ·𝑠 ‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
6 | slotsdifipndx 17394 | . . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx)) | |
7 | 6 | simpli 483 | . . . . 5 ⊢ ( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) |
8 | 3, 7 | setsnid 17256 | . . . 4 ⊢ ( ·𝑠 ‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = ( ·𝑠 ‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
9 | 5, 8 | eqtri 2768 | . . 3 ⊢ (.r‘𝑊) = ( ·𝑠 ‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
10 | srapart.a | . . . . . 6 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) | |
11 | 10 | adantl 481 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
12 | srapart.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) | |
13 | sraval 21197 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
14 | 12, 13 | sylan2 592 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
15 | 11, 14 | eqtrd 2780 | . . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
16 | 15 | fveq2d 6924 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
17 | 9, 16 | eqtr4id 2799 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (.r‘𝑊) = ( ·𝑠 ‘𝐴)) |
18 | 3 | str0 17236 | . . 3 ⊢ ∅ = ( ·𝑠 ‘∅) |
19 | fvprc 6912 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (.r‘𝑊) = ∅) | |
20 | 19 | adantr 480 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (.r‘𝑊) = ∅) |
21 | fv2prc 6965 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
22 | 10, 21 | sylan9eqr 2802 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
23 | 22 | fveq2d 6924 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘∅)) |
24 | 18, 20, 23 | 3eqtr4a 2806 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (.r‘𝑊) = ( ·𝑠 ‘𝐴)) |
25 | 17, 24 | pm2.61ian 811 | 1 ⊢ (𝜑 → (.r‘𝑊) = ( ·𝑠 ‘𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 Vcvv 3488 ⊆ wss 3976 ∅c0 4352 〈cop 4654 ‘cfv 6573 (class class class)co 7448 sSet csts 17210 ndxcnx 17240 Basecbs 17258 ↾s cress 17287 .rcmulr 17312 Scalarcsca 17314 ·𝑠 cvsca 17315 ·𝑖cip 17316 subringAlg csra 21193 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-nn 12294 df-2 12356 df-3 12357 df-4 12358 df-5 12359 df-6 12360 df-7 12361 df-8 12362 df-sets 17211 df-slot 17229 df-ndx 17241 df-sca 17327 df-vsca 17328 df-ip 17329 df-sra 21195 |
This theorem is referenced by: sralmod 21217 rlmvsca 21230 sraassab 21911 sraassaOLD 21913 evls1maplmhm 22402 sranlm 24726 drgextvsca 33605 drgextlsp 33608 fedgmullem1 33642 extdg1id 33676 ccfldsrarelvec 33681 ccfldextdgrr 33682 |
Copyright terms: Public domain | W3C validator |