Theorem prjcrvfval 43933

Description: Value of the projective curve function. (Contributed by SN, 23-Nov-2024.)

Hypotheses

Ref	Expression
prjcrvfval.h	⊢ 𝐻 = ((0...𝑁) mHomP 𝐾)
prjcrvfval.e	⊢ 𝐸 = ((0...𝑁) eval 𝐾)
prjcrvfval.p	⊢ 𝑃 = (𝑁 ℙrojn 𝐾)
prjcrvfval.0	⊢ 0 = (0g‘𝐾)
prjcrvfval.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)
prjcrvfval.k	⊢ (𝜑 → 𝐾 ∈ Field)

Assertion

Ref	Expression
prjcrvfval	⊢ (𝜑 → (𝑁 ℙrojCrv 𝐾) = (𝑓 ∈ ∪ ran 𝐻 ↦ {𝑝 ∈ 𝑃 ∣ ((𝐸‘𝑓) “ 𝑝) = { 0 }}))

Distinct variable groups:   𝑓,𝑁,𝑝   𝑓,𝐾,𝑝   𝑃,𝑝   𝑓,𝐻

Allowed substitution hints:   𝜑(𝑓, 𝑝)   𝑃(𝑓)   𝐸(𝑓, 𝑝)   𝐻(𝑝)   0 (𝑓, 𝑝)

Proof of Theorem prjcrvfval

Dummy variables 𝑛 𝑘 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prjcrvfval.n	. 2 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
2		prjcrvfval.k	. 2 ⊢ (𝜑 → 𝐾 ∈ Field)
3		oveq2 7459	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → (0...𝑛) = (0...𝑁))
4		oveq12 7460	. . . . . . . 8 ⊢ (((0...𝑛) = (0...𝑁) ∧ 𝑘 = 𝐾) → ((0...𝑛) mHomP 𝑘) = ((0...𝑁) mHomP 𝐾))
5	3, 4	sylan 592	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ((0...𝑛) mHomP 𝑘) = ((0...𝑁) mHomP 𝐾))
6		prjcrvfval.h	. . . . . . 7 ⊢ 𝐻 = ((0...𝑁) mHomP 𝐾)
7	5, 6	eqtr4di 2816	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ((0...𝑛) mHomP 𝑘) = 𝐻)
8	7	rneqd 5932	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ran ((0...𝑛) mHomP 𝑘) = ran 𝐻)
9	8	unieqd 4885	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ∪ ran ((0...𝑛) mHomP 𝑘) = ∪ ran 𝐻)
10		oveq12 7460	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → (𝑛 ℙrojn 𝑘) = (𝑁 ℙrojn 𝐾))
11		prjcrvfval.p	. . . . . 6 ⊢ 𝑃 = (𝑁 ℙrojn 𝐾)
12	10, 11	eqtr4di 2816	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → (𝑛 ℙrojn 𝑘) = 𝑃)
13		id 23	. . . . . . . . . 10 ⊢ (𝑘 = 𝐾 → 𝑘 = 𝐾)
14	3, 13	oveqan12d 7470	. . . . . . . . 9 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ((0...𝑛) eval 𝑘) = ((0...𝑁) eval 𝐾))
15		prjcrvfval.e	. . . . . . . . 9 ⊢ 𝐸 = ((0...𝑁) eval 𝐾)
16	14, 15	eqtr4di 2816	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ((0...𝑛) eval 𝑘) = 𝐸)
17	16	fveq1d 6918	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → (((0...𝑛) eval 𝑘)‘𝑓) = (𝐸‘𝑓))
18	17	imaeq1d 6069	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → ((((0...𝑛) eval 𝑘)‘𝑓) “ 𝑝) = ((𝐸‘𝑓) “ 𝑝))
19		fveq2 6916	. . . . . . . . 9 ⊢ (𝑘 = 𝐾 → (0g‘𝑘) = (0g‘𝐾))
20		prjcrvfval.0	. . . . . . . . 9 ⊢ 0 = (0g‘𝐾)
21	19, 20	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑘 = 𝐾 → (0g‘𝑘) = 0 )
22	21	adantl 487	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → (0g‘𝑘) = 0 )
23	22	sneqd 4596	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → {(0g‘𝑘)} = { 0 })
24	18, 23	eqeq12d 2779	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → (((((0...𝑛) eval 𝑘)‘𝑓) “ 𝑝) = {(0g‘𝑘)} ↔ ((𝐸‘𝑓) “ 𝑝) = { 0 }))
25	12, 24	rabeqbidv 3433	. . . 4 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → {𝑝 ∈ (𝑛 ℙrojn 𝑘) ∣ ((((0...𝑛) eval 𝑘)‘𝑓) “ 𝑝) = {(0g‘𝑘)}} = {𝑝 ∈ 𝑃 ∣ ((𝐸‘𝑓) “ 𝑝) = { 0 }})
26	9, 25	mpteq12dv 5198	. . 3 ⊢ ((𝑛 = 𝑁 ∧ 𝑘 = 𝐾) → (𝑓 ∈ ∪ ran ((0...𝑛) mHomP 𝑘) ↦ {𝑝 ∈ (𝑛 ℙrojn 𝑘) ∣ ((((0...𝑛) eval 𝑘)‘𝑓) “ 𝑝) = {(0g‘𝑘)}}) = (𝑓 ∈ ∪ ran 𝐻 ↦ {𝑝 ∈ 𝑃 ∣ ((𝐸‘𝑓) “ 𝑝) = { 0 }}))
27		df-prjcrv 43932	. . 3 ⊢ ℙrojCrv = (𝑛 ∈ ℕ0, 𝑘 ∈ Field ↦ (𝑓 ∈ ∪ ran ((0...𝑛) mHomP 𝑘) ↦ {𝑝 ∈ (𝑛 ℙrojn 𝑘) ∣ ((((0...𝑛) eval 𝑘)‘𝑓) “ 𝑝) = {(0g‘𝑘)}}))
28	6	ovexi 7485	. . . . . 6 ⊢ 𝐻 ∈ V
29	28	rnex 7956	. . . . 5 ⊢ ran 𝐻 ∈ V
30	29	uniex 7790	. . . 4 ⊢ ∪ ran 𝐻 ∈ V
31	30	mptex 7260	. . 3 ⊢ (𝑓 ∈ ∪ ran 𝐻 ↦ {𝑝 ∈ 𝑃 ∣ ((𝐸‘𝑓) “ 𝑝) = { 0 }}) ∈ V
32	26, 27, 31	ovmpoa 7607	. 2 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐾 ∈ Field) → (𝑁 ℙrojCrv 𝐾) = (𝑓 ∈ ∪ ran 𝐻 ↦ {𝑝 ∈ 𝑃 ∣ ((𝐸‘𝑓) “ 𝑝) = { 0 }}))
33	1, 2, 32	syl2anc 596	1 ⊢ (𝜑 → (𝑁 ℙrojCrv 𝐾) = (𝑓 ∈ ∪ ran 𝐻 ↦ {𝑝 ∈ 𝑃 ∣ ((𝐸‘𝑓) “ 𝑝) = { 0 }}))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  {csn 4588  ∪ cuni 4872   ↦ cmpt 5192  ran crn 5659   “ cima 5661  ‘cfv 6566  (class class class)co 7451  0cc0 11239  ℕ₀cn0 12646  ...cfz 13679  0_gc0g 17660  Fieldcfield 21032   eval cevl 22437   mHomP cmhp 22509   ℙroj_n cprjspn 43908   ℙrojCrv cprjcrv 43931

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  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-id 5553  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-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-prjcrv 43932

This theorem is used by:  prjcrvval  43934