Theorem plyexmo 24265

Description: An infinite set of values can be extended to a polynomial in at most one way. (Contributed by Stefan O'Rear, 14-Nov-2014.)

Assertion

Ref	Expression
plyexmo	⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹))

Distinct variable groups:   𝑆,𝑝   𝐹,𝑝   𝐷,𝑝

Proof of Theorem plyexmo

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 809	. . . . . . . . 9 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ¬ 𝐷 ∈ Fin)
2		simpll 807	. . . . . . . . . . . . . 14 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝐷 ⊆ ℂ)
3	2	sseld 3741	. . . . . . . . . . . . 13 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → 𝑏 ∈ ℂ))
4		simprll 821	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝 ∈ (Poly‘ℂ))
5		plyf 24151	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 ∈ (Poly‘ℂ) → 𝑝:ℂ⟶ℂ)
6	4, 5	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝:ℂ⟶ℂ)
7		ffn 6204	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑝:ℂ⟶ℂ → 𝑝 Fn ℂ)
8	6, 7	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝 Fn ℂ)
9	8	adantr 472	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑝 Fn ℂ)
10		simprrl 823	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑎 ∈ (Poly‘ℂ))
11		plyf 24151	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ (Poly‘ℂ) → 𝑎:ℂ⟶ℂ)
12	10, 11	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑎:ℂ⟶ℂ)
13		ffn 6204	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎:ℂ⟶ℂ → 𝑎 Fn ℂ)
14	12, 13	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑎 Fn ℂ)
15	14	adantr 472	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑎 Fn ℂ)
16		cnex 10207	. . . . . . . . . . . . . . . . 17 ⊢ ℂ ∈ V
17	16	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ℂ ∈ V)
18	2	sselda 3742	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑏 ∈ ℂ)
19		fnfvof 7074	. . . . . . . . . . . . . . . 16 ⊢ (((𝑝 Fn ℂ ∧ 𝑎 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑏 ∈ ℂ)) → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = ((𝑝‘𝑏) − (𝑎‘𝑏)))
20	9, 15, 17, 18, 19	syl22anc 1478	. . . . . . . . . . . . . . 15 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = ((𝑝‘𝑏) − (𝑎‘𝑏)))
21	6	adantr 472	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑝:ℂ⟶ℂ)
22	21, 18	ffvelrnd 6521	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → (𝑝‘𝑏) ∈ ℂ)
23		simprlr 822	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ↾ 𝐷) = 𝐹)
24		simprrr 824	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑎 ↾ 𝐷) = 𝐹)
25	23, 24	eqtr4d 2795	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ↾ 𝐷) = (𝑎 ↾ 𝐷))
26	25	adantr 472	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → (𝑝 ↾ 𝐷) = (𝑎 ↾ 𝐷))
27	26	fveq1d 6352	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ↾ 𝐷)‘𝑏) = ((𝑎 ↾ 𝐷)‘𝑏))
28		fvres 6366	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ 𝐷 → ((𝑝 ↾ 𝐷)‘𝑏) = (𝑝‘𝑏))
29	28	adantl 473	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ↾ 𝐷)‘𝑏) = (𝑝‘𝑏))
30		fvres 6366	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ 𝐷 → ((𝑎 ↾ 𝐷)‘𝑏) = (𝑎‘𝑏))
31	30	adantl 473	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑎 ↾ 𝐷)‘𝑏) = (𝑎‘𝑏))
32	27, 29, 31	3eqtr3d 2800	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → (𝑝‘𝑏) = (𝑎‘𝑏))
33	22, 32	subeq0bd 10646	. . . . . . . . . . . . . . 15 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝‘𝑏) − (𝑎‘𝑏)) = 0)
34	20, 33	eqtrd 2792	. . . . . . . . . . . . . 14 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)
35	34	ex 449	. . . . . . . . . . . . 13 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0))
36	3, 35	jcad 556	. . . . . . . . . . . 12 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → (𝑏 ∈ ℂ ∧ ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)))
37		plysubcl 24175	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ (Poly‘ℂ) ∧ 𝑎 ∈ (Poly‘ℂ)) → (𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ))
38	4, 10, 37	syl2anc 696	. . . . . . . . . . . . 13 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ))
39		plyf 24151	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ) → (𝑝 ∘𝑓 − 𝑎):ℂ⟶ℂ)
40		ffn 6204	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∘𝑓 − 𝑎):ℂ⟶ℂ → (𝑝 ∘𝑓 − 𝑎) Fn ℂ)
41		fniniseg 6499	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∘𝑓 − 𝑎) Fn ℂ → (𝑏 ∈ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)))
42	38, 39, 40, 41	4syl 19	. . . . . . . . . . . 12 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)))
43	36, 42	sylibrd 249	. . . . . . . . . . 11 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → 𝑏 ∈ (◡(𝑝 ∘𝑓 − 𝑎) “ {0})))
44	43	ssrdv 3748	. . . . . . . . . 10 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝐷 ⊆ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}))
45		ssfi 8343	. . . . . . . . . . 11 ⊢ (((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin ∧ 𝐷 ⊆ (◡(𝑝 ∘𝑓 − 𝑎) “ {0})) → 𝐷 ∈ Fin)
46	45	expcom 450	. . . . . . . . . 10 ⊢ (𝐷 ⊆ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) → ((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
47	44, 46	syl 17	. . . . . . . . 9 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
48	1, 47	mtod 189	. . . . . . . 8 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ¬ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin)
49		df-ne 2931	. . . . . . . . . . . 12 ⊢ ((𝑝 ∘𝑓 − 𝑎) ≠ 0𝑝 ↔ ¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝)
50	49	biimpri 218	. . . . . . . . . . 11 ⊢ (¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝 → (𝑝 ∘𝑓 − 𝑎) ≠ 0𝑝)
51		eqid 2758	. . . . . . . . . . . 12 ⊢ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) = (◡(𝑝 ∘𝑓 − 𝑎) “ {0})
52	51	fta1 24260	. . . . . . . . . . 11 ⊢ (((𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ) ∧ (𝑝 ∘𝑓 − 𝑎) ≠ 0𝑝) → ((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin ∧ (♯‘(◡(𝑝 ∘𝑓 − 𝑎) “ {0})) ≤ (deg‘(𝑝 ∘𝑓 − 𝑎))))
53	38, 50, 52	syl2an 495	. . . . . . . . . 10 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ ¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝) → ((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin ∧ (♯‘(◡(𝑝 ∘𝑓 − 𝑎) “ {0})) ≤ (deg‘(𝑝 ∘𝑓 − 𝑎))))
54	53	simpld 477	. . . . . . . . 9 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ ¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝) → (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin)
55	54	ex 449	. . . . . . . 8 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝 → (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin))
56	48, 55	mt3d 140	. . . . . . 7 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ∘𝑓 − 𝑎) = 0𝑝)
57		df-0p 23634	. . . . . . 7 ⊢ 0𝑝 = (ℂ × {0})
58	56, 57	syl6eq 2808	. . . . . 6 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ∘𝑓 − 𝑎) = (ℂ × {0}))
59	16	a1i 11	. . . . . . 7 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ℂ ∈ V)
60		ofsubeq0 11207	. . . . . . 7 ⊢ ((ℂ ∈ V ∧ 𝑝:ℂ⟶ℂ ∧ 𝑎:ℂ⟶ℂ) → ((𝑝 ∘𝑓 − 𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
61	59, 6, 12, 60	syl3anc 1477	. . . . . 6 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ((𝑝 ∘𝑓 − 𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
62	58, 61	mpbid 222	. . . . 5 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝 = 𝑎)
63	62	ex 449	. . . 4 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → (((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)) → 𝑝 = 𝑎))
64	63	alrimivv 2003	. . 3 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∀𝑝∀𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)) → 𝑝 = 𝑎))
65		eleq1w 2820	. . . . 5 ⊢ (𝑝 = 𝑎 → (𝑝 ∈ (Poly‘ℂ) ↔ 𝑎 ∈ (Poly‘ℂ)))
66		reseq1 5543	. . . . . 6 ⊢ (𝑝 = 𝑎 → (𝑝 ↾ 𝐷) = (𝑎 ↾ 𝐷))
67	66	eqeq1d 2760	. . . . 5 ⊢ (𝑝 = 𝑎 → ((𝑝 ↾ 𝐷) = 𝐹 ↔ (𝑎 ↾ 𝐷) = 𝐹))
68	65, 67	anbi12d 749	. . . 4 ⊢ (𝑝 = 𝑎 → ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ↔ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)))
69	68	mo4 2653	. . 3 ⊢ (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ↔ ∀𝑝∀𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)) → 𝑝 = 𝑎))
70	64, 69	sylibr 224	. 2 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹))
71		plyssc 24153	. . . . 5 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ)
72	71	sseli 3738	. . . 4 ⊢ (𝑝 ∈ (Poly‘𝑆) → 𝑝 ∈ (Poly‘ℂ))
73	72	anim1i 593	. . 3 ⊢ ((𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹) → (𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹))
74	73	moimi 2656	. 2 ⊢ (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹))
75	70, 74	syl 17	1 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 383  ∀wal 1628   = wceq 1630   ∈ wcel 2137  ∃*wmo 2606   ≠ wne 2930  Vcvv 3338   ⊆ wss 3713  {csn 4319   class class class wbr 4802   × cxp 5262  ^◡ccnv 5263   ↾ cres 5266   “ cima 5267   Fn wfn 6042  ⟶wf 6043  ‘cfv 6047  (class class class)co 6811   ∘_𝑓 cof 7058  Fincfn 8119  ℂcc 10124  0cc0 10126   ≤ cle 10265   − cmin 10456  ♯chash 13309  0_𝑝c0p 23633  Polycply 24137  degcdgr 24140

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1986  ax-6 2052  ax-7 2088  ax-8 2139  ax-9 2146  ax-10 2166  ax-11 2181  ax-12 2194  ax-13 2389  ax-ext 2738  ax-rep 4921  ax-sep 4931  ax-nul 4939  ax-pow 4990  ax-pr 5053  ax-un 7112  ax-inf2 8709  ax-cnex 10182  ax-resscn 10183  ax-1cn 10184  ax-icn 10185  ax-addcl 10186  ax-addrcl 10187  ax-mulcl 10188  ax-mulrcl 10189  ax-mulcom 10190  ax-addass 10191  ax-mulass 10192  ax-distr 10193  ax-i2m1 10194  ax-1ne0 10195  ax-1rid 10196  ax-rnegex 10197  ax-rrecex 10198  ax-cnre 10199  ax-pre-lttri 10200  ax-pre-lttrn 10201  ax-pre-ltadd 10202  ax-pre-mulgt0 10203  ax-pre-sup 10204  ax-addf 10205

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1633  df-fal 1636  df-ex 1852  df-nf 1857  df-sb 2045  df-eu 2609  df-mo 2610  df-clab 2745  df-cleq 2751  df-clel 2754  df-nfc 2889  df-ne 2931  df-nel 3034  df-ral 3053  df-rex 3054  df-reu 3055  df-rmo 3056  df-rab 3057  df-v 3340  df-sbc 3575  df-csb 3673  df-dif 3716  df-un 3718  df-in 3720  df-ss 3727  df-pss 3729  df-nul 4057  df-if 4229  df-pw 4302  df-sn 4320  df-pr 4322  df-tp 4324  df-op 4326  df-uni 4587  df-int 4626  df-iun 4672  df-br 4803  df-opab 4863  df-mpt 4880  df-tr 4903  df-id 5172  df-eprel 5177  df-po 5185  df-so 5186  df-fr 5223  df-se 5224  df-we 5225  df-xp 5270  df-rel 5271  df-cnv 5272  df-co 5273  df-dm 5274  df-rn 5275  df-res 5276  df-ima 5277  df-pred 5839  df-ord 5885  df-on 5886  df-lim 5887  df-suc 5888  df-iota 6010  df-fun 6049  df-fn 6050  df-f 6051  df-f1 6052  df-fo 6053  df-f1o 6054  df-fv 6055  df-isom 6056  df-riota 6772  df-ov 6814  df-oprab 6815  df-mpt2 6816  df-of 7060  df-om 7229  df-1st 7331  df-2nd 7332  df-wrecs 7574  df-recs 7635  df-rdg 7673  df-1o 7727  df-oadd 7731  df-er 7909  df-map 8023  df-pm 8024  df-en 8120  df-dom 8121  df-sdom 8122  df-fin 8123  df-sup 8511  df-inf 8512  df-oi 8578  df-card 8953  df-cda 9180  df-pnf 10266  df-mnf 10267  df-xr 10268  df-ltxr 10269  df-le 10270  df-sub 10458  df-neg 10459  df-div 10875  df-nn 11211  df-2 11269  df-3 11270  df-n0 11483  df-xnn0 11554  df-z 11568  df-uz 11878  df-rp 12024  df-fz 12518  df-fzo 12658  df-fl 12785  df-seq 12994  df-exp 13053  df-hash 13310  df-cj 14036  df-re 14037  df-im 14038  df-sqrt 14172  df-abs 14173  df-clim 14416  df-rlim 14417  df-sum 14614  df-0p 23634  df-ply 24141  df-idp 24142  df-coe 24143  df-dgr 24144  df-quot 24243

This theorem is referenced by: (None)