| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rlmval2 | Structured version Visualization version GIF version | ||
| Description: Value of the ring module extended. (Contributed by AV, 2-Dec-2018.) (Revised by Thierry Arnoux, 16-Jun-2019.) |
| Ref | Expression |
|---|---|
| rlmval2 | ⊢ (𝑊 ∈ 𝑋 → (ringLMod‘𝑊) = (((𝑊 sSet 〈(Scalar‘ndx), 𝑊〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rlmval 21517 | . . 3 ⊢ (ringLMod‘𝑊) = ((subringAlg ‘𝑊)‘(Base‘𝑊)) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (𝑊 ∈ 𝑋 → (ringLMod‘𝑊) = ((subringAlg ‘𝑊)‘(Base‘𝑊))) |
| 3 | ssid 3935 | . . 3 ⊢ (Base‘𝑊) ⊆ (Base‘𝑊) | |
| 4 | sraval 21501 | . . 3 ⊢ ((𝑊 ∈ 𝑋 ∧ (Base‘𝑊) ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘(Base‘𝑊)) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s (Base‘𝑊))〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
| 5 | 3, 4 | mpan2 704 | . 2 ⊢ (𝑊 ∈ 𝑋 → ((subringAlg ‘𝑊)‘(Base‘𝑊)) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s (Base‘𝑊))〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 6 | eqid 2763 | . . . . . . 7 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 7 | 6 | ressid 17466 | . . . . . 6 ⊢ (𝑊 ∈ 𝑋 → (𝑊 ↾s (Base‘𝑊)) = 𝑊) |
| 8 | 7 | opeq2d 4852 | . . . . 5 ⊢ (𝑊 ∈ 𝑋 → 〈(Scalar‘ndx), (𝑊 ↾s (Base‘𝑊))〉 = 〈(Scalar‘ndx), 𝑊〉) |
| 9 | 8 | oveq2d 7467 | . . . 4 ⊢ (𝑊 ∈ 𝑋 → (𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s (Base‘𝑊))〉) = (𝑊 sSet 〈(Scalar‘ndx), 𝑊〉)) |
| 10 | 9 | oveq1d 7466 | . . 3 ⊢ (𝑊 ∈ 𝑋 → ((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s (Base‘𝑊))〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) = ((𝑊 sSet 〈(Scalar‘ndx), 𝑊〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 11 | 10 | oveq1d 7466 | . 2 ⊢ (𝑊 ∈ 𝑋 → (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s (Base‘𝑊))〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉) = (((𝑊 sSet 〈(Scalar‘ndx), 𝑊〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 12 | 2, 5, 11 | 3eqtrd 2802 | 1 ⊢ (𝑊 ∈ 𝑋 → (ringLMod‘𝑊) = (((𝑊 sSet 〈(Scalar‘ndx), 𝑊〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 〈cop 4840 ‘cfv 6566 (class class class)co 7451 sSet csts 17385 ndxcnx 17415 Basecbs 17431 ↾s cress 17452 .rcmulr 17473 Scalarcsca 17475 ·𝑠 cvsca 17476 ·𝑖cip 17477 subringAlg csra 21497 ringLModcrglmod 21498 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-ress 17453 df-sra 21499 df-rgmod 21500 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |