| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmlem | Structured version Visualization version GIF version | ||
| Description: Lemma for zlmbas 21511 and zlmplusg 21512. (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 17173 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) |
| 4 | zlmlem.4 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) | |
| 5 | 1, 4 | setsnid 17173 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 6 | 3, 5 | eqtri 2760 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 7 | zlmbas.w | . . . . 5 ⊢ 𝑊 = (ℤMod‘𝐺) | |
| 8 | eqid 2737 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 9 | 7, 8 | zlmval 21509 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 10 | 9 | fveq2d 6840 | . . 3 ⊢ (𝐺 ∈ V → (𝐸‘𝑊) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉))) |
| 11 | 6, 10 | eqtr4id 2791 | . 2 ⊢ (𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 12 | 1 | str0 17154 | . . . 4 ⊢ ∅ = (𝐸‘∅) |
| 13 | 12 | eqcomi 2746 | . . 3 ⊢ (𝐸‘∅) = ∅ |
| 14 | 13, 7 | fveqprc 17156 | . 2 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 15 | 11, 14 | pm2.61i 182 | 1 ⊢ (𝐸‘𝐺) = (𝐸‘𝑊) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 ≠ wne 2933 Vcvv 3430 ∅c0 4274 〈cop 4574 ‘cfv 6494 (class class class)co 7362 sSet csts 17128 Slot cslot 17146 ndxcnx 17158 Scalarcsca 17218 ·𝑠 cvsca 17219 .gcmg 19038 ℤringczring 21440 ℤModczlm 21494 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5372 ax-un 7684 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-sbc 3730 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5521 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-res 5638 df-iota 6450 df-fun 6496 df-fv 6502 df-ov 7365 df-oprab 7366 df-mpo 7367 df-sets 17129 df-slot 17147 df-zlm 21498 |
| This theorem is referenced by: zlmbas 21511 zlmplusg 21512 zlmmulr 21513 |
| Copyright terms: Public domain | W3C validator |