Theorem mhpval 22466

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	⊢ (𝜑 → 𝑅 ∈ 𝑊)
mhpval.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)

Assertion

Ref	Expression
mhpval	⊢ (𝜑 → (𝐻‘𝑁) = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})

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

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

Proof of Theorem mhpval

Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mhpfval.h	. . 3 ⊢ 𝐻 = (𝐼 mHomP 𝑅)
2		mhpfval.p	. . 3 ⊢ 𝑃 = (𝐼 mPoly 𝑅)
3		mhpfval.b	. . 3 ⊢ 𝐵 = (Base‘𝑃)
4		mhpfval.0	. . 3 ⊢ 0 = (0g‘𝑅)
5		mhpfval.d	. . 3 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin}
6		mhpfval.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
7		mhpfval.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
8	1, 2, 3, 4, 5, 6, 7	mhpfval 22465	. 2 ⊢ (𝜑 → 𝐻 = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
9		eqeq2 2772	. . . . . 6 ⊢ (𝑛 = 𝑁 → (((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛 ↔ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁))
10	9	rabbidv 3419	. . . . 5 ⊢ (𝑛 = 𝑁 → {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} = {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁})
11	10	sseq2d 3940	. . . 4 ⊢ (𝑛 = 𝑁 → ((𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} ↔ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}))
12	11	rabbidv 3419	. . 3 ⊢ (𝑛 = 𝑁 → {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}} = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})
13	12	adantl 487	. 2 ⊢ ((𝜑 ∧ 𝑛 = 𝑁) → {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}} = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})
14		mhpval.n	. 2 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
15	3	fvexi 6900	. . . 4 ⊢ 𝐵 ∈ V
16	15	rabex 5299	. . 3 ⊢ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}} ∈ V
17	16	a1i 11	. 2 ⊢ (𝜑 → {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}} ∈ V)
18	8, 13, 14, 17	fvmptd 7002	1 ⊢ (𝜑 → (𝐻‘𝑁) = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {crab 3412  Vcvv 3450   ⊆ wss 3895  ^◡ccnv 5649   “ cima 5653  ‘cfv 6539  (class class class)co 7421   supp csupp 8180   ↑_m cmap 8851  Fincfn 8977  ℕcn 12339  ℕ₀cn0 12610  Basecbs 17393   ↾_s cress 17414  0_gc0g 17616   Σ_g cgsu 17617  ℂ_fldccnfld 21684   mPoly cmpl 22220   mHomP cmhp 22460

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752  ax-cnex 11260  ax-1cn 11262  ax-addcl 11264

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-om 7879  df-2nd 8003  df-frecs 8303  df-wrecs 8334  df-recs 8383  df-rdg 8422  df-nn 12340  df-n0 12611  df-mhp 22463

This theorem is used by:  ismhp  22467