Theorem mhpfval 20332

Description: Value of the "homogeneous polynomial" function. (Contributed by Steven Nguyen, 25-Aug-2023.)

Hypotheses

Ref	Expression
mhpfval.h	⊢ 𝐻 = (𝐼 mHomP 𝑅)
mhpfval.p	⊢ 𝑃 = (𝐼 mPoly 𝑅)
mhpfval.b	⊢ 𝐵 = (Base‘𝑃)
mhpfval.0	⊢ 0 = (0g‘𝑅)
mhpfval.d	⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
mhpfval.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
mhpfval.r	⊢ (𝜑 → 𝑅 ∈ 𝑊)

Assertion

Ref	Expression
mhpfval	⊢ (𝜑 → 𝐻 = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}))

Distinct variable groups:   𝑓,𝑔,ℎ,𝑗,𝑛   𝑓,𝐼,ℎ,𝑛   𝑅,𝑓,𝑛   𝐷,𝑔   𝐵,𝑓

Allowed substitution hints:   𝜑(𝑓,𝑔,ℎ,𝑗,𝑛)   𝐵(𝑔,ℎ,𝑗,𝑛)   𝐷(𝑓,ℎ,𝑗,𝑛)   𝑃(𝑓,𝑔,ℎ,𝑗,𝑛)   𝑅(𝑔,ℎ,𝑗)   𝐻(𝑓,𝑔,ℎ,𝑗,𝑛)   𝐼(𝑔,𝑗)   𝑉(𝑓,𝑔,ℎ,𝑗,𝑛)   𝑊(𝑓,𝑔,ℎ,𝑗,𝑛)   0 (𝑓,𝑔,ℎ,𝑗,𝑛)

Proof of Theorem mhpfval

Dummy variables 𝑖 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mhpfval.h	. 2 ⊢ 𝐻 = (𝐼 mHomP 𝑅)
2		mhpfval.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
3	2	elexd 3514	. . 3 ⊢ (𝜑 → 𝐼 ∈ V)
4		mhpfval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
5	4	elexd 3514	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
6		nn0ex 11904	. . . . 5 ⊢ ℕ0 ∈ V
7	6	mptex 6986	. . . 4 ⊢ (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}) ∈ V
8	7	a1i 11	. . 3 ⊢ (𝜑 → (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}) ∈ V)
9		oveq12 7165	. . . . . . . . 9 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPoly 𝑟) = (𝐼 mPoly 𝑅))
10		mhpfval.p	. . . . . . . . 9 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
11	9, 10	syl6eqr 2874	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPoly 𝑟) = 𝑃)
12	11	fveq2d 6674	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘(𝑖 mPoly 𝑟)) = (Base‘𝑃))
13		mhpfval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑃)
14	12, 13	syl6eqr 2874	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘(𝑖 mPoly 𝑟)) = 𝐵)
15		fveq2 6670	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
16		mhpfval.0	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
17	15, 16	syl6eqr 2874	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
18	17	oveq2d 7172	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑓 supp (0g‘𝑟)) = (𝑓 supp 0 ))
19	18	adantl 484	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 supp (0g‘𝑟)) = (𝑓 supp 0 ))
20		oveq2 7164	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (ℕ0 ↑m 𝑖) = (ℕ0 ↑m 𝐼))
21	20	rabeqdv 3484	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
22		mhpfval.d	. . . . . . . . . 10 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
23	21, 22	syl6eqr 2874	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = 𝐷)
24	23	rabeqdv 3484	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛} = {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛})
25	24	adantr 483	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛} = {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛})
26	19, 25	sseq12d 4000	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛} ↔ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}))
27	14, 26	rabeqbidv 3485	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {𝑓 ∈ (Base‘(𝑖 mPoly 𝑟)) ∣ (𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}} = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}})
28	27	mpteq2dv 5162	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (Base‘(𝑖 mPoly 𝑟)) ∣ (𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}))
29		df-mhp 20326	. . . 4 ⊢ mHomP = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (Base‘(𝑖 mPoly 𝑟)) ∣ (𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}))
30	28, 29	ovmpoga 7304	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V ∧ (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}) ∈ V) → (𝐼 mHomP 𝑅) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}))
31	3, 5, 8, 30	syl3anc 1367	. 2 ⊢ (𝜑 → (𝐼 mHomP 𝑅) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}))
32	1, 31	syl5eq 2868	1 ⊢ (𝜑 → 𝐻 = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ Σ𝑗 ∈ ℕ0 (𝑔‘𝑗) = 𝑛}}))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  {crab 3142  Vcvv 3494   ⊆ wss 3936   ↦ cmpt 5146  ^◡ccnv 5554   “ cima 5558  ‘cfv 6355  (class class class)co 7156   supp csupp 7830   ↑_m cmap 8406  Fincfn 8509  ℕcn 11638  ℕ₀cn0 11898  Σcsu 15042  Basecbs 16483  0_gc0g 16713   mPoly cmpl 20133   mHomP cmhp 20322

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-cnex 10593  ax-1cn 10595  ax-addcl 10597

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-om 7581  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-nn 11639  df-n0 11899  df-mhp 20326

This theorem is referenced by:  mhpval  20333