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 33723

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 33722	. 2 ⊢ (𝜑 → (𝐼SymPoly𝑅) = (𝑀FixPts𝐴))
8		eqid 2737	. . 3 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) = (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓))
9	1, 2, 3, 4, 5	mplvrpmga 33708	. . 3 ⊢ (𝜑 → 𝐴 ∈ (𝑆 GrpAct 𝑀))
10		coeq2 5809	. . . . . . . 8 ⊢ (𝑑 = 𝑒 → (𝑥 ∘ 𝑑) = (𝑥 ∘ 𝑒))
11	10	fveq2d 6840	. . . . . . 7 ⊢ (𝑑 = 𝑒 → (𝑓‘(𝑥 ∘ 𝑑)) = (𝑓‘(𝑥 ∘ 𝑒)))
12	11	mpteq2dv 5180	. . . . . 6 ⊢ (𝑑 = 𝑒 → (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑))) = (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑒))))
13		fveq1 6835	. . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝑓‘(𝑥 ∘ 𝑒)) = (𝑔‘(𝑥 ∘ 𝑒)))
14	13	mpteq2dv 5180	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑒))) = (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
15	12, 14	cbvmpov 7457	. . . . 5 ⊢ (𝑑 ∈ 𝑃, 𝑓 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑓‘(𝑥 ∘ 𝑑)))) = (𝑒 ∈ 𝑃, 𝑔 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
16	4, 15	eqtri 2760	. . . 4 ⊢ 𝐴 = (𝑒 ∈ 𝑃, 𝑔 ∈ 𝑀 ↦ (𝑥 ∈ {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ ℎ finSupp 0} ↦ (𝑔‘(𝑥 ∘ 𝑒))))
17	5	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝐼 ∈ 𝑉)
18		oveq2 7370	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑑𝐴𝑓) = (𝑑𝐴𝑔))
19	18	cbvmptv 5190	. . . 4 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) = (𝑔 ∈ 𝑀 ↦ (𝑑𝐴𝑔))
20		eqid 2737	. . . 4 ⊢ (𝐼 mPoly 𝑅) = (𝐼 mPoly 𝑅)
21	6	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝑅 ∈ Ring)
22		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → 𝑑 ∈ 𝑃)
23	1, 2, 3, 16, 17, 19, 20, 21, 22	mplvrpmrhm 33710	. . 3 ⊢ ((𝜑 ∧ 𝑑 ∈ 𝑃) → (𝑓 ∈ 𝑀 ↦ (𝑑𝐴𝑓)) ∈ ((𝐼 mPoly 𝑅) RingHom (𝐼 mPoly 𝑅)))
24	2, 3, 8, 9, 23	fxpsubrg 33254	. 2 ⊢ (𝜑 → (𝑀FixPts𝐴) ∈ (SubRing‘(𝐼 mPoly 𝑅)))
25	7, 24	eqeltrd 2837	1 ⊢ (𝜑 → (𝐼SymPoly𝑅) ∈ (SubRing‘(𝐼 mPoly 𝑅)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3390 class class class wbr 5086 ↦ cmpt 5167 ∘ ccom 5630 ‘cfv 6494 (class class class)co 7362 ∈ cmpo 7364 ↑_m cmap 8768 finSupp cfsupp 9269 0cc0 11033 ℕ₀cn0 12432 Basecbs 17174 SymGrpcsymg 19339 Ringcrg 20209 SubRingcsubrg 20541 mPoly cmpl 21900 FixPtscfxp 33243 SymPolycsply 33718

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5304 ax-pr 5372 ax-un 7684 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5521 df-eprel 5526 df-po 5534 df-so 5535 df-fr 5579 df-se 5580 df-we 5581 df-xp 5632 df-rel 5633 df-cnv 5634 df-co 5635 df-dm 5636 df-rn 5637 df-res 5638 df-ima 5639 df-pred 6261 df-ord 6322 df-on 6323 df-lim 6324 df-suc 6325 df-iota 6450 df-fun 6496 df-fn 6497 df-f 6498 df-f1 6499 df-fo 6500 df-f1o 6501 df-fv 6502 df-isom 6503 df-riota 7319 df-ov 7365 df-oprab 7366 df-mpo 7367 df-of 7626 df-ofr 7627 df-om 7813 df-1st 7937 df-2nd 7938 df-supp 8106 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-1o 8400 df-2o 8401 df-er 8638 df-map 8770 df-pm 8771 df-ixp 8841 df-en 8889 df-dom 8890 df-sdom 8891 df-fin 8892 df-fsupp 9270 df-sup 9350 df-oi 9420 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-dec 12640 df-uz 12784 df-fz 13457 df-fzo 13604 df-seq 13959 df-hash 14288 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-mulr 17229 df-sca 17231 df-vsca 17232 df-ip 17233 df-tset 17234 df-ple 17235 df-ds 17237 df-hom 17239 df-cco 17240 df-0g 17399 df-gsum 17400 df-prds 17405 df-pws 17407 df-mre 17543 df-mrc 17544 df-acs 17546 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-mhm 18746 df-submnd 18747 df-efmnd 18832 df-grp 18907 df-minusg 18908 df-mulg 19039 df-subg 19094 df-ghm 19183 df-ga 19260 df-cntz 19287 df-symg 19340 df-cmn 19752 df-abl 19753 df-mgp 20117 df-rng 20129 df-ur 20158 df-ring 20211 df-rhm 20447 df-subrng 20518 df-subrg 20542 df-psr 21903 df-mpl 21905 df-fxp 33244 df-sply 33720

This theorem is referenced by: (None)

W3C validator