Theorem mhpfval 22514

Description: Value of the "homogeneous polynomial" operator. (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 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))

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 3477	. . 3 ⊢ (𝜑 → 𝐼 ∈ V)
4		mhpfval.r	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
5	4	elexd 3477	. . 3 ⊢ (𝜑 → 𝑅 ∈ V)
6		oveq12 7460	. . . . . . . . 9 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPoly 𝑟) = (𝐼 mPoly 𝑅))
7		mhpfval.p	. . . . . . . . 9 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
8	6, 7	eqtr4di 2816	. . . . . . . 8 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑖 mPoly 𝑟) = 𝑃)
9	8	fveq2d 6920	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘(𝑖 mPoly 𝑟)) = (Base‘𝑃))
10		mhpfval.b	. . . . . . 7 ⊢ 𝐵 = (Base‘𝑃)
11	9, 10	eqtr4di 2816	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (Base‘(𝑖 mPoly 𝑟)) = 𝐵)
12		fveq2 6916	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
13		mhpfval.0	. . . . . . . . . 10 ⊢ 0 = (0g‘𝑅)
14	12, 13	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = 0 )
15	14	oveq2d 7467	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑓 supp (0g‘𝑟)) = (𝑓 supp 0 ))
16	15	adantl 487	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑓 supp (0g‘𝑟)) = (𝑓 supp 0 ))
17		oveq2 7459	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐼 → (ℕ0 ↑m 𝑖) = (ℕ0 ↑m 𝐼))
18	17	rabeqdv 3431	. . . . . . . . . 10 ⊢ (𝑖 = 𝐼 → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin})
19		mhpfval.d	. . . . . . . . . 10 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
20	18, 19	eqtr4di 2816	. . . . . . . . 9 ⊢ (𝑖 = 𝐼 → {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} = 𝐷)
21	20	rabeqdv 3431	. . . . . . . 8 ⊢ (𝑖 = 𝐼 → {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} = {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛})
22	21	adantr 486	. . . . . . 7 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} = {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛})
23	16, 22	sseq12d 3946	. . . . . 6 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → ((𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} ↔ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}))
24	11, 23	rabeqbidv 3433	. . . . 5 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → {𝑓 ∈ (Base‘(𝑖 mPoly 𝑟)) ∣ (𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}} = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}})
25	24	mpteq2dv 5205	. . . 4 ⊢ ((𝑖 = 𝐼 ∧ 𝑟 = 𝑅) → (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (Base‘(𝑖 mPoly 𝑟)) ∣ (𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
26		df-mhp 22512	. . . 4 ⊢ mHomP = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ (Base‘(𝑖 mPoly 𝑟)) ∣ (𝑓 supp (0g‘𝑟)) ⊆ {𝑔 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
27		nn0ex 12652	. . . . 5 ⊢ ℕ0 ∈ V
28	27	mptex 7260	. . . 4 ⊢ (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}) ∈ V
29	25, 26, 28	ovmpoa 7607	. . 3 ⊢ ((𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mHomP 𝑅) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
30	3, 5, 29	syl2anc 596	. 2 ⊢ (𝜑 → (𝐼 mHomP 𝑅) = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
31	1, 30	eqtrid 2810	1 ⊢ (𝜑 → 𝐻 = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   ⊆ wss 3900   ↦ cmpt 5192  ^◡ccnv 5657   “ cima 5661  ‘cfv 6566  (class class class)co 7451   supp csupp 8214   ↑_m cmap 8885  Fincfn 9011  ℕcn 12375  ℕ₀cn0 12646  Basecbs 17431   ↾_s cress 17452  0_gc0g 17660   Σ_g cgsu 17661  ℂ_fldccnfld 21729   mPoly cmpl 22269   mHomP cmhp 22509

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-1cn 11297  ax-addcl 11299

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-nn 12376  df-n0 12647  df-mhp 22512

This theorem is used by:  mhpval  22515  mhprcl  22519