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

Theorem plyexmo 26294
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 769 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ 𝐷 ∈ Fin)
2 simpll 767 . . . . . . . . . . . . . 14 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ℂ)
32sseld 3934 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ℂ))
4 simprll 779 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 ∈ (Poly‘ℂ))
5 plyf 26176 . . . . . . . . . . . . . . . . . . 19 (𝑝 ∈ (Poly‘ℂ) → 𝑝:ℂ⟶ℂ)
64, 5syl 17 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝:ℂ⟶ℂ)
76ffnd 6673 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 Fn ℂ)
87adantr 480 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝 Fn ℂ)
9 simprrl 781 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 ∈ (Poly‘ℂ))
10 plyf 26176 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (Poly‘ℂ) → 𝑎:ℂ⟶ℂ)
119, 10syl 17 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎:ℂ⟶ℂ)
1211ffnd 6673 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 Fn ℂ)
1312adantr 480 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑎 Fn ℂ)
14 cnex 11121 . . . . . . . . . . . . . . . . 17 ℂ ∈ V
1514a1i 11 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ℂ ∈ V)
162sselda 3935 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑏 ∈ ℂ)
17 fnfvof 7651 . . . . . . . . . . . . . . . 16 (((𝑝 Fn ℂ ∧ 𝑎 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑏 ∈ ℂ)) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
188, 13, 15, 16, 17syl22anc 839 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
196adantr 480 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝:ℂ⟶ℂ)
2019, 16ffvelcdmd 7041 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) ∈ ℂ)
21 simprlr 780 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = 𝐹)
22 simprrr 782 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑎𝐷) = 𝐹)
2321, 22eqtr4d 2775 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = (𝑎𝐷))
2423adantr 480 . . . . . . . . . . . . . . . . . 18 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝐷) = (𝑎𝐷))
2524fveq1d 6846 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = ((𝑎𝐷)‘𝑏))
26 fvres 6863 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
2726adantl 481 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
28 fvres 6863 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
2928adantl 481 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
3025, 27, 293eqtr3d 2780 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) = (𝑎𝑏))
3120, 30subeq0bd 11577 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝑏) − (𝑎𝑏)) = 0)
3218, 31eqtrd 2772 . . . . . . . . . . . . . 14 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = 0)
3332ex 412 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷 → ((𝑝f𝑎)‘𝑏) = 0))
343, 33jcad 512 . . . . . . . . . . . 12 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷 → (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
35 plysubcl 26200 . . . . . . . . . . . . . 14 ((𝑝 ∈ (Poly‘ℂ) ∧ 𝑎 ∈ (Poly‘ℂ)) → (𝑝f𝑎) ∈ (Poly‘ℂ))
364, 9, 35syl2anc 585 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) ∈ (Poly‘ℂ))
37 plyf 26176 . . . . . . . . . . . . 13 ((𝑝f𝑎) ∈ (Poly‘ℂ) → (𝑝f𝑎):ℂ⟶ℂ)
38 ffn 6672 . . . . . . . . . . . . 13 ((𝑝f𝑎):ℂ⟶ℂ → (𝑝f𝑎) Fn ℂ)
39 fniniseg 7016 . . . . . . . . . . . . 13 ((𝑝f𝑎) Fn ℂ → (𝑏 ∈ ((𝑝f𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
4036, 37, 38, 394syl 19 . . . . . . . . . . . 12 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏 ∈ ((𝑝f𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
4134, 40sylibrd 259 . . . . . . . . . . 11 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ((𝑝f𝑎) “ {0})))
4241ssrdv 3941 . . . . . . . . . 10 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ((𝑝f𝑎) “ {0}))
43 ssfi 9111 . . . . . . . . . . 11 ((((𝑝f𝑎) “ {0}) ∈ Fin ∧ 𝐷 ⊆ ((𝑝f𝑎) “ {0})) → 𝐷 ∈ Fin)
4443expcom 413 . . . . . . . . . 10 (𝐷 ⊆ ((𝑝f𝑎) “ {0}) → (((𝑝f𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
4542, 44syl 17 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (((𝑝f𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
461, 45mtod 198 . . . . . . . 8 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ ((𝑝f𝑎) “ {0}) ∈ Fin)
47 neqne 2941 . . . . . . . . . . 11 (¬ (𝑝f𝑎) = 0𝑝 → (𝑝f𝑎) ≠ 0𝑝)
48 eqid 2737 . . . . . . . . . . . 12 ((𝑝f𝑎) “ {0}) = ((𝑝f𝑎) “ {0})
4948fta1 26289 . . . . . . . . . . 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 494 . . . . . . . . 9 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ ¬ (𝑝f𝑎) = 0𝑝) → ((𝑝f𝑎) “ {0}) ∈ Fin)
5251ex 412 . . . . . . . 8 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (¬ (𝑝f𝑎) = 0𝑝 → ((𝑝f𝑎) “ {0}) ∈ Fin))
5346, 52mt3d 148 . . . . . . 7 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = 0𝑝)
54 df-0p 25644 . . . . . . 7 0𝑝 = (ℂ × {0})
5553, 54eqtrdi 2788 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = (ℂ × {0}))
56 ofsubeq0 12156 . . . . . . 7 ((ℂ ∈ V ∧ 𝑝:ℂ⟶ℂ ∧ 𝑎:ℂ⟶ℂ) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5714, 6, 11, 56mp3an2i 1469 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5855, 57mpbid 232 . . . . 5 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 = 𝑎)
5958ex 412 . . . 4 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → (((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6059alrimivv 1930 . . 3 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
61 eleq1w 2820 . . . . 5 (𝑝 = 𝑎 → (𝑝 ∈ (Poly‘ℂ) ↔ 𝑎 ∈ (Poly‘ℂ)))
62 reseq1 5942 . . . . . 6 (𝑝 = 𝑎 → (𝑝𝐷) = (𝑎𝐷))
6362eqeq1d 2739 . . . . 5 (𝑝 = 𝑎 → ((𝑝𝐷) = 𝐹 ↔ (𝑎𝐷) = 𝐹))
6461, 63anbi12d 633 . . . 4 (𝑝 = 𝑎 → ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)))
6564mo4 2567 . . 3 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6660, 65sylibr 234 . 2 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
67 plyssc 26178 . . . . 5 (Poly‘𝑆) ⊆ (Poly‘ℂ)
6867sseli 3931 . . . 4 (𝑝 ∈ (Poly‘𝑆) → 𝑝 ∈ (Poly‘ℂ))
6968anim1i 616 . . 3 ((𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹) → (𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
7069moimi 2546 . 2 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹))
7166, 70syl 17 1 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1540   = wceq 1542  wcel 2114  ∃*wmo 2538  wne 2933  Vcvv 3442  wss 3903  {csn 4582   class class class wbr 5100   × cxp 5632  ccnv 5633  cres 5636  cima 5637   Fn wfn 6497  wf 6498  cfv 6502  (class class class)co 7370  f cof 7632  Fincfn 8897  cc 11038  0cc0 11040  cle 11181  cmin 11378  chash 14267  0𝑝c0p 25643  Polycply 26162  degcdgr 26165
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381  ax-un 7692  ax-inf2 9564  ax-cnex 11096  ax-resscn 11097  ax-1cn 11098  ax-icn 11099  ax-addcl 11100  ax-addrcl 11101  ax-mulcl 11102  ax-mulrcl 11103  ax-mulcom 11104  ax-addass 11105  ax-mulass 11106  ax-distr 11107  ax-i2m1 11108  ax-1ne0 11109  ax-1rid 11110  ax-rnegex 11111  ax-rrecex 11112  ax-cnre 11113  ax-pre-lttri 11114  ax-pre-lttrn 11115  ax-pre-ltadd 11116  ax-pre-mulgt0 11117  ax-pre-sup 11118
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5529  df-eprel 5534  df-po 5542  df-so 5543  df-fr 5587  df-se 5588  df-we 5589  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-pred 6269  df-ord 6330  df-on 6331  df-lim 6332  df-suc 6333  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-isom 6511  df-riota 7327  df-ov 7373  df-oprab 7374  df-mpo 7375  df-of 7634  df-om 7821  df-1st 7945  df-2nd 7946  df-frecs 8235  df-wrecs 8266  df-recs 8315  df-rdg 8353  df-1o 8409  df-oadd 8413  df-er 8647  df-map 8779  df-pm 8780  df-en 8898  df-dom 8899  df-sdom 8900  df-fin 8901  df-sup 9359  df-inf 9360  df-oi 9429  df-dju 9827  df-card 9865  df-pnf 11182  df-mnf 11183  df-xr 11184  df-ltxr 11185  df-le 11186  df-sub 11380  df-neg 11381  df-div 11809  df-nn 12160  df-2 12222  df-3 12223  df-n0 12416  df-xnn0 12489  df-z 12503  df-uz 12766  df-rp 12920  df-fz 13438  df-fzo 13585  df-fl 13726  df-seq 13939  df-exp 13999  df-hash 14268  df-cj 15036  df-re 15037  df-im 15038  df-sqrt 15172  df-abs 15173  df-clim 15425  df-rlim 15426  df-sum 15624  df-0p 25644  df-ply 26166  df-idp 26167  df-coe 26168  df-dgr 26169  df-quot 26272
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator