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

Theorem esplyval 33861
Description: The elementary polynomials for a given index 𝐼 of variables and base ring 𝑅. (Contributed by Thierry Arnoux, 18-Jan-2026.)
Hypotheses
Ref Expression
esplyval.d 𝐷 = { ∈ (ℕ0m 𝐼) ∣ finSupp 0}
esplyval.i (𝜑𝐼𝑉)
esplyval.r (𝜑𝑅𝑊)
Assertion
Ref Expression
esplyval (𝜑 → (𝐼eSymPoly𝑅) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
Distinct variable groups:   𝐼,𝑐,,𝑘   𝑅,𝑘
Allowed substitution hints:   𝜑(,𝑘,𝑐)   𝐷(,𝑘,𝑐)   𝑅(,𝑐)   𝑉(,𝑘,𝑐)   𝑊(,𝑘,𝑐)

Proof of Theorem esplyval
Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-esply 33857 . . 3 eSymPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))))
21a1i 11 . 2 (𝜑 → eSymPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}))))))
3 fveq2 6867 . . . . . 6 (𝑟 = 𝑅 → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
43adantl 485 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
5 oveq2 7404 . . . . . . . . . 10 (𝑖 = 𝐼 → (ℕ0m 𝑖) = (ℕ0m 𝐼))
65rabeqdv 3430 . . . . . . . . 9 (𝑖 = 𝐼 → { ∈ (ℕ0m 𝑖) ∣ finSupp 0} = { ∈ (ℕ0m 𝐼) ∣ finSupp 0})
7 esplyval.d . . . . . . . . 9 𝐷 = { ∈ (ℕ0m 𝐼) ∣ finSupp 0}
86, 7eqtr4di 2816 . . . . . . . 8 (𝑖 = 𝐼 → { ∈ (ℕ0m 𝑖) ∣ finSupp 0} = 𝐷)
98fveq2d 6871 . . . . . . 7 (𝑖 = 𝐼 → (𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0}) = (𝟭‘𝐷))
109adantr 484 . . . . . 6 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0}) = (𝟭‘𝐷))
11 fveq2 6867 . . . . . . . 8 (𝑖 = 𝐼 → (𝟭‘𝑖) = (𝟭‘𝐼))
1211adantr 484 . . . . . . 7 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝟭‘𝑖) = (𝟭‘𝐼))
13 pweq 4570 . . . . . . . . 9 (𝑖 = 𝐼 → 𝒫 𝑖 = 𝒫 𝐼)
1413rabeqdv 3430 . . . . . . . 8 (𝑖 = 𝐼 → {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘} = {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})
1514adantr 484 . . . . . . 7 ((𝑖 = 𝐼𝑟 = 𝑅) → {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘} = {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})
1612, 15imaeq12d 6050 . . . . . 6 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}) = ((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘}))
1710, 16fveq12d 6874 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})) = ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))
184, 17coeq12d 5837 . . . 4 ((𝑖 = 𝐼𝑟 = 𝑅) → ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}))) = ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘}))))
1918mpteq2dv 5195 . . 3 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
2019adantl 485 . 2 ((𝜑 ∧ (𝑖 = 𝐼𝑟 = 𝑅)) → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
21 esplyval.i . . 3 (𝜑𝐼𝑉)
2221elexd 3478 . 2 (𝜑𝐼 ∈ V)
23 esplyval.r . . 3 (𝜑𝑅𝑊)
2423elexd 3478 . 2 (𝜑𝑅 ∈ V)
25 nn0ex 12497 . . . 4 0 ∈ V
2625mptex 7207 . . 3 (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))) ∈ V
2726a1i 11 . 2 (𝜑 → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))) ∈ V)
282, 20, 22, 24, 27ovmpod 7548 1 (𝜑 → (𝐼eSymPoly𝑅) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1561  wcel 2143  {crab 3415  Vcvv 3455  𝒫 cpw 4556   class class class wbr 5101  cmpt 5182  cima 5651  ccom 5652  cfv 6521  (class class class)co 7396  cmpo 7398  m cmap 8808   finSupp cfsupp 9305  0cc0 11084  𝟭cind 12205  0cn0 12491  chash 14353  ℤRHomczrh 21558  eSymPolycesply 33855
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pr 5391  ax-un 7718  ax-cnex 11140  ax-1cn 11142  ax-addcl 11144
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5102  df-opab 5164  df-mpt 5183  df-tr 5209  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-nn 12221  df-n0 12492  df-esply 33857
This theorem is referenced by:  esplyfval  33862  esplyfval0  33863
  Copyright terms: Public domain W3C validator