| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sralem | Structured version Visualization version GIF version | ||
| Description: Lemma for srabase 21113 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 2983 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx) |
| 4 | 1, 3 | setsnid 17121 | . . . 4 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) |
| 5 | sralem.3 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) | |
| 6 | 5 | necomi 2983 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) |
| 7 | 1, 6 | setsnid 17121 | . . . 4 ⊢ (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 8 | sralem.4 | . . . . . 6 ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) | |
| 9 | 8 | necomi 2983 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
| 10 | 1, 9 | setsnid 17121 | . . . 4 ⊢ (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 11 | 4, 7, 10 | 3eqtri 2760 | . . 3 ⊢ (𝐸‘𝑊) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 12 | srapart.a | . . . . . 6 ⊢ (𝜑 → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) | |
| 13 | 12 | adantl 481 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆)) |
| 14 | srapart.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝑊)) | |
| 15 | sraval 21111 | . . . . . 6 ⊢ ((𝑊 ∈ V ∧ 𝑆 ⊆ (Base‘𝑊)) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) | |
| 16 | 14, 15 | sylan2 593 | . . . . 5 ⊢ ((𝑊 ∈ V ∧ 𝜑) → ((subringAlg ‘𝑊)‘𝑆) = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 17 | 13, 16 | eqtrd 2768 | . . . 4 ⊢ ((𝑊 ∈ V ∧ 𝜑) → 𝐴 = (((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 18 | 17 | fveq2d 6832 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 19 | 11, 18 | eqtr4id 2787 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 20 | 1 | str0 17102 | . . 3 ⊢ ∅ = (𝐸‘∅) |
| 21 | fvprc 6820 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅) | |
| 22 | 21 | adantr 480 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅) |
| 23 | fv2prc 6870 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 24 | 12, 23 | sylan9eqr 2790 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 25 | 24 | fveq2d 6832 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅)) |
| 26 | 20, 22, 25 | 3eqtr4a 2794 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 27 | 19, 26 | pm2.61ian 811 | 1 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2929 Vcvv 3437 ⊆ wss 3898 ∅c0 4282 〈cop 4581 ‘cfv 6486 (class class class)co 7352 sSet csts 17076 Slot cslot 17094 ndxcnx 17106 Basecbs 17122 ↾s cress 17143 .rcmulr 17164 Scalarcsca 17166 ·𝑠 cvsca 17167 ·𝑖cip 17168 subringAlg csra 21107 |
| 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 2182 ax-ext 2705 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-ov 7355 df-oprab 7356 df-mpo 7357 df-sets 17077 df-slot 17095 df-sra 21109 |
| This theorem is referenced by: srabase 21113 sraaddg 21114 sramulr 21115 sratset 21119 srads 21121 cchhllem 28866 |
| Copyright terms: Public domain | W3C validator |