| 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 7391 | . . . . 5 ⊢ (𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) ∈ V | |
| 2 | fvex 6847 | . . . . 5 ⊢ (.r‘𝑊) ∈ V | |
| 3 | vscaid 17240 | . . . . . 6 ⊢ ·𝑠 = Slot ( ·𝑠 ‘ndx) | |
| 4 | 3 | setsid 17134 | . . . . 5 ⊢ (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) ∈ V ∧ (.r‘𝑊) ∈ V) → (.r‘𝑊) = ( ·𝑠 ‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉))) |
| 5 | 1, 2, 4 | mp2an 692 | . . . 4 ⊢ (.r‘𝑊) = ( ·𝑠 ‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 6 | slotsdifipndx 17255 | . . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx)) | |
| 7 | 6 | simpli 483 | . . . . 5 ⊢ ( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) |
| 8 | 3, 7 | setsnid 17135 | . . . 4 ⊢ ( ·𝑠 ‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = ( ·𝑠 ‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 9 | 5, 8 | eqtri 2759 | . . 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 21127 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
| 14 | 12, 13 | sylan2 593 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 15 | 11, 14 | eqtrd 2771 | . . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 16 | 15 | fveq2d 6838 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 17 | 9, 16 | eqtr4id 2790 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (.r‘𝑊) = ( ·𝑠 ‘𝐴)) |
| 18 | 3 | str0 17116 | . . 3 ⊢ ∅ = ( ·𝑠 ‘∅) |
| 19 | fvprc 6826 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (.r‘𝑊) = ∅) | |
| 20 | 19 | adantr 480 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (.r‘𝑊) = ∅) |
| 21 | fv2prc 6876 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 22 | 10, 21 | sylan9eqr 2793 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 23 | 22 | fveq2d 6838 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → ( ·𝑠 ‘𝐴) = ( ·𝑠 ‘∅)) |
| 24 | 18, 20, 23 | 3eqtr4a 2797 | . 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 1541 ∈ wcel 2113 ≠ wne 2932 Vcvv 3440 ⊆ wss 3901 ∅c0 4285 〈cop 4586 ‘cfv 6492 (class class class)co 7358 sSet csts 17090 ndxcnx 17120 Basecbs 17136 ↾s cress 17157 .rcmulr 17178 Scalarcsca 17180 ·𝑠 cvsca 17181 ·𝑖cip 17182 subringAlg csra 21123 |
| 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 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-5 12211 df-6 12212 df-7 12213 df-8 12214 df-sets 17091 df-slot 17109 df-ndx 17121 df-sca 17193 df-vsca 17194 df-ip 17195 df-sra 21125 |
| This theorem is referenced by: sralmod 21139 rlmvsca 21152 sraassab 21823 sraassaOLD 21825 evls1maplmhm 22321 sranlm 24628 drgextvsca 33747 drgextlsp 33750 fedgmullem1 33786 extdg1id 33823 ccfldsrarelvec 33828 ccfldextdgrr 33829 fldextrspunlsplem 33830 fldextrspunlsp 33831 extdgfialglem1 33849 |
| Copyright terms: Public domain | W3C validator |