splysubrg - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > splysubrg		Structured version Visualization version GIF version

Theorem splysubrg 33583

Description: The symmetric polynomials form a subring of the ring of polynomials. (Contributed by Thierry Arnoux, 15-Jan-2026.)

**Hypotheses**
Ref	Expression
splyval.s	⊢ 𝑆 = (SymGrp‘𝐼)
splyval.p	⊢ 𝑃 = (Base‘𝑆)
splyval.m	⊢ 𝑀 = (Base‘(𝐼 mPoly 𝑅))
splyval.a	⊢ 𝐴 = (𝑑 ∈ 𝑃, 𝑓 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑))))
splyval.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
splysubrg.r	⊢ (𝜑 → 𝑅 ∈ Ring)

**Assertion**
Ref	Expression
splysubrg	⊢ (𝜑 → (𝐼SymPoly𝑅) ∈ (SubRing‘(𝐼 mPoly 𝑅)))

Distinct variable groups: 𝐴,𝑑,𝑓,𝑥 𝐼,𝑑,𝑓,ℎ,𝑥 𝑀,𝑑,𝑓,𝑥 𝑃,𝑑,𝑓,𝑥 𝑅,𝑑,𝑓,𝑥,ℎ 𝑆,𝑑,𝑓 𝑥,𝑉 𝜑,𝑑,𝑓,𝑥 Allowed substitution hints: 𝜑(ℎ) 𝐴(ℎ) 𝑃(ℎ) 𝑆(𝑥,ℎ) 𝑀(ℎ) 𝑉(𝑓,ℎ,𝑑)

Proof of Theorem splysubrg Dummy variables 𝑒 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		splyval.s	. . 3 ⊢ 𝑆 = (SymGrp‘𝐼)
2		splyval.p	. . 3 ⊢ 𝑃 = (Base‘𝑆)
3		splyval.m	. . 3 ⊢ 𝑀 = (Base‘(𝐼 mPoly 𝑅))
4		splyval.a	. . 3 ⊢ 𝐴 = (𝑑 ∈ 𝑃, 𝑓 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑))))
5		splyval.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
6		splysubrg.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Ring)
7	1, 2, 3, 4, 5, 6	splyval 33582	. 2 ⊢ (𝜑 → (𝐼SymPoly𝑅) = (𝑀FixPts𝐴))
8		eqid 2731	. . 3 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) = (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓))
9	1, 2, 3, 4, 5	mplvrpmga 33575	. . 3 ⊢ (𝜑 → 𝐴 ∈ (𝑆 GrpAct 𝑀))
10		coeq2 5797	. . . . . . . 8 ⊢ (𝑑 = 𝑒 → (𝑥 ∘ 𝑑) = (𝑥 ∘ 𝑒))
11	10	fveq2d 6826	. . . . . . 7 ⊢ (𝑑 = 𝑒 → (𝑓‘(𝑥 ∘ 𝑑)) = (𝑓‘(𝑥 ∘ 𝑒)))
12	11	mpteq2dv 5183	. . . . . 6 ⊢ (𝑑 = 𝑒 → (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑))) = (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑒))))
13		fveq1 6821	. . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝑓‘(𝑥 ∘ 𝑒)) = (𝑔‘(𝑥 ∘ 𝑒)))
14	13	mpteq2dv 5183	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑒))) = (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
15	12, 14	cbvmpov 7441	. . . . 5 ⊢ (𝑑 ∈ 𝑃, 𝑓 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑)))) = (𝑒 ∈ 𝑃, 𝑔 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
16	4, 15	eqtri 2754	. . . 4 ⊢ 𝐴 = (𝑒 ∈ 𝑃, 𝑔 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
17	5	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝐼 ∈ 𝑉)
18		oveq2 7354	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑑𝐴𝑓) = (𝑑𝐴𝑔))
19	18	cbvmptv 5193	. . . 4 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) = (𝑔 ∈ 𝑀 ↦ (𝑑𝐴𝑔))
20		eqid 2731	. . . 4 ⊢ (𝐼 mPoly 𝑅) = (𝐼 mPoly 𝑅)
21	6	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝑅 ∈ Ring)
22		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝑑 ∈ 𝑃)
23	1, 2, 3, 16, 17, 19, 20, 21, 22	mplvrpmrhm 33577	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) ∈ ((𝐼 mPoly 𝑅) RingHom (𝐼 mPoly 𝑅)))
24	2, 3, 8, 9, 23	fxpsubrg 33143	. 2 ⊢ (𝜑 → (𝑀FixPts𝐴) ∈ (SubRing‘(𝐼 mPoly 𝑅)))
25	7, 24	eqeltrd 2831	1 ⊢ (𝜑 → (𝐼SymPoly𝑅) ∈ (SubRing‘(𝐼 mPoly 𝑅)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 {crab 3395 class class class wbr 5089 ↦ cmpt 5170 ∘ ccom 5618 ‘cfv 6481 (class class class)co 7346 ∈ cmpo 7348 ↑_m cmap 8750 finSupp cfsupp 9245 0cc0 11006 ℕ₀cn0 12381 Basecbs 17120 SymGrpcsymg 19281 Ringcrg 20151 SubRingcsubrg 20484 mPoly cmpl 21843 FixPtscfxp 33132 SymPolycsply 33578

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-tp 4578 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-of 7610 df-ofr 7611 df-om 7797 df-1st 7921 df-2nd 7922 df-supp 8091 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-map 8752 df-pm 8753 df-ixp 8822 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-fsupp 9246 df-sup 9326 df-oi 9396 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-nn 12126 df-2 12188 df-3 12189 df-4 12190 df-5 12191 df-6 12192 df-7 12193 df-8 12194 df-9 12195 df-n0 12382 df-z 12469 df-dec 12589 df-uz 12733 df-fz 13408 df-fzo 13555 df-seq 13909 df-hash 14238 df-struct 17058 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-mulr 17175 df-sca 17177 df-vsca 17178 df-ip 17179 df-tset 17180 df-ple 17181 df-ds 17183 df-hom 17185 df-cco 17186 df-0g 17345 df-gsum 17346 df-prds 17351 df-pws 17353 df-mre 17488 df-mrc 17489 df-acs 17491 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-mhm 18691 df-submnd 18692 df-efmnd 18777 df-grp 18849 df-minusg 18850 df-mulg 18981 df-subg 19036 df-ghm 19125 df-ga 19202 df-cntz 19229 df-symg 19282 df-cmn 19694 df-abl 19695 df-mgp 20059 df-rng 20071 df-ur 20100 df-ring 20153 df-rhm 20390 df-subrng 20461 df-subrg 20485 df-psr 21846 df-mpl 21848 df-fxp 33133 df-sply 33580

This theorem is referenced by: (None)

W3C validator