veronesev1lem - Mathbox for Jiamin Zhao

	Mathbox for Jiamin Zhao		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > veronesev1lem		Structured version Visualization version GIF version

Theorem veronesev1lem 51251

Description: Lemma for veronesevrowd 51257. Value of the first coordinate of the Veronese map at a point. (Contributed by Jiamin Zhao, 15-Aug-2026.)

**Hypothesis**
Ref	Expression
veronesevrow.1	⊢ (𝜑 → 𝑃 ∈ (ℝ ↑_m (1...3)))

**Assertion**
Ref	Expression
veronesev1lem	⊢ (𝜑 → ((veronese‘𝑃)‘1) = ((𝑃‘1)↑2))

Proof of Theorem veronesev1lem Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		veronesevrow.1	. . 3 ⊢ (𝜑 → 𝑃 ∈ (ℝ ↑_m (1...3)))
2	1	veronesevald 51249	. 2 ⊢ (𝜑 → (veronese‘𝑃) = (𝑥 ∈ (1...6) ↦ (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0)))))
3		iftrue 4491	. . . . . . . . . 10 ⊢ (𝑥 = 1 → if(𝑥 = 1, ((𝑃‘1)↑2), 0) = ((𝑃‘1)↑2))
4	3	oveq1d 7455	. . . . . . . . 9 ⊢ (𝑥 = 1 → (if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) = (((𝑃‘1)↑2) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)))
5	4	oveq1d 7455	. . . . . . . 8 ⊢ (𝑥 = 1 → ((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) = ((((𝑃‘1)↑2) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)))
6	5	oveq1d 7455	. . . . . . 7 ⊢ (𝑥 = 1 → (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
7		1ne2 12577	. . . . . . . . . . . . 13 ⊢ 1 ≠ 2
8		neeq1 3021	. . . . . . . . . . . . 13 ⊢ (𝑥 = 1 → (𝑥 ≠ 2 ↔ 1 ≠ 2))
9	7, 8	mpbiri 261	. . . . . . . . . . . 12 ⊢ (𝑥 = 1 → 𝑥 ≠ 2)
10	9	neneqd 2964	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → ¬ 𝑥 = 2)
11	10	iffalsed 4496	. . . . . . . . . 10 ⊢ (𝑥 = 1 → if(𝑥 = 2, ((𝑃‘2)↑2), 0) = 0)
12	11	oveq2d 7456	. . . . . . . . 9 ⊢ (𝑥 = 1 → (((𝑃‘1)↑2) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) = (((𝑃‘1)↑2) + 0))
13	12	oveq1d 7455	. . . . . . . 8 ⊢ (𝑥 = 1 → ((((𝑃‘1)↑2) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) = ((((𝑃‘1)↑2) + 0) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)))
14	13	oveq1d 7455	. . . . . . 7 ⊢ (𝑥 = 1 → (((((𝑃‘1)↑2) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
15	6, 14	eqtrd 2798	. . . . . 6 ⊢ (𝑥 = 1 → (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
16		1ne3 51219	. . . . . . . . . . 11 ⊢ 1 ≠ 3
17		neeq1 3021	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → (𝑥 ≠ 3 ↔ 1 ≠ 3))
18	16, 17	mpbiri 261	. . . . . . . . . 10 ⊢ (𝑥 = 1 → 𝑥 ≠ 3)
19	18	neneqd 2964	. . . . . . . . 9 ⊢ (𝑥 = 1 → ¬ 𝑥 = 3)
20	19	iffalsed 4496	. . . . . . . 8 ⊢ (𝑥 = 1 → if(𝑥 = 3, ((𝑃‘3)↑2), 0) = 0)
21	20	oveq2d 7456	. . . . . . 7 ⊢ (𝑥 = 1 → ((((𝑃‘1)↑2) + 0) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) = ((((𝑃‘1)↑2) + 0) + 0))
22	21	oveq1d 7455	. . . . . 6 ⊢ (𝑥 = 1 → (((((𝑃‘1)↑2) + 0) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
23		1re 11332	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ
24		1lt4 12545	. . . . . . . . . . . . 13 ⊢ 1 < 4
25	23, 24	ltneii 11447	. . . . . . . . . . . 12 ⊢ 1 ≠ 4
26		neeq1 3021	. . . . . . . . . . . 12 ⊢ (𝑥 = 1 → (𝑥 ≠ 4 ↔ 1 ≠ 4))
27	25, 26	mpbiri 261	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → 𝑥 ≠ 4)
28	27	neneqd 2964	. . . . . . . . . 10 ⊢ (𝑥 = 1 → ¬ 𝑥 = 4)
29	28	iffalsed 4496	. . . . . . . . 9 ⊢ (𝑥 = 1 → if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) = 0)
30	29	oveq1d 7455	. . . . . . . 8 ⊢ (𝑥 = 1 → (if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) = (0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)))
31	30	oveq1d 7455	. . . . . . 7 ⊢ (𝑥 = 1 → ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0)) = ((0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0)))
32	31	oveq2d 7456	. . . . . 6 ⊢ (𝑥 = 1 → (((((𝑃‘1)↑2) + 0) + 0) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
33	15, 22, 32	3eqtrd 2802	. . . . 5 ⊢ (𝑥 = 1 → (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
34		1lt5 12549	. . . . . . . . . . . 12 ⊢ 1 < 5
35	23, 34	ltneii 11447	. . . . . . . . . . 11 ⊢ 1 ≠ 5
36		neeq1 3021	. . . . . . . . . . 11 ⊢ (𝑥 = 1 → (𝑥 ≠ 5 ↔ 1 ≠ 5))
37	35, 36	mpbiri 261	. . . . . . . . . 10 ⊢ (𝑥 = 1 → 𝑥 ≠ 5)
38	37	neneqd 2964	. . . . . . . . 9 ⊢ (𝑥 = 1 → ¬ 𝑥 = 5)
39	38	iffalsed 4496	. . . . . . . 8 ⊢ (𝑥 = 1 → if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0) = 0)
40	39	oveq2d 7456	. . . . . . 7 ⊢ (𝑥 = 1 → (0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) = (0 + 0))
41	40	oveq1d 7455	. . . . . 6 ⊢ (𝑥 = 1 → ((0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0)) = ((0 + 0) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0)))
42	41	oveq2d 7456	. . . . 5 ⊢ (𝑥 = 1 → (((((𝑃‘1)↑2) + 0) + 0) + ((0 + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))))
43		1lt6 12554	. . . . . . . . . . 11 ⊢ 1 < 6
44	23, 43	ltneii 11447	. . . . . . . . . 10 ⊢ 1 ≠ 6
45		neeq1 3021	. . . . . . . . . 10 ⊢ (𝑥 = 1 → (𝑥 ≠ 6 ↔ 1 ≠ 6))
46	44, 45	mpbiri 261	. . . . . . . . 9 ⊢ (𝑥 = 1 → 𝑥 ≠ 6)
47	46	neneqd 2964	. . . . . . . 8 ⊢ (𝑥 = 1 → ¬ 𝑥 = 6)
48	47	iffalsed 4496	. . . . . . 7 ⊢ (𝑥 = 1 → if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0) = 0)
49	48	oveq2d 7456	. . . . . 6 ⊢ (𝑥 = 1 → ((0 + 0) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0)) = ((0 + 0) + 0))
50	49	oveq2d 7456	. . . . 5 ⊢ (𝑥 = 1 → (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + 0)))
51	33, 42, 50	3eqtrd 2802	. . . 4 ⊢ (𝑥 = 1 → (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + 0)))
52	51	adantl 487	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + 0)))
53	1	rr3fv1cld 51225	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑃‘1) ∈ ℝ)
54	53	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 = 1) → (𝑃‘1) ∈ ℝ)
55	54	resqcld 14292	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = 1) → ((𝑃‘1)↑2) ∈ ℝ)
56		0red 11335	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 = 1) → 0 ∈ ℝ)
57	55, 56	readdcld 11362	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((𝑃‘1)↑2) + 0) ∈ ℝ)
58	57	recnd 11361	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((𝑃‘1)↑2) + 0) ∈ ℂ)
59	58	addridd 11534	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 1) → ((((𝑃‘1)↑2) + 0) + 0) = (((𝑃‘1)↑2) + 0))
60	59	oveq1d 7455	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + 0)) = ((((𝑃‘1)↑2) + 0) + ((0 + 0) + 0)))
61	55	recnd 11361	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 1) → ((𝑃‘1)↑2) ∈ ℂ)
62	61	addridd 11534	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((𝑃‘1)↑2) + 0) = ((𝑃‘1)↑2))
63	62	oveq1d 7455	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 1) → ((((𝑃‘1)↑2) + 0) + ((0 + 0) + 0)) = (((𝑃‘1)↑2) + ((0 + 0) + 0)))
64	60, 63	eqtrd 2798	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + 0)) = (((𝑃‘1)↑2) + ((0 + 0) + 0)))
65	56, 56	readdcld 11362	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 1) → (0 + 0) ∈ ℝ)
66	65	recnd 11361	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 1) → (0 + 0) ∈ ℂ)
67	66	addridd 11534	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 1) → ((0 + 0) + 0) = (0 + 0))
68	67	oveq2d 7456	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((𝑃‘1)↑2) + ((0 + 0) + 0)) = (((𝑃‘1)↑2) + (0 + 0)))
69		00id 11509	. . . . . 6 ⊢ (0 + 0) = 0
70	69	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 1) → (0 + 0) = 0)
71	70	oveq2d 7456	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((𝑃‘1)↑2) + (0 + 0)) = (((𝑃‘1)↑2) + 0))
72	64, 68, 71	3eqtrd 2802	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((((𝑃‘1)↑2) + 0) + 0) + ((0 + 0) + 0)) = (((𝑃‘1)↑2) + 0))
73	52, 72, 62	3eqtrd 2802	. 2 ⊢ ((𝜑 ∧ 𝑥 = 1) → (((if(𝑥 = 1, ((𝑃‘1)↑2), 0) + if(𝑥 = 2, ((𝑃‘2)↑2), 0)) + if(𝑥 = 3, ((𝑃‘3)↑2), 0)) + ((if(𝑥 = 4, ((𝑃‘1) · (𝑃‘2)), 0) + if(𝑥 = 5, ((𝑃‘2) · (𝑃‘3)), 0)) + if(𝑥 = 6, ((𝑃‘3) · (𝑃‘1)), 0))) = ((𝑃‘1)↑2))
74		1zzd 12751	. . 3 ⊢ (𝜑 → 1 ∈ ℤ)
75		6nn 12456	. . . . 5 ⊢ 6 ∈ ℕ
76	75	nnzi 12744	. . . 4 ⊢ 6 ∈ ℤ
77	76	a1i 11	. . 3 ⊢ (𝜑 → 6 ∈ ℤ)
78		1le1 11968	. . . 4 ⊢ 1 ≤ 1
79	78	a1i 11	. . 3 ⊢ (𝜑 → 1 ≤ 1)
80		6re 12457	. . . . 5 ⊢ 6 ∈ ℝ
81	23, 80, 43	ltleii 11457	. . . 4 ⊢ 1 ≤ 6
82	81	a1i 11	. . 3 ⊢ (𝜑 → 1 ≤ 6)
83	74, 77, 74, 79, 82	elfzd 13671	. 2 ⊢ (𝜑 → 1 ∈ (1...6))
84	53	resqcld 14292	. 2 ⊢ (𝜑 → ((𝑃‘1)↑2) ∈ ℝ)
85	2, 73, 83, 84	fvmptd 7021	1 ⊢ (𝜑 → ((veronese‘𝑃)‘1) = ((𝑃‘1)↑2))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ifcif 4485 class class class wbr 5106 ‘cfv 6555 (class class class)co 7440 ↑_m cmap 8872 ℝcr 11223 0cc0 11224 1c1 11225 + caddc 11227 · cmul 11229 ≤ cle 11368 2c2 12421 3c3 12422 4c4 12423 5c5 12424 6c6 12425 ℤcz 12717 ...cfz 13663 ↑cexp 14228 veronesecveronese 51246

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 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7772 ax-cnex 11280 ax-resscn 11281 ax-1cn 11282 ax-icn 11283 ax-addcl 11284 ax-addrcl 11285 ax-mulcl 11286 ax-mulrcl 11287 ax-mulcom 11288 ax-addass 11289 ax-mulass 11290 ax-distr 11291 ax-i2m1 11292 ax-1ne0 11293 ax-1rid 11294 ax-rnegex 11295 ax-rrecex 11296 ax-cnre 11297 ax-pre-lttri 11298 ax-pre-lttrn 11299 ax-pre-ltadd 11300 ax-pre-mulgt0 11301

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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 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-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6319 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-riota 7397 df-ov 7443 df-oprab 7444 df-mpo 7445 df-om 7899 df-1st 8022 df-2nd 8023 df-frecs 8324 df-wrecs 8355 df-recs 8404 df-rdg 8443 df-er 8742 df-map 8874 df-en 8999 df-dom 9000 df-sdom 9001 df-pnf 11369 df-mnf 11370 df-xr 11371 df-ltxr 11372 df-le 11373 df-sub 11567 df-neg 11568 df-nn 12360 df-2 12429 df-3 12430 df-4 12431 df-5 12432 df-6 12433 df-n0 12631 df-z 12718 df-uz 12990 df-fz 13664 df-seq 14169 df-exp 14229 df-veronese 51247

This theorem is used by: veronesevrowd 51257 veroquadgsumlem 51261

W3C validator