Metamath Proof Explorer


Theorem prjcrv0

Description: The "curve" (zero set) corresponding to the zero polynomial contains all coordinates. (Contributed by SN, 23-Nov-2024)

Ref Expression
Hypotheses prjcrv0.y ⊢ Y = 0 … N mPoly K
prjcrv0.0 ⊢ 0 ˙ = 0 Y
prjcrv0.p ⊢ P = N ℙ𝕣𝕠𝕛 n K
prjcrv0.n ⊢ φ → N ∈ ℕ 0
prjcrv0.k ⊢ φ → K ∈ Field
Assertion prjcrv0 ⊢ φ → N PrjCrv K ⁡ 0 ˙ = P

Proof

Step Hyp Ref Expression
1 prjcrv0.y ⊢ Y = 0 … N mPoly K
2 prjcrv0.0 ⊢ 0 ˙ = 0 Y
3 prjcrv0.p ⊢ P = N ℙ𝕣𝕠𝕛 n K
4 prjcrv0.n ⊢ φ → N ∈ ℕ 0
5 prjcrv0.k ⊢ φ → K ∈ Field
6 eqid ⊢ 0 … N mHomP K = 0 … N mHomP K
7 eqid ⊢ 0 … N eval K = 0 … N eval K
8 eqid ⊢ 0 K = 0 K
9 fvssunirn ⊢ 0 … N mHomP K ⁡ N ⊆ ⋃ ran ⁡ 0 … N mHomP K
10 eqid ⊢ h ∈ ℕ 0 0 … N | h -1 ℕ ∈ Fin = h ∈ ℕ 0 0 … N | h -1 ℕ ∈ Fin
11 ovexd ⊢ φ → 0 … N ∈ V
12 5 fldcrngd ⊢ φ → K ∈ CRing
13 12 crnggrpd ⊢ φ → K ∈ Grp
14 1 10 8 2 11 13 mpl0 ⊢ φ → 0 ˙ = h ∈ ℕ 0 0 … N | h -1 ℕ ∈ Fin × 0 K
15 6 8 10 11 13 4 mhp0cl ⊢ φ → h ∈ ℕ 0 0 … N | h -1 ℕ ∈ Fin × 0 K ∈ 0 … N mHomP K ⁡ N
16 14 15 eqeltrd ⊢ φ → 0 ˙ ∈ 0 … N mHomP K ⁡ N
17 9 16 sselid ⊢ φ → 0 ˙ ∈ ⋃ ran ⁡ 0 … N mHomP K
18 6 7 3 8 4 5 17 prjcrvval ⊢ φ → N PrjCrv K ⁡ 0 ˙ = p ∈ P | 0 … N eval K ⁡ 0 ˙ p = 0 K
19 eqid ⊢ Base K = Base K
20 ovexd ⊢ φ ∧ p ∈ P → 0 … N ∈ V
21 12 adantr ⊢ φ ∧ p ∈ P → K ∈ CRing
22 7 19 1 8 2 20 21 evl0 ⊢ φ ∧ p ∈ P → 0 … N eval K ⁡ 0 ˙ = Base K 0 … N × 0 K
23 22 imaeq1d ⊢ φ ∧ p ∈ P → 0 … N eval K ⁡ 0 ˙ p = Base K 0 … N × 0 K p
24 eqid ⊢ K freeLMod 0 … N = K freeLMod 0 … N
25 eqid ⊢ Base K freeLMod 0 … N ∖ 0 K freeLMod 0 … N = Base K freeLMod 0 … N ∖ 0 K freeLMod 0 … N
26 4 adantr ⊢ φ ∧ p ∈ P → N ∈ ℕ 0
27 5 flddrngd ⊢ φ → K ∈ DivRing
28 27 adantr ⊢ φ ∧ p ∈ P → K ∈ DivRing
29 simpr ⊢ φ ∧ p ∈ P → p ∈ P
30 3 24 25 26 28 29 elprjspnss ⊢ φ ∧ p ∈ P → p ⊆ Base K freeLMod 0 … N ∖ 0 K freeLMod 0 … N
31 eqid ⊢ k ∈ Base K 0 … N | finSupp 0 K⁡ k = k ∈ Base K 0 … N | finSupp 0 K⁡ k
32 24 19 8 31 frlmbas ⊢ K ∈ Field ∧ 0 … N ∈ V → k ∈ Base K 0 … N | finSupp 0 K⁡ k = Base K freeLMod 0 … N
33 5 11 32 syl2anc ⊢ φ → k ∈ Base K 0 … N | finSupp 0 K⁡ k = Base K freeLMod 0 … N
34 ssrab2 ⊢ k ∈ Base K 0 … N | finSupp 0 K⁡ k ⊆ Base K 0 … N
35 33 34 eqsstrrdi ⊢ φ → Base K freeLMod 0 … N ⊆ Base K 0 … N
36 35 ssdifssd ⊢ φ → Base K freeLMod 0 … N ∖ 0 K freeLMod 0 … N ⊆ Base K 0 … N
37 36 adantr ⊢ φ ∧ p ∈ P → Base K freeLMod 0 … N ∖ 0 K freeLMod 0 … N ⊆ Base K 0 … N
38 30 37 sstrd ⊢ φ ∧ p ∈ P → p ⊆ Base K 0 … N
39 sseqin2 ⊢ p ⊆ Base K 0 … N ↔ Base K 0 … N ∩ p = p
40 38 39 sylib ⊢ φ ∧ p ∈ P → Base K 0 … N ∩ p = p
41 3 26 28 29 prjspnn0 ⊢ φ ∧ p ∈ P → p ≠ ∅
42 40 41 eqnetrd ⊢ φ ∧ p ∈ P → Base K 0 … N ∩ p ≠ ∅
43 xpima2 ⊢ Base K 0 … N ∩ p ≠ ∅ → Base K 0 … N × 0 K p = 0 K
44 42 43 syl ⊢ φ ∧ p ∈ P → Base K 0 … N × 0 K p = 0 K
45 23 44 eqtrd ⊢ φ ∧ p ∈ P → 0 … N eval K ⁡ 0 ˙ p = 0 K
46 45 rabeqcda ⊢ φ → p ∈ P | 0 … N eval K ⁡ 0 ˙ p = 0 K = P
47 18 46 eqtrd ⊢ φ → N PrjCrv K ⁡ 0 ˙ = P