| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zlmlem | Structured version Visualization version GIF version | ||
| Description: Lemma for zlmbas 21678 and zlmplusg 21679. (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 17274 | . . . 4 ⊢ (𝐸‘𝐺) = (𝐸‘(𝐺 sSet 〈(Scalar‘ndx), ℤring〉)) |
| 4 | zlmlem.4 | . . . . 5 ⊢ (𝐸‘ndx) ≠ ( ·𝑠 ‘ndx) | |
| 5 | 1, 4 | setsnid 17274 | . . . 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 21676 | . . . 4 ⊢ (𝐺 ∈ V → 𝑊 = ((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉)) |
| 10 | 9 | fveq2d 6885 | . . 3 ⊢ (𝐺 ∈ V → (𝐸‘𝑊) = (𝐸‘((𝐺 sSet 〈(Scalar‘ndx), ℤring〉) sSet 〈( ·𝑠 ‘ndx), (.g‘𝐺)〉))) |
| 11 | 6, 10 | eqtr4id 2816 | . 2 ⊢ (𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 12 | 1 | str0 17255 | . . . 4 ⊢ ∅ = (𝐸‘∅) |
| 13 | 12 | eqcomi 2771 | . . 3 ⊢ (𝐸‘∅) = ∅ |
| 14 | 13, 7 | fveqprc 17257 | . 2 ⊢ (¬ 𝐺 ∈ V → (𝐸‘𝐺) = (𝐸‘𝑊)) |
| 15 | 11, 14 | pm2.61i 184 | 1 ⊢ (𝐸‘𝐺) = (𝐸‘𝑊) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2142 ≠ wne 2957 Vcvv 3454 ∅c0 4285 〈cop 4594 ‘cfv 6536 (class class class)co 7412 sSet csts 17229 Slot cslot 17247 ndxcnx 17259 Scalarcsca 17319 ·𝑠 cvsca 17320 .gcmg 19139 ℤringczring 21607 ℤModczlm 21661 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 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 3416 df-v 3456 df-sbc 3744 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-res 5672 df-iota 6492 df-fun 6538 df-fv 6544 df-ov 7415 df-oprab 7416 df-mpo 7417 df-sets 17230 df-slot 17248 df-zlm 21665 |
| This theorem is used by: zlmbas 21678 zlmplusg 21679 zlmmulr 21680 |
| Copyright terms: Public domain | W3C validator |