| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmlem | Structured version Visualization version GIF version | ||
| Description: Lemma for zlmbas 21731 and zlmplusg 21732. (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 17304 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) |
| 4 | zlmlem.4 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) | |
| 5 | 1, 4 | setsnid 17304 | . . . 4 ⊢ (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 6 | 3, 5 | eqtri 2785 | . . 3 ⊢ (𝐸‘𝐺) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 7 | zlmbas.w | . . . . 5 ⊢ 𝑊 = (ℤMod‘𝐺) | |
| 8 | eqid 2762 | . . . . 5 ⊢ (.g‘𝐺) = (.g‘𝐺) | |
| 9 | 7, 8 | zlmval 21729 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 10 | 9 | fveq2d 6886 | . . 3 ⊢ (𝐺 ∈ V → (𝐸‘𝑊) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉))) |
| 11 | 6, 10 | eqtr4id 2816 | . 2 ⊢ (𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 12 | 1 | str0 17285 | . . . 4 ⊢ ∅ = (𝐸‘∅) |
| 13 | 12 | eqcomi 2771 | . . 3 ⊢ (𝐸‘∅) = ∅ |
| 14 | 13, 7 | fveqprc 17287 | . 2 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 15 | 11, 14 | pm2.61i 184 | 1 ⊢ (𝐸‘𝐺) = (𝐸‘𝑊) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 ≠ wne 2957 Vcvv 3453 ∅c0 4282 〈cop 4593 ‘cfv 6537 (class class class)co 7416 sSet csts 17259 Slot cslot 17277 ndxcnx 17289 Scalarcsca 17349 ·𝑠 cvsca 17350 .gcmg 19191 ℤringczring 21660 ℤModczlm 21714 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 ax-un 7739 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-res 5671 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7419 df-oprab 7420 df-mpo 7421 df-sets 17260 df-slot 17278 df-zlm 21718 |
| This theorem is used by: zlmbas 21731 zlmplusg 21732 zlmmulr 21733 |
| Copyright terms: Public domain | W3C validator |