| 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 17491 | . . . . 5 ⊢ Scalar = Slot (Scalar‘ndx) | |
| 2 | vscandxnscandx 17500 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (Scalar‘ndx) | |
| 3 | 2 | necomi 3009 | . . . . 5 ⊢ (Scalar‘ndx) ≠ ( ·𝑠 ‘ndx) |
| 4 | 1, 3 | setsnid 17391 | . . . 4 ⊢ (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (Scalar‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 5 | slotsdifipndx 17511 | . . . . . 6 ⊢ (( ·𝑠 ‘ndx) ≠ (·𝑖‘ndx) ∧ (Scalar‘ndx) ≠ (·𝑖‘ndx)) | |
| 6 | 5 | simpri 491 | . . . . 5 ⊢ (Scalar‘ndx) ≠ (·𝑖‘ndx) |
| 7 | 1, 6 | setsnid 17391 | . . . 4 ⊢ (Scalar‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = (Scalar‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 8 | 4, 7 | eqtri 2783 | . . 3 ⊢ (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (Scalar‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 9 | ovexd 7455 | . . . 4 ⊢ (𝜑 → (𝑊 ↾s 𝑆) ∈ V) | |
| 10 | 1 | setsid 17390 | . . . 4 ⊢ ((𝑊 ∈ V ∧ (𝑊 ↾s 𝑆) ∈ V) → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉))) |
| 11 | 9, 10 | sylan2 605 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = (Scalar‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉))) |
| 12 | srapart.a | . . . . . 6 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) | |
| 13 | 12 | adantl 487 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
| 14 | srapart.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) | |
| 15 | sraval 21455 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
| 16 | 14, 15 | sylan2 605 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 17 | 13, 16 | eqtrd 2795 | . . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 18 | 17 | fveq2d 6889 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (Scalar‘𝐴) = (Scalar‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 19 | 8, 11, 18 | 3eqtr4a 2821 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| 20 | 1 | str0 17372 | . . 3 ⊢ ∅ = (Scalar‘∅) |
| 21 | reldmress 17415 | . . . . 5 ⊢ Rel dom ↾s | |
| 22 | 21 | ovprc1 7459 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝑊 ↾s 𝑆) = ∅) |
| 23 | 22 | adantr 486 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = ∅) |
| 24 | fv2prc 6927 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 25 | 12, 24 | sylan9eqr 2817 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 26 | 25 | fveq2d 6889 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (Scalar‘𝐴) = (Scalar‘∅)) |
| 27 | 20, 23, 26 | 3eqtr4a 2821 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| 28 | 19, 27 | pm2.61ian 824 | 1 ⊢ (𝜑 → (𝑊 ↾s 𝑆) = (Scalar‘𝐴)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 Vcvv 3450 ⊆ wss 3895 ∅c0 4278 〈cop 4834 ‘cfv 6538 (class class class)co 7420 sSet csts 17346 ndxcnx 17376 Basecbs 17392 ↾s cress 17413 .rcmulr 17434 Scalarcsca 17436 ·𝑠 cvsca 17437 ·𝑖cip 17438 subringAlg csra 21451 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-3 12409 df-4 12410 df-5 12411 df-6 12412 df-7 12413 df-8 12414 df-sets 17347 df-slot 17365 df-ndx 17377 df-ress 17414 df-sca 17449 df-vsca 17450 df-ip 17451 df-sra 21453 |
| This theorem is used by: sralmod 21467 rlmsca 21478 rlmsca2 21479 frlmip 22089 sraassab 22181 evls1maplmhm 22700 sranlm 25008 srabn 25686 rrxprds 25715 sralvec 34263 drgext0gsca 34270 drgextlsp 34272 fedgmullem1 34307 fedgmullem2 34308 fedgmul 34309 extdg1id 34344 ccfldsrarelvec 34349 ccfldextdgrr 34350 fldextrspunlsplem 34351 fldextrspunlsp 34352 fldextrspunlem1 34353 fldextrspunfld 34354 extdgfialglem1 34370 |
| Copyright terms: Public domain | W3C validator |