| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mplnegfi | GIF version | ||
| Description: The negative function on multivariate polynomials. (Contributed by SN, 25-May-2024.) |
| Ref | Expression |
|---|---|
| mplneg.p | ⊢ 𝑃 = (𝐼 mPoly 𝑅) |
| mplneg.b | ⊢ 𝐵 = (Base‘𝑃) |
| mplneg.n | ⊢ 𝑁 = (invg‘𝑅) |
| mplneg.m | ⊢ 𝑀 = (invg‘𝑃) |
| mplnegfi.i | ⊢ (𝜑 → 𝐼 ∈ Fin) |
| mplneg.r | ⊢ (𝜑 → 𝑅 ∈ Grp) |
| mplneg.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| mplnegfi | ⊢ (𝜑 → (𝑀‘𝑋) = (𝑁 ∘ 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mplneg.m | . . . 4 ⊢ 𝑀 = (invg‘𝑃) | |
| 2 | 1 | fveq1i 5604 | . . 3 ⊢ (𝑀‘𝑋) = ((invg‘𝑃)‘𝑋) |
| 3 | mplnegfi.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ Fin) | |
| 4 | mplneg.r | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ Grp) | |
| 5 | mplneg.p | . . . . . . 7 ⊢ 𝑃 = (𝐼 mPoly 𝑅) | |
| 6 | eqid 2209 | . . . . . . 7 ⊢ (𝐼 mPwSer 𝑅) = (𝐼 mPwSer 𝑅) | |
| 7 | mplneg.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑃) | |
| 8 | 5, 6, 7 | mplval2g 14624 | . . . . . 6 ⊢ ((𝐼 ∈ Fin ∧ 𝑅 ∈ Grp) → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s 𝐵)) |
| 9 | 3, 4, 8 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → 𝑃 = ((𝐼 mPwSer 𝑅) ↾s 𝐵)) |
| 10 | 9 | fveq2d 5607 | . . . 4 ⊢ (𝜑 → (invg‘𝑃) = (invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵))) |
| 11 | 10 | fveq1d 5605 | . . 3 ⊢ (𝜑 → ((invg‘𝑃)‘𝑋) = ((invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵))‘𝑋)) |
| 12 | 2, 11 | eqtrid 2254 | . 2 ⊢ (𝜑 → (𝑀‘𝑋) = ((invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵))‘𝑋)) |
| 13 | 6, 5, 7, 3, 4 | mplsubgfi 14630 | . . 3 ⊢ (𝜑 → 𝐵 ∈ (SubGrp‘(𝐼 mPwSer 𝑅))) |
| 14 | mplneg.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 15 | eqid 2209 | . . . 4 ⊢ ((𝐼 mPwSer 𝑅) ↾s 𝐵) = ((𝐼 mPwSer 𝑅) ↾s 𝐵) | |
| 16 | eqid 2209 | . . . 4 ⊢ (invg‘(𝐼 mPwSer 𝑅)) = (invg‘(𝐼 mPwSer 𝑅)) | |
| 17 | eqid 2209 | . . . 4 ⊢ (invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵)) = (invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵)) | |
| 18 | 15, 16, 17 | subginv 13684 | . . 3 ⊢ ((𝐵 ∈ (SubGrp‘(𝐼 mPwSer 𝑅)) ∧ 𝑋 ∈ 𝐵) → ((invg‘(𝐼 mPwSer 𝑅))‘𝑋) = ((invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵))‘𝑋)) |
| 19 | 13, 14, 18 | syl2anc 411 | . 2 ⊢ (𝜑 → ((invg‘(𝐼 mPwSer 𝑅))‘𝑋) = ((invg‘((𝐼 mPwSer 𝑅) ↾s 𝐵))‘𝑋)) |
| 20 | eqid 2209 | . . 3 ⊢ {𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} = {𝑥 ∈ (ℕ0 ↑𝑚 𝐼) ∣ (◡𝑥 “ ℕ) ∈ Fin} | |
| 21 | mplneg.n | . . 3 ⊢ 𝑁 = (invg‘𝑅) | |
| 22 | eqid 2209 | . . 3 ⊢ (Base‘(𝐼 mPwSer 𝑅)) = (Base‘(𝐼 mPwSer 𝑅)) | |
| 23 | 5, 6, 7, 22 | mplbasss 14625 | . . . 4 ⊢ 𝐵 ⊆ (Base‘(𝐼 mPwSer 𝑅)) |
| 24 | 23, 14 | sselid 3202 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (Base‘(𝐼 mPwSer 𝑅))) |
| 25 | 6, 3, 4, 20, 21, 22, 16, 24 | psrneg 14616 | . 2 ⊢ (𝜑 → ((invg‘(𝐼 mPwSer 𝑅))‘𝑋) = (𝑁 ∘ 𝑋)) |
| 26 | 12, 19, 25 | 3eqtr2d 2248 | 1 ⊢ (𝜑 → (𝑀‘𝑋) = (𝑁 ∘ 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1375 ∈ wcel 2180 {crab 2492 ◡ccnv 4695 “ cima 4699 ∘ ccom 4700 ‘cfv 5294 (class class class)co 5974 ↑𝑚 cmap 6765 Fincfn 6857 ℕcn 9078 ℕ0cn0 9337 Basecbs 12998 ↾s cress 12999 Grpcgrp 13499 invgcminusg 13500 SubGrpcsubg 13670 mPwSer cmps 14590 mPoly cmpl 14591 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-nul 4189 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-iinf 4657 ax-cnex 8058 ax-resscn 8059 ax-1cn 8060 ax-1re 8061 ax-icn 8062 ax-addcl 8063 ax-addrcl 8064 ax-mulcl 8065 ax-addcom 8067 ax-mulcom 8068 ax-addass 8069 ax-mulass 8070 ax-distr 8071 ax-i2m1 8072 ax-0lt1 8073 ax-1rid 8074 ax-0id 8075 ax-rnegex 8076 ax-cnre 8078 ax-pre-ltirr 8079 ax-pre-ltwlin 8080 ax-pre-lttrn 8081 ax-pre-apti 8082 ax-pre-ltadd 8083 |
| This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-nel 2476 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-if 3583 df-pw 3631 df-sn 3652 df-pr 3653 df-tp 3654 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-tr 4162 df-id 4361 df-iord 4434 df-on 4436 df-suc 4439 df-iom 4660 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-riota 5927 df-ov 5977 df-oprab 5978 df-mpo 5979 df-of 6188 df-1st 6256 df-2nd 6257 df-1o 6532 df-er 6650 df-map 6767 df-ixp 6816 df-en 6858 df-fin 6860 df-sup 7119 df-pnf 8151 df-mnf 8152 df-xr 8153 df-ltxr 8154 df-le 8155 df-sub 8287 df-neg 8288 df-inn 9079 df-2 9137 df-3 9138 df-4 9139 df-5 9140 df-6 9141 df-7 9142 df-8 9143 df-9 9144 df-n0 9338 df-z 9415 df-dec 9547 df-uz 9691 df-fz 10173 df-struct 13000 df-ndx 13001 df-slot 13002 df-base 13004 df-sets 13005 df-iress 13006 df-plusg 13089 df-mulr 13090 df-sca 13092 df-vsca 13093 df-ip 13094 df-tset 13095 df-ple 13096 df-ds 13098 df-hom 13100 df-cco 13101 df-rest 13240 df-topn 13241 df-0g 13257 df-topgen 13259 df-pt 13260 df-prds 13266 df-pws 13289 df-mgm 13355 df-sgrp 13401 df-mnd 13416 df-grp 13502 df-minusg 13503 df-subg 13673 df-psr 14592 df-mplcoe 14593 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |