Theorem plyexmo 23872

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 788	. . . . . . . . 9 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ¬ 𝐷 ∈ Fin)
2		simpll 786	. . . . . . . . . . . . . 14 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝐷 ⊆ ℂ)
3	2	sseld 3567	. . . . . . . . . . . . 13 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → 𝑏 ∈ ℂ))
4		simprll 798	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝 ∈ (Poly‘ℂ))
5		plyf 23758	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 ∈ (Poly‘ℂ) → 𝑝:ℂ⟶ℂ)
6	4, 5	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝:ℂ⟶ℂ)
7		ffn 5958	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑝:ℂ⟶ℂ → 𝑝 Fn ℂ)
8	6, 7	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝 Fn ℂ)
9	8	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑝 Fn ℂ)
10		simprrl 800	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑎 ∈ (Poly‘ℂ))
11		plyf 23758	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 ∈ (Poly‘ℂ) → 𝑎:ℂ⟶ℂ)
12	10, 11	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑎:ℂ⟶ℂ)
13		ffn 5958	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎:ℂ⟶ℂ → 𝑎 Fn ℂ)
14	12, 13	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑎 Fn ℂ)
15	14	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑎 Fn ℂ)
16		cnex 9896	. . . . . . . . . . . . . . . . 17 ⊢ ℂ ∈ V
17	16	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ℂ ∈ V)
18	2	sselda 3568	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑏 ∈ ℂ)
19		fnfvof 6809	. . . . . . . . . . . . . . . 16 ⊢ (((𝑝 Fn ℂ ∧ 𝑎 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑏 ∈ ℂ)) → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = ((𝑝‘𝑏) − (𝑎‘𝑏)))
20	9, 15, 17, 18, 19	syl22anc 1319	. . . . . . . . . . . . . . 15 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = ((𝑝‘𝑏) − (𝑎‘𝑏)))
21	6	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → 𝑝:ℂ⟶ℂ)
22	21, 18	ffvelrnd 6268	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → (𝑝‘𝑏) ∈ ℂ)
23		simprlr 799	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ↾ 𝐷) = 𝐹)
24		simprrr 801	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑎 ↾ 𝐷) = 𝐹)
25	23, 24	eqtr4d 2647	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ↾ 𝐷) = (𝑎 ↾ 𝐷))
26	25	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → (𝑝 ↾ 𝐷) = (𝑎 ↾ 𝐷))
27	26	fveq1d 6105	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ↾ 𝐷)‘𝑏) = ((𝑎 ↾ 𝐷)‘𝑏))
28		fvres 6117	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ 𝐷 → ((𝑝 ↾ 𝐷)‘𝑏) = (𝑝‘𝑏))
29	28	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ↾ 𝐷)‘𝑏) = (𝑝‘𝑏))
30		fvres 6117	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 ∈ 𝐷 → ((𝑎 ↾ 𝐷)‘𝑏) = (𝑎‘𝑏))
31	30	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑎 ↾ 𝐷)‘𝑏) = (𝑎‘𝑏))
32	27, 29, 31	3eqtr3d 2652	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → (𝑝‘𝑏) = (𝑎‘𝑏))
33	22, 32	subeq0bd 10335	. . . . . . . . . . . . . . 15 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝‘𝑏) − (𝑎‘𝑏)) = 0)
34	20, 33	eqtrd 2644	. . . . . . . . . . . . . 14 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ 𝑏 ∈ 𝐷) → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)
35	34	ex 449	. . . . . . . . . . . . 13 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0))
36	3, 35	jcad 554	. . . . . . . . . . . 12 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → (𝑏 ∈ ℂ ∧ ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)))
37		plysubcl 23782	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ (Poly‘ℂ) ∧ 𝑎 ∈ (Poly‘ℂ)) → (𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ))
38	4, 10, 37	syl2anc 691	. . . . . . . . . . . . 13 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ))
39		plyf 23758	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ) → (𝑝 ∘𝑓 − 𝑎):ℂ⟶ℂ)
40		ffn 5958	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∘𝑓 − 𝑎):ℂ⟶ℂ → (𝑝 ∘𝑓 − 𝑎) Fn ℂ)
41		fniniseg 6246	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∘𝑓 − 𝑎) Fn ℂ → (𝑏 ∈ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)))
42	38, 39, 40, 41	4syl 19	. . . . . . . . . . . 12 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝 ∘𝑓 − 𝑎)‘𝑏) = 0)))
43	36, 42	sylibrd 248	. . . . . . . . . . 11 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑏 ∈ 𝐷 → 𝑏 ∈ (◡(𝑝 ∘𝑓 − 𝑎) “ {0})))
44	43	ssrdv 3574	. . . . . . . . . 10 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝐷 ⊆ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}))
45		ssfi 8065	. . . . . . . . . . 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 188	. . . . . . . 8 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ¬ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin)
49		df-ne 2782	. . . . . . . . . . . 12 ⊢ ((𝑝 ∘𝑓 − 𝑎) ≠ 0𝑝 ↔ ¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝)
50	49	biimpri 217	. . . . . . . . . . 11 ⊢ (¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝 → (𝑝 ∘𝑓 − 𝑎) ≠ 0𝑝)
51		eqid 2610	. . . . . . . . . . . 12 ⊢ (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) = (◡(𝑝 ∘𝑓 − 𝑎) “ {0})
52	51	fta1 23867	. . . . . . . . . . 11 ⊢ (((𝑝 ∘𝑓 − 𝑎) ∈ (Poly‘ℂ) ∧ (𝑝 ∘𝑓 − 𝑎) ≠ 0𝑝) → ((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin ∧ (#‘(◡(𝑝 ∘𝑓 − 𝑎) “ {0})) ≤ (deg‘(𝑝 ∘𝑓 − 𝑎))))
53	38, 50, 52	syl2an 493	. . . . . . . . . 10 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ ¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝) → ((◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin ∧ (#‘(◡(𝑝 ∘𝑓 − 𝑎) “ {0})) ≤ (deg‘(𝑝 ∘𝑓 − 𝑎))))
54	53	simpld 474	. . . . . . . . 9 ⊢ ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) ∧ ¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝) → (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin)
55	54	ex 449	. . . . . . . 8 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (¬ (𝑝 ∘𝑓 − 𝑎) = 0𝑝 → (◡(𝑝 ∘𝑓 − 𝑎) “ {0}) ∈ Fin))
56	48, 55	mt3d 139	. . . . . . 7 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ∘𝑓 − 𝑎) = 0𝑝)
57		df-0p 23243	. . . . . . 7 ⊢ 0𝑝 = (ℂ × {0})
58	56, 57	syl6eq 2660	. . . . . 6 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → (𝑝 ∘𝑓 − 𝑎) = (ℂ × {0}))
59	16	a1i 11	. . . . . . 7 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ℂ ∈ V)
60		ofsubeq0 10894	. . . . . . 7 ⊢ ((ℂ ∈ V ∧ 𝑝:ℂ⟶ℂ ∧ 𝑎:ℂ⟶ℂ) → ((𝑝 ∘𝑓 − 𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
61	59, 6, 12, 60	syl3anc 1318	. . . . . 6 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → ((𝑝 ∘𝑓 − 𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
62	58, 61	mpbid 221	. . . . 5 ⊢ (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹))) → 𝑝 = 𝑎)
63	62	ex 449	. . . 4 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → (((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)) → 𝑝 = 𝑎))
64	63	alrimivv 1843	. . 3 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∀𝑝∀𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)) → 𝑝 = 𝑎))
65		eleq1 2676	. . . . 5 ⊢ (𝑝 = 𝑎 → (𝑝 ∈ (Poly‘ℂ) ↔ 𝑎 ∈ (Poly‘ℂ)))
66		reseq1 5311	. . . . . 6 ⊢ (𝑝 = 𝑎 → (𝑝 ↾ 𝐷) = (𝑎 ↾ 𝐷))
67	66	eqeq1d 2612	. . . . 5 ⊢ (𝑝 = 𝑎 → ((𝑝 ↾ 𝐷) = 𝐹 ↔ (𝑎 ↾ 𝐷) = 𝐹))
68	65, 67	anbi12d 743	. . . 4 ⊢ (𝑝 = 𝑎 → ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ↔ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)))
69	68	mo4 2505	. . 3 ⊢ (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ↔ ∀𝑝∀𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎 ↾ 𝐷) = 𝐹)) → 𝑝 = 𝑎))
70	64, 69	sylibr 223	. 2 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹))
71		plyssc 23760	. . . . 5 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ)
72	71	sseli 3564	. . . 4 ⊢ (𝑝 ∈ (Poly‘𝑆) → 𝑝 ∈ (Poly‘ℂ))
73	72	anim1i 590	. . 3 ⊢ ((𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹) → (𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹))
74	73	moimi 2508	. 2 ⊢ (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝 ↾ 𝐷) = 𝐹) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹))
75	70, 74	syl 17	1 ⊢ ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝 ↾ 𝐷) = 𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383  ∀wal 1473   = wceq 1475   ∈ wcel 1977  ∃*wmo 2459   ≠ wne 2780  Vcvv 3173   ⊆ wss 3540  {csn 4125   class class class wbr 4583   × cxp 5036  ^◡ccnv 5037   ↾ cres 5040   “ cima 5041   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ∘_𝑓 cof 6793  Fincfn 7841  ℂcc 9813  0cc0 9815   ≤ cle 9954   − cmin 10145  #chash 12979  0_𝑝c0p 23242  Polycply 23744  degcdgr 23747

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-inf2 8421  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892  ax-pre-sup 9893  ax-addf 9894

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-of 6795  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-sup 8231  df-inf 8232  df-oi 8298  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-div 10564  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-xnn0 11241  df-z 11255  df-uz 11564  df-rp 11709  df-fz 12198  df-fzo 12335  df-fl 12455  df-seq 12664  df-exp 12723  df-hash 12980  df-cj 13687  df-re 13688  df-im 13689  df-sqrt 13823  df-abs 13824  df-clim 14067  df-rlim 14068  df-sum 14265  df-0p 23243  df-ply 23748  df-idp 23749  df-coe 23750  df-dgr 23751  df-quot 23850

This theorem is referenced by: (None)