| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > srasca | Structured version Visualization version GIF version | ||
| Description: The set of scalars 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 |
|---|---|
| srasca | ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | scaid 17327 | . . . . 5 ⊢ Scalar = Slot (Scalar‘ndx) | |
| 2 | vscandxnscandx 17336 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (Scalar‘ndx) | |
| 3 | 2 | necomi 3010 | . . . . 5 ⊢ (Scalar‘ndx) ≠ ( ·𝑠 ‘ndx) |
| 4 | 1, 3 | setsnid 17227 | . . . 4 ⊢ (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (Scalar‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 5 | slotsdifipndx 17347 | . . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx)) | |
| 6 | 5 | simpri 489 | . . . . 5 ⊢ (Scalar‘ndx) ≠ (·𝑖‘ndx) |
| 7 | 1, 6 | setsnid 17227 | . . . 4 ⊢ (Scalar‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = (Scalar‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 8 | 4, 7 | eqtri 2784 | . . 3 ⊢ (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (Scalar‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 9 | ovexd 7427 | . . . 4 ⊢ (𝜑 → (𝑊 ↾s 𝑆) ∈ V) | |
| 10 | 1 | setsid 17226 | . . . 4 ⊢ ((𝑊 ∈ V ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉))) |
| 11 | 9, 10 | sylan2 602 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉))) |
| 12 | srapart.a | . . . . . 6 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) | |
| 13 | 12 | adantl 485 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
| 14 | srapart.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) | |
| 15 | sraval 21222 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
| 16 | 14, 15 | sylan2 602 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 17 | 13, 16 | eqtrd 2796 | . . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 18 | 17 | fveq2d 6867 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (Scalar‘𝐴) = (Scalar‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 19 | 8, 11, 18 | 3eqtr4a 2822 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| 20 | 1 | str0 17208 | . . 3 ⊢ ∅ = (Scalar‘∅) |
| 21 | reldmress 17251 | . . . . 5 ⊢ Rel dom ↾s | |
| 22 | 21 | ovprc1 7431 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝑊 ↾s 𝑆) = ∅) |
| 23 | 22 | adantr 484 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = ∅) |
| 24 | fv2prc 6905 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 25 | 12, 24 | sylan9eqr 2818 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 26 | 25 | fveq2d 6867 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (Scalar‘𝐴) = (Scalar‘∅)) |
| 27 | 20, 23, 26 | 3eqtr4a 2822 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| 28 | 19, 27 | pm2.61ian 821 | 1 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 Vcvv 3453 ⊆ wss 3904 ∅c0 4285 〈cop 4587 ‘cfv 6517 (class class class)co 7392 sSet csts 17182 ndxcnx 17212 Basecbs 17228 ↾s cress 17249 .rcmulr 17270 Scalarcsca 17272 ·𝑠 cvsca 17273 ·𝑖cip 17274 subringAlg csra 21218 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-om 7843 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-er 8673 df-en 8924 df-dom 8925 df-sdom 8926 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-nn 12208 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-sets 17183 df-slot 17201 df-ndx 17213 df-ress 17250 df-sca 17285 df-vsca 17286 df-ip 17287 df-sra 21220 |
| This theorem is referenced by: sralmod 21234 rlmsca 21245 rlmsca2 21246 frlmip 21810 sraassab 21900 evls1maplmhm 22420 sranlm 24724 srabn 25402 rrxprds 25431 sralvec 33843 drgext0gsca 33850 drgextlsp 33852 fedgmullem1 33887 fedgmullem2 33888 fedgmul 33889 extdg1id 33924 ccfldsrarelvec 33929 ccfldextdgrr 33930 fldextrspunlsplem 33931 fldextrspunlsp 33932 fldextrspunlem1 33933 fldextrspunfld 33934 extdgfialglem1 33950 |
| Copyright terms: Public domain | W3C validator |