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 33562

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 33561	. 2 ⊢ (𝜑 → (𝐼SymPoly𝑅) = (𝑀FixPts𝐴))
8		eqid 2729	. . 3 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) = (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓))
9	1, 2, 3, 4, 5	mplvrpmga 33556	. . 3 ⊢ (𝜑 → 𝐴 ∈ (𝑆 GrpAct 𝑀))
10		coeq2 5801	. . . . . . . 8 ⊢ (𝑑 = 𝑒 → (𝑥 ∘ 𝑑) = (𝑥 ∘ 𝑒))
11	10	fveq2d 6826	. . . . . . 7 ⊢ (𝑑 = 𝑒 → (𝑓‘(𝑥 ∘ 𝑑)) = (𝑓‘(𝑥 ∘ 𝑒)))
12	11	mpteq2dv 5186	. . . . . 6 ⊢ (𝑑 = 𝑒 → (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑))) = (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑒))))
13		fveq1 6821	. . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝑓‘(𝑥 ∘ 𝑒)) = (𝑔‘(𝑥 ∘ 𝑒)))
14	13	mpteq2dv 5186	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑒))) = (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
15	12, 14	cbvmpov 7444	. . . . 5 ⊢ (𝑑 ∈ 𝑃, 𝑓 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑)))) = (𝑒 ∈ 𝑃, 𝑔 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
16	4, 15	eqtri 2752	. . . 4 ⊢ 𝐴 = (𝑒 ∈ 𝑃, 𝑔 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
17	5	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝐼 ∈ 𝑉)
18		oveq2 7357	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑑𝐴𝑓) = (𝑑𝐴𝑔))
19	18	cbvmptv 5196	. . . 4 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) = (𝑔 ∈ 𝑀 ↦ (𝑑𝐴𝑔))
20		eqid 2729	. . . 4 ⊢ (𝐼 mPoly 𝑅) = (𝐼 mPoly 𝑅)
21	6	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝑅 ∈ Ring)
22		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝑑 ∈ 𝑃)
23	1, 2, 3, 16, 17, 19, 20, 21, 22	mplvrpmrhm 33558	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) ∈ ((𝐼 mPoly 𝑅) RingHom (𝐼 mPoly 𝑅)))
24	2, 3, 8, 9, 23	fxpsubrg 33125	. 2 ⊢ (𝜑 → (𝑀FixPts𝐴) ∈ (SubRing‘(𝐼 mPoly 𝑅)))
25	7, 24	eqeltrd 2828	1 ⊢ (𝜑 → (𝐼SymPoly𝑅) ∈ (SubRing‘(𝐼 mPoly 𝑅)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 {crab 3394 class class class wbr 5092 ↦ cmpt 5173 ∘ ccom 5623 ‘cfv 6482 (class class class)co 7349 ∈ cmpo 7351 ↑_m cmap 8753 finSupp cfsupp 9251 0cc0 11009 ℕ₀cn0 12384 Basecbs 17120 SymGrpcsymg 19248 Ringcrg 20118 SubRingcsubrg 20454 mPoly cmpl 21813 FixPtscfxp 33114 SymPolycsply 33559

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-iin 4944 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-isom 6491 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-of 7613 df-ofr 7614 df-om 7800 df-1st 7924 df-2nd 7925 df-supp 8094 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-2o 8389 df-er 8625 df-map 8755 df-pm 8756 df-ixp 8825 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-fsupp 9252 df-sup 9332 df-oi 9402 df-card 9835 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-3 12192 df-4 12193 df-5 12194 df-6 12195 df-7 12196 df-8 12197 df-9 12198 df-n0 12385 df-z 12472 df-dec 12592 df-uz 12736 df-fz 13411 df-fzo 13558 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 18514 df-sgrp 18593 df-mnd 18609 df-mhm 18657 df-submnd 18658 df-efmnd 18743 df-grp 18815 df-minusg 18816 df-mulg 18947 df-subg 19002 df-ghm 19092 df-ga 19169 df-cntz 19196 df-symg 19249 df-cmn 19661 df-abl 19662 df-mgp 20026 df-rng 20038 df-ur 20067 df-ring 20120 df-rhm 20357 df-subrng 20431 df-subrg 20455 df-psr 21816 df-mpl 21818 df-fxp 33115 df-sply 33560

This theorem is referenced by: (None)

W3C validator