| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sralem | Structured version Visualization version GIF version | ||
| Description: Lemma for srabase 21174 and similar theorems. (Contributed by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Revised by AV, 29-Oct-2024.) |
| Ref | Expression |
|---|---|
| srapart.a | ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
| srapart.s | ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) |
| sralem.1 | ⊢ 𝐸 = Slot (𝐸‘ndx) |
| sralem.2 | ⊢ (Scalar‘ndx) ≠ (𝐸‘ndx) |
| sralem.3 | ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) |
| sralem.4 | ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) |
| Ref | Expression |
|---|---|
| sralem | ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sralem.1 | . . . . 5 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
| 2 | sralem.2 | . . . . . 6 ⊢ (Scalar‘ndx) ≠ (𝐸‘ndx) | |
| 3 | 2 | necomi 2989 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx) |
| 4 | 1, 3 | setsnid 17176 | . . . 4 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) |
| 5 | sralem.3 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) | |
| 6 | 5 | necomi 2989 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) |
| 7 | 1, 6 | setsnid 17176 | . . . 4 ⊢ (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 8 | sralem.4 | . . . . . 6 ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) | |
| 9 | 8 | necomi 2989 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
| 10 | 1, 9 | setsnid 17176 | . . . 4 ⊢ (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 11 | 4, 7, 10 | 3eqtri 2767 | . . 3 ⊢ (𝐸‘𝑊) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 12 | srapart.a | . . . . . 6 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) | |
| 13 | 12 | adantl 482 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
| 14 | srapart.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) | |
| 15 | sraval 21172 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
| 16 | 14, 15 | sylan2 599 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 17 | 13, 16 | eqtrd 2775 | . . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 18 | 17 | fveq2d 6838 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 19 | 11, 18 | eqtr4id 2794 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 20 | 1 | str0 17157 | . . 3 ⊢ ∅ = (𝐸‘∅) |
| 21 | fvprc 6826 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅) | |
| 22 | 21 | adantr 481 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅) |
| 23 | fv2prc 6876 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 24 | 12, 23 | sylan9eqr 2797 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 25 | 24 | fveq2d 6838 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅)) |
| 26 | 20, 22, 25 | 3eqtr4a 2801 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 27 | 19, 26 | pm2.61ian 817 | 1 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 Vcvv 3432 ⊆ wss 3890 ∅c0 4268 〈cop 4568 ‘cfv 6492 (class class class)co 7363 sSet csts 17131 Slot cslot 17149 ndxcnx 17161 Basecbs 17177 ↾s cress 17198 .rcmulr 17219 Scalarcsca 17221 ·𝑠 cvsca 17222 ·𝑖cip 17223 subringAlg csra 21168 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 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-ov 7366 df-oprab 7367 df-mpo 7368 df-sets 17132 df-slot 17150 df-sra 21170 |
| This theorem is referenced by: srabase 21174 sraaddg 21175 sramulr 21176 sratset 21180 srads 21182 cchhllem 28980 |
| Copyright terms: Public domain | W3C validator |