| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sralem | Structured version Visualization version GIF version | ||
| Description: Lemma for srabase 21457 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 3009 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx) |
| 4 | 1, 3 | setsnid 17391 | . . . 4 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) |
| 5 | sralem.3 | . . . . . 6 ⊢ ( ·𝑠 ‘ndx) ≠ (𝐸‘ndx) | |
| 6 | 5 | necomi 3009 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) |
| 7 | 1, 6 | setsnid 17391 | . . . 4 ⊢ (𝐸‘(𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉)) = (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) |
| 8 | sralem.4 | . . . . . 6 ⊢ (·𝑖‘ndx) ≠ (𝐸‘ndx) | |
| 9 | 8 | necomi 3009 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (·𝑖‘ndx) |
| 10 | 1, 9 | setsnid 17391 | . . . 4 ⊢ (𝐸‘((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉)) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 11 | 4, 7, 10 | 3eqtri 2787 | . . 3 ⊢ (𝐸‘𝑊) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉)) |
| 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 ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘(((𝑊 sSet 〈(Scalar‘ndx), (𝑊 ↾s 𝑆)〉) sSet 〈( ·𝑠 ‘ndx), (.r‘𝑊)〉) sSet 〈(·𝑖‘ndx), (.r‘𝑊)〉))) |
| 19 | 11, 18 | eqtr4id 2814 | . 2 ⊢ ((𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 20 | 1 | str0 17372 | . . 3 ⊢ ∅ = (𝐸‘∅) |
| 21 | fvprc 6877 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅) | |
| 22 | 21 | adantr 486 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = ∅) |
| 23 | fv2prc 6927 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → ((subringAlg ‘𝑊)‘𝑆) = ∅) | |
| 24 | 12, 23 | sylan9eqr 2817 | . . . 4 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → 𝐴 = ∅) |
| 25 | 24 | fveq2d 6889 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝐴) = (𝐸‘∅)) |
| 26 | 20, 22, 25 | 3eqtr4a 2821 | . 2 ⊢ ((¬ 𝑊 ∈ V ∧ 𝜑) → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 27 | 19, 26 | pm2.61ian 824 | 1 ⊢ (𝜑 → (𝐸‘𝑊) = (𝐸‘𝐴)) |
| 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 Slot cslot 17364 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 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 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-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 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-id 5545 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-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7423 df-oprab 7424 df-mpo 7425 df-sets 17347 df-slot 17365 df-sra 21453 |
| This theorem is used by: srabase 21457 sraaddg 21458 sramulr 21459 sratset 21463 srads 21465 cchhllem 29469 |
| Copyright terms: Public domain | W3C validator |