| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sralem | Structured version Visualization version GIF version | ||
| Description: Lemma for srabase 21224 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 3010 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx) |
| 4 | 1, 3 | setsnid 17227 | . . . 4 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) |
| 5 | sralem.3 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) | |
| 6 | 5 | necomi 3010 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) |
| 7 | 1, 6 | setsnid 17227 | . . . 4 ⊢ (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 8 | sralem.4 | . . . . . 6 ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) | |
| 9 | 8 | necomi 3010 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
| 10 | 1, 9 | setsnid 17227 | . . . 4 ⊢ (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 11 | 4, 7, 10 | 3eqtri 2788 | . . 3 ⊢ (𝐸‘𝑊) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 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 ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 19 | 11, 18 | eqtr4id 2815 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 20 | 1 | str0 17208 | . . 3 ⊢ ∅ = (𝐸‘∅) |
| 21 | fvprc 6855 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅) | |
| 22 | 21 | adantr 484 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅) |
| 23 | fv2prc 6905 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 24 | 12, 23 | sylan9eqr 2818 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 25 | 24 | fveq2d 6867 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅)) |
| 26 | 20, 22, 25 | 3eqtr4a 2822 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 27 | 19, 26 | pm2.61ian 821 | 1 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 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 Slot cslot 17200 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 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 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-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-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-id 5540 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-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-sets 17183 df-slot 17201 df-sra 21220 |
| This theorem is referenced by: srabase 21224 sraaddg 21225 sramulr 21226 sratset 21230 srads 21232 cchhllem 29033 |
| Copyright terms: Public domain | W3C validator |