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 33803
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 33799 . . 3 eSymPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))))
21a1i 11 . 2 (𝜑 → eSymPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}))))))
3 fveq2 6852 . . . . . 6 (𝑟 = 𝑅 → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
43adantl 484 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
5 oveq2 7389 . . . . . . . . . 10 (𝑖 = 𝐼 → (ℕ0m 𝑖) = (ℕ0m 𝐼))
65rabeqdv 3419 . . . . . . . . 9 (𝑖 = 𝐼 → { ∈ (ℕ0m 𝑖) ∣ finSupp 0} = { ∈ (ℕ0m 𝐼) ∣ finSupp 0})
7 esplyval.d . . . . . . . . 9 𝐷 = { ∈ (ℕ0m 𝐼) ∣ finSupp 0}
86, 7eqtr4di 2805 . . . . . . . 8 (𝑖 = 𝐼 → { ∈ (ℕ0m 𝑖) ∣ finSupp 0} = 𝐷)
98fveq2d 6856 . . . . . . 7 (𝑖 = 𝐼 → (𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0}) = (𝟭‘𝐷))
109adantr 483 . . . . . 6 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0}) = (𝟭‘𝐷))
11 fveq2 6852 . . . . . . . 8 (𝑖 = 𝐼 → (𝟭‘𝑖) = (𝟭‘𝐼))
1211adantr 483 . . . . . . 7 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝟭‘𝑖) = (𝟭‘𝐼))
13 pweq 4559 . . . . . . . . 9 (𝑖 = 𝐼 → 𝒫 𝑖 = 𝒫 𝐼)
1413rabeqdv 3419 . . . . . . . 8 (𝑖 = 𝐼 → {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘} = {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})
1514adantr 483 . . . . . . 7 ((𝑖 = 𝐼𝑟 = 𝑅) → {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘} = {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})
1612, 15imaeq12d 6036 . . . . . 6 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}) = ((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘}))
1710, 16fveq12d 6859 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})) = ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))
184, 17coeq12d 5825 . . . 4 ((𝑖 = 𝐼𝑟 = 𝑅) → ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}))) = ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘}))))
1918mpteq2dv 5184 . . 3 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
2019adantl 484 . 2 ((𝜑 ∧ (𝑖 = 𝐼𝑟 = 𝑅)) → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
21 esplyval.i . . 3 (𝜑𝐼𝑉)
2221elexd 3467 . 2 (𝜑𝐼 ∈ V)
23 esplyval.r . . 3 (𝜑𝑅𝑊)
2423elexd 3467 . 2 (𝜑𝑅 ∈ V)
25 nn0ex 12473 . . . 4 0 ∈ V
2625mptex 7192 . . 3 (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))) ∈ V
2726a1i 11 . 2 (𝜑 → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))) ∈ V)
282, 20, 22, 24, 27ovmpod 7533 1 (𝜑 → (𝐼eSymPoly𝑅) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1550  wcel 2132  {crab 3404  Vcvv 3444  𝒫 cpw 4545   class class class wbr 5090  cmpt 5171  cima 5639  ccom 5640  cfv 6506  (class class class)co 7381  cmpo 7383  m cmap 8792   finSupp cfsupp 9293  0cc0 11059  𝟭cind 12181  0cn0 12467  chash 14329  ℤRHomczrh 21520  eSymPolycesply 33797
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pr 5380  ax-un 7703  ax-cnex 11115  ax-1cn 11117  ax-addcl 11119
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-pred 6273  df-ord 6334  df-on 6335  df-lim 6336  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-ov 7384  df-oprab 7385  df-mpo 7386  df-om 7832  df-2nd 7956  df-frecs 8246  df-wrecs 8277  df-recs 8326  df-rdg 8365  df-nn 12197  df-n0 12468  df-esply 33799
This theorem is referenced by:  esplyfval  33804  esplyfval0  33805
  Copyright terms: Public domain W3C validator