| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmlem | Structured version Visualization version GIF version | ||
| Description: Lemma for zlmbas 21571 and zlmplusg 21572. (Contributed by Mario Carneiro, 2-Oct-2015.) (Revised by AV, 3-Nov-2024.) |
| Ref | Expression |
|---|---|
| zlmbas.w | ⊢ 𝑊 = (ℤMod‘𝐺) |
| zlmlem.2 | ⊢ 𝐸 = Slot (𝐸‘ndx) |
| zlmlem.3 | ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx) |
| zlmlem.4 | ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) |
| Ref | Expression |
|---|---|
| zlmlem | ⊢ (𝐸‘𝐺) = (𝐸‘𝑊) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zlmlem.2 | . . . . 5 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
| 2 | zlmlem.3 | . . . . 5 ⊢ (𝐸‘ndx) ≠ (Scalar‘ndx) | |
| 3 | 1, 2 | setsnid 17246 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) |
| 4 | zlmlem.4 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) | |
| 5 | 1, 4 | setsnid 17246 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 6 | 3, 5 | eqtri 2787 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 7 | zlmbas.w | . . . . 5 ⊢ 𝑊 = (ℤMod‘𝐺) | |
| 8 | eqid 2764 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 9 | 7, 8 | zlmval 21569 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 10 | 9 | fveq2d 6873 | . . 3 ⊢ (𝐺 ∈ V → (𝐸‘𝑊) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉))) |
| 11 | 6, 10 | eqtr4id 2818 | . 2 ⊢ (𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 12 | 1 | str0 17227 | . . . 4 ⊢ ∅ = (𝐸‘∅) |
| 13 | 12 | eqcomi 2773 | . . 3 ⊢ (𝐸‘∅) = ∅ |
| 14 | 13, 7 | fveqprc 17229 | . 2 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 15 | 11, 14 | pm2.61i 183 | 1 ⊢ (𝐸‘𝐺) = (𝐸‘𝑊) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1562 ∈ wcel 2144 ≠ wne 2959 Vcvv 3456 ∅c0 4287 〈cop 4590 ‘cfv 6523 (class class class)co 7398 sSet csts 17201 Slot cslot 17219 ndxcnx 17231 Scalarcsca 17291 ·𝑠 cvsca 17292 .gcmg 19111 ℤringczring 21500 ℤModczlm 21554 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-res 5661 df-iota 6479 df-fun 6525 df-fv 6531 df-ov 7401 df-oprab 7402 df-mpo 7403 df-sets 17202 df-slot 17220 df-zlm 21558 |
| This theorem is referenced by: zlmbas 21571 zlmplusg 21572 zlmmulr 21573 |
| Copyright terms: Public domain | W3C validator |