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 33711
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 33707 . . 3 eSymPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))))
21a1i 11 . 2 (𝜑 → eSymPoly = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}))))))
3 fveq2 6832 . . . . . 6 (𝑟 = 𝑅 → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
43adantl 481 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → (ℤRHom‘𝑟) = (ℤRHom‘𝑅))
5 oveq2 7366 . . . . . . . . . 10 (𝑖 = 𝐼 → (ℕ0m 𝑖) = (ℕ0m 𝐼))
65rabeqdv 3405 . . . . . . . . 9 (𝑖 = 𝐼 → { ∈ (ℕ0m 𝑖) ∣ finSupp 0} = { ∈ (ℕ0m 𝐼) ∣ finSupp 0})
7 esplyval.d . . . . . . . . 9 𝐷 = { ∈ (ℕ0m 𝐼) ∣ finSupp 0}
86, 7eqtr4di 2790 . . . . . . . 8 (𝑖 = 𝐼 → { ∈ (ℕ0m 𝑖) ∣ finSupp 0} = 𝐷)
98fveq2d 6836 . . . . . . 7 (𝑖 = 𝐼 → (𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0}) = (𝟭‘𝐷))
109adantr 480 . . . . . 6 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0}) = (𝟭‘𝐷))
11 fveq2 6832 . . . . . . . 8 (𝑖 = 𝐼 → (𝟭‘𝑖) = (𝟭‘𝐼))
1211adantr 480 . . . . . . 7 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝟭‘𝑖) = (𝟭‘𝐼))
13 pweq 4556 . . . . . . . . 9 (𝑖 = 𝐼 → 𝒫 𝑖 = 𝒫 𝐼)
1413rabeqdv 3405 . . . . . . . 8 (𝑖 = 𝐼 → {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘} = {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})
1514adantr 480 . . . . . . 7 ((𝑖 = 𝐼𝑟 = 𝑅) → {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘} = {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})
1612, 15imaeq12d 6018 . . . . . 6 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}) = ((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘}))
1710, 16fveq12d 6839 . . . . 5 ((𝑖 = 𝐼𝑟 = 𝑅) → ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})) = ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))
184, 17coeq12d 5811 . . . 4 ((𝑖 = 𝐼𝑟 = 𝑅) → ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘}))) = ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘}))))
1918mpteq2dv 5180 . . 3 ((𝑖 = 𝐼𝑟 = 𝑅) → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
2019adantl 481 . 2 ((𝜑 ∧ (𝑖 = 𝐼𝑟 = 𝑅)) → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑟) ∘ ((𝟭‘{ ∈ (ℕ0m 𝑖) ∣ finSupp 0})‘((𝟭‘𝑖) “ {𝑐 ∈ 𝒫 𝑖 ∣ (♯‘𝑐) = 𝑘})))) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
21 esplyval.i . . 3 (𝜑𝐼𝑉)
2221elexd 3454 . 2 (𝜑𝐼 ∈ V)
23 esplyval.r . . 3 (𝜑𝑅𝑊)
2423elexd 3454 . 2 (𝜑𝑅 ∈ V)
25 nn0ex 12408 . . . 4 0 ∈ V
2625mptex 7169 . . 3 (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))) ∈ V
2726a1i 11 . 2 (𝜑 → (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))) ∈ V)
282, 20, 22, 24, 27ovmpod 7510 1 (𝜑 → (𝐼eSymPoly𝑅) = (𝑘 ∈ ℕ0 ↦ ((ℤRHom‘𝑅) ∘ ((𝟭‘𝐷)‘((𝟭‘𝐼) “ {𝑐 ∈ 𝒫 𝐼 ∣ (♯‘𝑐) = 𝑘})))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {crab 3390  Vcvv 3430  𝒫 cpw 4542   class class class wbr 5086  cmpt 5167  cima 5625  ccom 5626  cfv 6490  (class class class)co 7358  cmpo 7360  m cmap 8764   finSupp cfsupp 9265  0cc0 11027  0cn0 12402  chash 14254  ℤRHomczrh 21456  𝟭cind 32912  eSymPolycesply 33705
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 5212  ax-sep 5231  ax-nul 5241  ax-pr 5368  ax-un 7680  ax-cnex 11083  ax-1cn 11085  ax-addcl 11087
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-ral 3053  df-rex 3063  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-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-pred 6257  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-2nd 7934  df-frecs 8222  df-wrecs 8253  df-recs 8302  df-rdg 8340  df-nn 12147  df-n0 12403  df-esply 33707
This theorem is referenced by:  esplyfval  33712  esplyfval0  33713
  Copyright terms: Public domain W3C validator