Theorem mhpval 22453

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 22452	. 2 ⊢ (𝜑 → 𝐻 = (𝑛 ∈ ℕ0 ↦ {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛}}))
9		eqeq2 2773	. . . . . 6 ⊢ (𝑛 = 𝑁 → (((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛 ↔ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁))
10	9	rabbidv 3420	. . . . 5 ⊢ (𝑛 = 𝑁 → {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} = {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁})
11	10	sseq2d 3963	. . . 4 ⊢ (𝑛 = 𝑁 → ((𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑛} ↔ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}))
12	11	rabbidv 3420	. . 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 6897	. . . 4 ⊢ 𝐵 ∈ V
16	15	rabex 5300	. . 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 6999	1 ⊢ (𝜑 → (𝐻‘𝑁) = {𝑓 ∈ 𝐵 ∣ (𝑓 supp 0 ) ⊆ {𝑔 ∈ 𝐷 ∣ ((ℂfld ↾s ℕ0) Σg 𝑔) = 𝑁}})

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ⊆ wss 3899  ^◡ccnv 5650   “ cima 5654  ‘cfv 6537  (class class class)co 7418   supp csupp 8170   ↑_m cmap 8840  Fincfn 8966  ℕcn 12328  ℕ₀cn0 12599  Basecbs 17380   ↾_s cress 17401  0_gc0g 17603   Σ_g cgsu 17604  ℂ_fldccnfld 21671   mPoly cmpl 22207   mHomP cmhp 22447

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749  ax-cnex 11249  ax-1cn 11251  ax-addcl 11253

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-nn 12329  df-n0 12600  df-mhp 22450

This theorem is used by:  ismhp  22454