Theorem rnplynfin 26594

Description: The range of a nonconstant polynomial is not a finite set. (Contributed by SN, 30-Aug-2026.)

Hypotheses

Ref	Expression
rnplynfin.f	⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
rnplynfin.1	⊢ (𝜑 → (deg‘𝐹) ≠ 0)

Assertion

Ref	Expression
rnplynfin	⊢ (𝜑 → ¬ ran 𝐹 ∈ Fin)

Proof of Theorem rnplynfin

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rnplynfin.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
2		plyf 26478	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
3	1, 2	syl 18	. . . 4 ⊢ (𝜑 → 𝐹:ℂ⟶ℂ)
4	3	frnd 6706	. . 3 ⊢ (𝜑 → ran 𝐹 ⊆ ℂ)
5		plyssc 26480	. . . . . . . . . 10 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ)
6	5, 1	sselid 3928	. . . . . . . . 9 ⊢ (𝜑 → 𝐹 ∈ (Poly‘ℂ))
7	6	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐹 ∈ (Poly‘ℂ))
8		ssidd 3953	. . . . . . . . 9 ⊢ (𝜑 → ℂ ⊆ ℂ)
9		plyconst 26486	. . . . . . . . 9 ⊢ ((ℂ ⊆ ℂ ∧ 𝑥 ∈ ℂ) → (ℂ × {𝑥}) ∈ (Poly‘ℂ))
10	8, 9	sylan 592	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂ × {𝑥}) ∈ (Poly‘ℂ))
11		plysubcl 26503	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ (ℂ × {𝑥}) ∈ (Poly‘ℂ)) → (𝐹 ∘f − (ℂ × {𝑥})) ∈ (Poly‘ℂ))
12	7, 10, 11	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 ∘f − (ℂ × {𝑥})) ∈ (Poly‘ℂ))
13		rnplynfin.1	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (deg‘𝐹) ≠ 0)
14	13	neneqd 2960	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ¬ (deg‘𝐹) = 0)
15	14	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ¬ (deg‘𝐹) = 0)
16		0dgr 26526	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℂ → (deg‘(ℂ × {𝑥})) = 0)
17	16	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (deg‘(ℂ × {𝑥})) = 0)
18		fveqeq2 6882	. . . . . . . . . . . . . 14 ⊢ (𝐹 = (ℂ × {𝑥}) → ((deg‘𝐹) = 0 ↔ (deg‘(ℂ × {𝑥})) = 0))
19	17, 18	syl5ibrcom 250	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 = (ℂ × {𝑥}) → (deg‘𝐹) = 0))
20	15, 19	mtod 201	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ¬ 𝐹 = (ℂ × {𝑥}))
21		vex 3454	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
22	21	fconst2 7199	. . . . . . . . . . . 12 ⊢ (𝐹:ℂ⟶{𝑥} ↔ 𝐹 = (ℂ × {𝑥}))
23	20, 22	sylnibr 332	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ¬ 𝐹:ℂ⟶{𝑥})
24	3	ffnd 6698	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐹 Fn ℂ)
25	24	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝐹 Fn ℂ)
26	25	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥) → 𝐹 Fn ℂ)
27		simpr 490	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥) → ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥)
28		fconstfv 7206	. . . . . . . . . . . 12 ⊢ (𝐹:ℂ⟶{𝑥} ↔ (𝐹 Fn ℂ ∧ ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥))
29	26, 27, 28	sylanbrc 595	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥) → 𝐹:ℂ⟶{𝑥})
30	23, 29	mtand 828	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ¬ ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥)
31		rexnal 3114	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ ℂ ¬ (𝐹‘𝑦) = 𝑥 ↔ ¬ ∀𝑦 ∈ ℂ (𝐹‘𝑦) = 𝑥)
32	30, 31	sylibr 237	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∃𝑦 ∈ ℂ ¬ (𝐹‘𝑦) = 𝑥)
33		cnex 11253	. . . . . . . . . . . . . 14 ⊢ ℂ ∈ V
34	33	a1i 11	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ℂ ∈ V)
35		simpr 490	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → 𝑥 ∈ ℂ)
36		eqidd 2761	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (𝐹‘𝑦) = (𝐹‘𝑦))
37	34, 35, 25, 36	ofc2 7705	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = ((𝐹‘𝑦) − 𝑥))
38	37	neeq1d 3014	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) ≠ 0 ↔ ((𝐹‘𝑦) − 𝑥) ≠ 0))
39	3	ffvelcdmda 7072	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑦 ∈ ℂ) → (𝐹‘𝑦) ∈ ℂ)
40	39	adantlr 728	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (𝐹‘𝑦) ∈ ℂ)
41		simplr 781	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → 𝑥 ∈ ℂ)
42	40, 41	subeq0ad 11649	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (((𝐹‘𝑦) − 𝑥) = 0 ↔ (𝐹‘𝑦) = 𝑥))
43	42	necon3bid 2999	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (((𝐹‘𝑦) − 𝑥) ≠ 0 ↔ (𝐹‘𝑦) ≠ 𝑥))
44		df-ne 2956	. . . . . . . . . . . 12 ⊢ ((𝐹‘𝑦) ≠ 𝑥 ↔ ¬ (𝐹‘𝑦) = 𝑥)
45	44	a1i 11	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → ((𝐹‘𝑦) ≠ 𝑥 ↔ ¬ (𝐹‘𝑦) = 𝑥))
46	38, 43, 45	3bitrd 308	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) ≠ 0 ↔ ¬ (𝐹‘𝑦) = 𝑥))
47	46	rexbidva 3184	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (∃𝑦 ∈ ℂ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) ≠ 0 ↔ ∃𝑦 ∈ ℂ ¬ (𝐹‘𝑦) = 𝑥))
48	32, 47	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ∃𝑦 ∈ ℂ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) ≠ 0)
49		ne0p 26487	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℂ ∧ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) ≠ 0) → (𝐹 ∘f − (ℂ × {𝑥})) ≠ 0𝑝)
50	49	rexlimiva 3155	. . . . . . . 8 ⊢ (∃𝑦 ∈ ℂ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) ≠ 0 → (𝐹 ∘f − (ℂ × {𝑥})) ≠ 0𝑝)
51	48, 50	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 ∘f − (ℂ × {𝑥})) ≠ 0𝑝)
52		eqid 2760	. . . . . . . 8 ⊢ (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) = (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0})
53	52	fta1 26593	. . . . . . 7 ⊢ (((𝐹 ∘f − (ℂ × {𝑥})) ∈ (Poly‘ℂ) ∧ (𝐹 ∘f − (ℂ × {𝑥})) ≠ 0𝑝) → ((◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ∈ Fin ∧ (♯‘(◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0})) ≤ (deg‘(𝐹 ∘f − (ℂ × {𝑥})))))
54	12, 51, 53	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ∈ Fin ∧ (♯‘(◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0})) ≤ (deg‘(𝐹 ∘f − (ℂ × {𝑥})))))
55	54	simpld 500	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ∈ Fin)
56	55	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ℂ (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ∈ Fin)
57		fnconstg 6758	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ ℂ → (ℂ × {𝑥}) Fn ℂ)
58	57	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (ℂ × {𝑥}) Fn ℂ)
59		inidm 4171	. . . . . . . . . . . 12 ⊢ (ℂ ∩ ℂ) = ℂ
60	21	fvconst2 7198	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ ℂ → ((ℂ × {𝑥})‘𝑦) = 𝑥)
61	60	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → ((ℂ × {𝑥})‘𝑦) = 𝑥)
62	25, 58, 34, 34, 59, 36, 61	ofval 7687	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = ((𝐹‘𝑦) − 𝑥))
63	62	eqeq1d 2762	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = 0 ↔ ((𝐹‘𝑦) − 𝑥) = 0))
64	63, 42	bitrd 282	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℂ) ∧ 𝑦 ∈ ℂ) → (((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = 0 ↔ (𝐹‘𝑦) = 𝑥))
65	64	pm5.32da 590	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((𝑦 ∈ ℂ ∧ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = 0) ↔ (𝑦 ∈ ℂ ∧ (𝐹‘𝑦) = 𝑥)))
66	25, 58, 34, 34, 59	offn 7689	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝐹 ∘f − (ℂ × {𝑥})) Fn ℂ)
67		fniniseg 7047	. . . . . . . . 9 ⊢ ((𝐹 ∘f − (ℂ × {𝑥})) Fn ℂ → (𝑦 ∈ (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ↔ (𝑦 ∈ ℂ ∧ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = 0)))
68	66, 67	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑦 ∈ (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ↔ (𝑦 ∈ ℂ ∧ ((𝐹 ∘f − (ℂ × {𝑥}))‘𝑦) = 0)))
69		fniniseg 7047	. . . . . . . . 9 ⊢ (𝐹 Fn ℂ → (𝑦 ∈ (◡𝐹 “ {𝑥}) ↔ (𝑦 ∈ ℂ ∧ (𝐹‘𝑦) = 𝑥)))
70	25, 69	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑦 ∈ (◡𝐹 “ {𝑥}) ↔ (𝑦 ∈ ℂ ∧ (𝐹‘𝑦) = 𝑥)))
71	65, 68, 70	3bitr4d 314	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (𝑦 ∈ (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ↔ 𝑦 ∈ (◡𝐹 “ {𝑥})))
72	71	eqrdv 2758	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) = (◡𝐹 “ {𝑥}))
73	72	eleq1d 2845	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ ℂ) → ((◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ∈ Fin ↔ (◡𝐹 “ {𝑥}) ∈ Fin))
74	73	ralbidva 3183	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ ℂ (◡(𝐹 ∘f − (ℂ × {𝑥})) “ {0}) ∈ Fin ↔ ∀𝑥 ∈ ℂ (◡𝐹 “ {𝑥}) ∈ Fin))
75	56, 74	mpbid 235	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℂ (◡𝐹 “ {𝑥}) ∈ Fin)
76		ssralv 3999	. . 3 ⊢ (ran 𝐹 ⊆ ℂ → (∀𝑥 ∈ ℂ (◡𝐹 “ {𝑥}) ∈ Fin → ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin))
77	4, 75, 76	sylc 66	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin)
78	3	fdmd 6708	. . . . 5 ⊢ (𝜑 → dom 𝐹 = ℂ)
79		nnnfi 14078	. . . . . . 7 ⊢ ¬ ℕ ∈ Fin
80		nnsscn 12310	. . . . . . . 8 ⊢ ℕ ⊆ ℂ
81		ssfi 9166	. . . . . . . 8 ⊢ ((ℂ ∈ Fin ∧ ℕ ⊆ ℂ) → ℕ ∈ Fin)
82	80, 81	mpan2 704	. . . . . . 7 ⊢ (ℂ ∈ Fin → ℕ ∈ Fin)
83	79, 82	mto 200	. . . . . 6 ⊢ ¬ ℂ ∈ Fin
84	83	a1i 11	. . . . 5 ⊢ (𝜑 → ¬ ℂ ∈ Fin)
85	78, 84	eqneltrd 2880	. . . 4 ⊢ (𝜑 → ¬ dom 𝐹 ∈ Fin)
86	85	adantr 486	. . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) → ¬ dom 𝐹 ∈ Fin)
87	3	ffund 6702	. . . . . . 7 ⊢ (𝜑 → Fun 𝐹)
88		iunpreima 7056	. . . . . . 7 ⊢ (Fun 𝐹 → (◡𝐹 “ ∪ 𝑥 ∈ ran 𝐹{𝑥}) = ∪ 𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}))
89	87, 88	syl 18	. . . . . 6 ⊢ (𝜑 → (◡𝐹 “ ∪ 𝑥 ∈ ran 𝐹{𝑥}) = ∪ 𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}))
90		iunid 5018	. . . . . . . 8 ⊢ ∪ 𝑥 ∈ ran 𝐹{𝑥} = ran 𝐹
91	90	imaeq2i 6048	. . . . . . 7 ⊢ (◡𝐹 “ ∪ 𝑥 ∈ ran 𝐹{𝑥}) = (◡𝐹 “ ran 𝐹)
92		cnvimarndm 6073	. . . . . . 7 ⊢ (◡𝐹 “ ran 𝐹) = dom 𝐹
93	91, 92	eqtri 2783	. . . . . 6 ⊢ (◡𝐹 “ ∪ 𝑥 ∈ ran 𝐹{𝑥}) = dom 𝐹
94	89, 93	eqtr3di 2810	. . . . 5 ⊢ (𝜑 → ∪ 𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) = dom 𝐹)
95	94	ad2antrr 739	. . . 4 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) ∧ ran 𝐹 ∈ Fin) → ∪ 𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) = dom 𝐹)
96		simpr 490	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) ∧ ran 𝐹 ∈ Fin) → ran 𝐹 ∈ Fin)
97		simplr 781	. . . . 5 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) ∧ ran 𝐹 ∈ Fin) → ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin)
98		iunfi 9310	. . . . 5 ⊢ ((ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) → ∪ 𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin)
99	96, 97, 98	syl2anc 596	. . . 4 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) ∧ ran 𝐹 ∈ Fin) → ∪ 𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin)
100	95, 99	eqeltrrd 2861	. . 3 ⊢ (((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) ∧ ran 𝐹 ∈ Fin) → dom 𝐹 ∈ Fin)
101	86, 100	mtand 828	. 2 ⊢ ((𝜑 ∧ ∀𝑥 ∈ ran 𝐹(◡𝐹 “ {𝑥}) ∈ Fin) → ¬ ran 𝐹 ∈ Fin)
102	77, 101	mpdan 700	1 ⊢ (𝜑 → ¬ ran 𝐹 ∈ Fin)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3898  {csn 4583  ∪ ciun 4950   class class class wbr 5102   × cxp 5645  ^◡ccnv 5646  dom cdm 5647  ran crn 5648   “ cima 5650  Fun wfun 6521   Fn wfn 6522  ⟶wf 6523  ‘cfv 6527  (class class class)co 7408   ∘_f cof 7674  Fincfn 8951  ℂcc 11170  0cc0 11172   ≤ cle 11316   − cmin 11513  ℕcn 12305  ♯chash 14442  0_𝑝c0p 25952  Polycply 26464  degcdgr 26467

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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734  ax-inf2 9620  ax-cnex 11228  ax-resscn 11229  ax-1cn 11230  ax-icn 11231  ax-addcl 11232  ax-addrcl 11233  ax-mulcl 11234  ax-mulrcl 11235  ax-mulcom 11236  ax-addass 11237  ax-mulass 11238  ax-distr 11239  ax-i2m1 11240  ax-1ne0 11241  ax-1rid 11242  ax-rnegex 11243  ax-rrecex 11244  ax-cnre 11245  ax-pre-lttri 11246  ax-pre-lttrn 11247  ax-pre-ltadd 11248  ax-pre-mulgt0 11249  ax-pre-sup 11250

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-se 5601  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-isom 6536  df-riota 7365  df-ov 7411  df-oprab 7412  df-mpo 7413  df-of 7676  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-oadd 8458  df-er 8695  df-map 8827  df-pm 8828  df-en 8952  df-dom 8953  df-sdom 8954  df-fin 8955  df-sup 9412  df-inf 9413  df-oi 9482  df-dju 9954  df-card 9992  df-pnf 11317  df-mnf 11318  df-xr 11319  df-ltxr 11320  df-le 11321  df-sub 11515  df-neg 11516  df-div 11944  df-nn 12306  df-2 12375  df-3 12376  df-n0 12577  df-xnn0 12650  df-z 12664  df-uz 12936  df-rp 13091  df-fz 13610  df-fzo 13758  df-fl 13901  df-seq 14114  df-exp 14174  df-hash 14443  df-cj 15234  df-re 15235  df-im 15236  df-sqrt 15370  df-abs 15371  df-clim 15623  df-rlim 15624  df-sum 15822  df-0p 25953  df-ply 26468  df-idp 26469  df-coe 26470  df-dgr 26471  df-quot 26576

This theorem is used by:  plyconz  26595