| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmlem | Structured version Visualization version GIF version | ||
| Description: Lemma for zlmbas 21497 and zlmplusg 21498. (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 17178 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) |
| 4 | zlmlem.4 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) | |
| 5 | 1, 4 | setsnid 17178 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 6 | 3, 5 | eqtri 2759 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 7 | zlmbas.w | . . . . 5 ⊢ 𝑊 = (ℤMod‘𝐺) | |
| 8 | eqid 2736 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 9 | 7, 8 | zlmval 21495 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 10 | 9 | fveq2d 6844 | . . 3 ⊢ (𝐺 ∈ V → (𝐸‘𝑊) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉))) |
| 11 | 6, 10 | eqtr4id 2790 | . 2 ⊢ (𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 12 | 1 | str0 17159 | . . . 4 ⊢ ∅ = (𝐸‘∅) |
| 13 | 12 | eqcomi 2745 | . . 3 ⊢ (𝐸‘∅) = ∅ |
| 14 | 13, 7 | fveqprc 17161 | . 2 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 15 | 11, 14 | pm2.61i 182 | 1 ⊢ (𝐸‘𝐺) = (𝐸‘𝑊) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 ≠ wne 2932 Vcvv 3429 ∅c0 4273 〈cop 4573 ‘cfv 6498 (class class class)co 7367 sSet csts 17133 Slot cslot 17151 ndxcnx 17163 Scalarcsca 17223 ·𝑠 cvsca 17224 .gcmg 19043 ℤringczring 21426 ℤModczlm 21480 |
| 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 2708 ax-sep 5231 ax-nul 5241 ax-pr 5375 ax-un 7689 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-res 5643 df-iota 6454 df-fun 6500 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-sets 17134 df-slot 17152 df-zlm 21484 |
| This theorem is referenced by: zlmbas 21497 zlmplusg 21498 zlmmulr 21499 |
| Copyright terms: Public domain | W3C validator |