MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  plyexmo Structured version   Visualization version   GIF version

Theorem plyexmo 24904
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.
StepHypRef Expression
1 simplr 767 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ 𝐷 ∈ Fin)
2 simpll 765 . . . . . . . . . . . . . 14 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ℂ)
32sseld 3968 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ℂ))
4 simprll 777 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 ∈ (Poly‘ℂ))
5 plyf 24790 . . . . . . . . . . . . . . . . . . 19 (𝑝 ∈ (Poly‘ℂ) → 𝑝:ℂ⟶ℂ)
64, 5syl 17 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝:ℂ⟶ℂ)
76ffnd 6517 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 Fn ℂ)
87adantr 483 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝 Fn ℂ)
9 simprrl 779 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 ∈ (Poly‘ℂ))
10 plyf 24790 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (Poly‘ℂ) → 𝑎:ℂ⟶ℂ)
119, 10syl 17 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎:ℂ⟶ℂ)
1211ffnd 6517 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 Fn ℂ)
1312adantr 483 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑎 Fn ℂ)
14 cnex 10620 . . . . . . . . . . . . . . . . 17 ℂ ∈ V
1514a1i 11 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ℂ ∈ V)
162sselda 3969 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑏 ∈ ℂ)
17 fnfvof 7425 . . . . . . . . . . . . . . . 16 (((𝑝 Fn ℂ ∧ 𝑎 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑏 ∈ ℂ)) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
188, 13, 15, 16, 17syl22anc 836 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
196adantr 483 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝:ℂ⟶ℂ)
2019, 16ffvelrnd 6854 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) ∈ ℂ)
21 simprlr 778 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = 𝐹)
22 simprrr 780 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑎𝐷) = 𝐹)
2321, 22eqtr4d 2861 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = (𝑎𝐷))
2423adantr 483 . . . . . . . . . . . . . . . . . 18 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝐷) = (𝑎𝐷))
2524fveq1d 6674 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = ((𝑎𝐷)‘𝑏))
26 fvres 6691 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
2726adantl 484 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
28 fvres 6691 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
2928adantl 484 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
3025, 27, 293eqtr3d 2866 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) = (𝑎𝑏))
3120, 30subeq0bd 11068 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝑏) − (𝑎𝑏)) = 0)
3218, 31eqtrd 2858 . . . . . . . . . . . . . 14 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = 0)
3332ex 415 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷 → ((𝑝f𝑎)‘𝑏) = 0))
343, 33jcad 515 . . . . . . . . . . . 12 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷 → (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
35 plysubcl 24814 . . . . . . . . . . . . . 14 ((𝑝 ∈ (Poly‘ℂ) ∧ 𝑎 ∈ (Poly‘ℂ)) → (𝑝f𝑎) ∈ (Poly‘ℂ))
364, 9, 35syl2anc 586 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) ∈ (Poly‘ℂ))
37 plyf 24790 . . . . . . . . . . . . 13 ((𝑝f𝑎) ∈ (Poly‘ℂ) → (𝑝f𝑎):ℂ⟶ℂ)
38 ffn 6516 . . . . . . . . . . . . 13 ((𝑝f𝑎):ℂ⟶ℂ → (𝑝f𝑎) Fn ℂ)
39 fniniseg 6832 . . . . . . . . . . . . 13 ((𝑝f𝑎) Fn ℂ → (𝑏 ∈ ((𝑝f𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
4036, 37, 38, 394syl 19 . . . . . . . . . . . 12 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏 ∈ ((𝑝f𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
4134, 40sylibrd 261 . . . . . . . . . . 11 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ((𝑝f𝑎) “ {0})))
4241ssrdv 3975 . . . . . . . . . 10 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ((𝑝f𝑎) “ {0}))
43 ssfi 8740 . . . . . . . . . . 11 ((((𝑝f𝑎) “ {0}) ∈ Fin ∧ 𝐷 ⊆ ((𝑝f𝑎) “ {0})) → 𝐷 ∈ Fin)
4443expcom 416 . . . . . . . . . 10 (𝐷 ⊆ ((𝑝f𝑎) “ {0}) → (((𝑝f𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
4542, 44syl 17 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (((𝑝f𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
461, 45mtod 200 . . . . . . . 8 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ ((𝑝f𝑎) “ {0}) ∈ Fin)
47 neqne 3026 . . . . . . . . . . 11 (¬ (𝑝f𝑎) = 0𝑝 → (𝑝f𝑎) ≠ 0𝑝)
48 eqid 2823 . . . . . . . . . . . 12 ((𝑝f𝑎) “ {0}) = ((𝑝f𝑎) “ {0})
4948fta1 24899 . . . . . . . . . . 11 (((𝑝f𝑎) ∈ (Poly‘ℂ) ∧ (𝑝f𝑎) ≠ 0𝑝) → (((𝑝f𝑎) “ {0}) ∈ Fin ∧ (♯‘((𝑝f𝑎) “ {0})) ≤ (deg‘(𝑝f𝑎))))
5036, 47, 49syl2an 597 . . . . . . . . . 10 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ ¬ (𝑝f𝑎) = 0𝑝) → (((𝑝f𝑎) “ {0}) ∈ Fin ∧ (♯‘((𝑝f𝑎) “ {0})) ≤ (deg‘(𝑝f𝑎))))
5150simpld 497 . . . . . . . . 9 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ ¬ (𝑝f𝑎) = 0𝑝) → ((𝑝f𝑎) “ {0}) ∈ Fin)
5251ex 415 . . . . . . . 8 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (¬ (𝑝f𝑎) = 0𝑝 → ((𝑝f𝑎) “ {0}) ∈ Fin))
5346, 52mt3d 150 . . . . . . 7 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = 0𝑝)
54 df-0p 24273 . . . . . . 7 0𝑝 = (ℂ × {0})
5553, 54syl6eq 2874 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = (ℂ × {0}))
56 ofsubeq0 11637 . . . . . . 7 ((ℂ ∈ V ∧ 𝑝:ℂ⟶ℂ ∧ 𝑎:ℂ⟶ℂ) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5714, 6, 11, 56mp3an2i 1462 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5855, 57mpbid 234 . . . . 5 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 = 𝑎)
5958ex 415 . . . 4 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → (((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6059alrimivv 1929 . . 3 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
61 eleq1w 2897 . . . . 5 (𝑝 = 𝑎 → (𝑝 ∈ (Poly‘ℂ) ↔ 𝑎 ∈ (Poly‘ℂ)))
62 reseq1 5849 . . . . . 6 (𝑝 = 𝑎 → (𝑝𝐷) = (𝑎𝐷))
6362eqeq1d 2825 . . . . 5 (𝑝 = 𝑎 → ((𝑝𝐷) = 𝐹 ↔ (𝑎𝐷) = 𝐹))
6461, 63anbi12d 632 . . . 4 (𝑝 = 𝑎 → ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)))
6564mo4 2650 . . 3 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6660, 65sylibr 236 . 2 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
67 plyssc 24792 . . . . 5 (Poly‘𝑆) ⊆ (Poly‘ℂ)
6867sseli 3965 . . . 4 (𝑝 ∈ (Poly‘𝑆) → 𝑝 ∈ (Poly‘ℂ))
6968anim1i 616 . . 3 ((𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹) → (𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
7069moimi 2627 . 2 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹))
7166, 70syl 17 1 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 398  wal 1535   = wceq 1537  wcel 2114  ∃*wmo 2620  wne 3018  Vcvv 3496  wss 3938  {csn 4569   class class class wbr 5068   × cxp 5555  ccnv 5556  cres 5559  cima 5560   Fn wfn 6352  wf 6353  cfv 6357  (class class class)co 7158  f cof 7409  Fincfn 8511  cc 10537  0cc0 10539  cle 10678  cmin 10872  chash 13693  0𝑝c0p 24272  Polycply 24776  degcdgr 24779
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-inf2 9106  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616  ax-pre-sup 10617  ax-addf 10618
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-of 7411  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-sup 8908  df-inf 8909  df-oi 8976  df-dju 9332  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-div 11300  df-nn 11641  df-2 11703  df-3 11704  df-n0 11901  df-xnn0 11971  df-z 11985  df-uz 12247  df-rp 12393  df-fz 12896  df-fzo 13037  df-fl 13165  df-seq 13373  df-exp 13433  df-hash 13694  df-cj 14460  df-re 14461  df-im 14462  df-sqrt 14596  df-abs 14597  df-clim 14847  df-rlim 14848  df-sum 15045  df-0p 24273  df-ply 24780  df-idp 24781  df-coe 24782  df-dgr 24783  df-quot 24882
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator