Theorem mhpval 22331

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 22330	. 2 ⊢ (𝜑 → 𝐻 = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
9		eqeq2 2777	. . . . . 6 ⊢ (𝑛 = 𝑁 → (((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛 ↔ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁))
10	9	rabbidv 3425	. . . . 5 ⊢ (𝑛 = 𝑁 → {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} = {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁})
11	10	sseq2d 3970	. . . 4 ⊢ (𝑛 = 𝑁 → ((𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} ↔ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}))
12	11	rabbidv 3425	. . 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 6899	. . . 4 ⊢ 𝐵 ∈ V
16	15	rabex 5311	. . 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 7001	1 ⊢ (𝜑 → (𝐻‘𝑁) = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  {crab 3418  Vcvv 3457   ⊆ wss 3906  ^◡ccnv 5662   “ cima 5666  ‘cfv 6540  (class class class)co 7416   supp csupp 8158   ↑_m cmap 8826  Fincfn 8945  ℕcn 12244  ℕ₀cn0 12515  Basecbs 17286   ↾_s cress 17307  0_gc0g 17509   Σ_g cgsu 17510  ℂ_fldccnfld 21551   mPoly cmpl 22085   mHomP cmhp 22325

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-1cn 11169  ax-addcl 11171

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-nn 12245  df-n0 12516  df-mhp 22328

This theorem is used by:  ismhp  22332