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

Theorem plyexmo 26221
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 768 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ 𝐷 ∈ Fin)
2 simpll 766 . . . . . . . . . . . . . 14 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ℂ)
32sseld 3945 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ℂ))
4 simprll 778 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 ∈ (Poly‘ℂ))
5 plyf 26103 . . . . . . . . . . . . . . . . . . 19 (𝑝 ∈ (Poly‘ℂ) → 𝑝:ℂ⟶ℂ)
64, 5syl 17 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝:ℂ⟶ℂ)
76ffnd 6689 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 Fn ℂ)
87adantr 480 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝 Fn ℂ)
9 simprrl 780 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 ∈ (Poly‘ℂ))
10 plyf 26103 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (Poly‘ℂ) → 𝑎:ℂ⟶ℂ)
119, 10syl 17 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎:ℂ⟶ℂ)
1211ffnd 6689 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 Fn ℂ)
1312adantr 480 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑎 Fn ℂ)
14 cnex 11149 . . . . . . . . . . . . . . . . 17 ℂ ∈ V
1514a1i 11 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ℂ ∈ V)
162sselda 3946 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑏 ∈ ℂ)
17 fnfvof 7670 . . . . . . . . . . . . . . . 16 (((𝑝 Fn ℂ ∧ 𝑎 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑏 ∈ ℂ)) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
188, 13, 15, 16, 17syl22anc 838 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
196adantr 480 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝:ℂ⟶ℂ)
2019, 16ffvelcdmd 7057 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) ∈ ℂ)
21 simprlr 779 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = 𝐹)
22 simprrr 781 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑎𝐷) = 𝐹)
2321, 22eqtr4d 2767 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = (𝑎𝐷))
2423adantr 480 . . . . . . . . . . . . . . . . . 18 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝐷) = (𝑎𝐷))
2524fveq1d 6860 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = ((𝑎𝐷)‘𝑏))
26 fvres 6877 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
2726adantl 481 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
28 fvres 6877 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
2928adantl 481 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
3025, 27, 293eqtr3d 2772 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) = (𝑎𝑏))
3120, 30subeq0bd 11604 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝑏) − (𝑎𝑏)) = 0)
3218, 31eqtrd 2764 . . . . . . . . . . . . . 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 26127 . . . . . . . . . . . . . 14 ((𝑝 ∈ (Poly‘ℂ) ∧ 𝑎 ∈ (Poly‘ℂ)) → (𝑝f𝑎) ∈ (Poly‘ℂ))
364, 9, 35syl2anc 584 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) ∈ (Poly‘ℂ))
37 plyf 26103 . . . . . . . . . . . . 13 ((𝑝f𝑎) ∈ (Poly‘ℂ) → (𝑝f𝑎):ℂ⟶ℂ)
38 ffn 6688 . . . . . . . . . . . . 13 ((𝑝f𝑎):ℂ⟶ℂ → (𝑝f𝑎) Fn ℂ)
39 fniniseg 7032 . . . . . . . . . . . . 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 3952 . . . . . . . . . 10 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ((𝑝f𝑎) “ {0}))
43 ssfi 9137 . . . . . . . . . . 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 2933 . . . . . . . . . . 11 (¬ (𝑝f𝑎) = 0𝑝 → (𝑝f𝑎) ≠ 0𝑝)
48 eqid 2729 . . . . . . . . . . . 12 ((𝑝f𝑎) “ {0}) = ((𝑝f𝑎) “ {0})
4948fta1 26216 . . . . . . . . . . 11 (((𝑝f𝑎) ∈ (Poly‘ℂ) ∧ (𝑝f𝑎) ≠ 0𝑝) → (((𝑝f𝑎) “ {0}) ∈ Fin ∧ (♯‘((𝑝f𝑎) “ {0})) ≤ (deg‘(𝑝f𝑎))))
5036, 47, 49syl2an 596 . . . . . . . . . 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 25571 . . . . . . 7 0𝑝 = (ℂ × {0})
5553, 54eqtrdi 2780 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = (ℂ × {0}))
56 ofsubeq0 12183 . . . . . . 7 ((ℂ ∈ V ∧ 𝑝:ℂ⟶ℂ ∧ 𝑎:ℂ⟶ℂ) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5714, 6, 11, 56mp3an2i 1468 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5855, 57mpbid 232 . . . . 5 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 = 𝑎)
5958ex 412 . . . 4 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → (((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6059alrimivv 1928 . . 3 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
61 eleq1w 2811 . . . . 5 (𝑝 = 𝑎 → (𝑝 ∈ (Poly‘ℂ) ↔ 𝑎 ∈ (Poly‘ℂ)))
62 reseq1 5944 . . . . . 6 (𝑝 = 𝑎 → (𝑝𝐷) = (𝑎𝐷))
6362eqeq1d 2731 . . . . 5 (𝑝 = 𝑎 → ((𝑝𝐷) = 𝐹 ↔ (𝑎𝐷) = 𝐹))
6461, 63anbi12d 632 . . . 4 (𝑝 = 𝑎 → ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)))
6564mo4 2559 . . 3 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6660, 65sylibr 234 . 2 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
67 plyssc 26105 . . . . 5 (Poly‘𝑆) ⊆ (Poly‘ℂ)
6867sseli 3942 . . . 4 (𝑝 ∈ (Poly‘𝑆) → 𝑝 ∈ (Poly‘ℂ))
6968anim1i 615 . . 3 ((𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹) → (𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
7069moimi 2538 . 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 1538   = wceq 1540  wcel 2109  ∃*wmo 2531  wne 2925  Vcvv 3447  wss 3914  {csn 4589   class class class wbr 5107   × cxp 5636  ccnv 5637  cres 5640  cima 5641   Fn wfn 6506  wf 6507  cfv 6511  (class class class)co 7387  f cof 7651  Fincfn 8918  cc 11066  0cc0 11068  cle 11209  cmin 11405  chash 14295  0𝑝c0p 25570  Polycply 26089  degcdgr 26092
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-inf2 9594  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145  ax-pre-sup 11146
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-se 5592  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-isom 6520  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-of 7653  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-oadd 8438  df-er 8671  df-map 8801  df-pm 8802  df-en 8919  df-dom 8920  df-sdom 8921  df-fin 8922  df-sup 9393  df-inf 9394  df-oi 9463  df-dju 9854  df-card 9892  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-div 11836  df-nn 12187  df-2 12249  df-3 12250  df-n0 12443  df-xnn0 12516  df-z 12530  df-uz 12794  df-rp 12952  df-fz 13469  df-fzo 13616  df-fl 13754  df-seq 13967  df-exp 14027  df-hash 14296  df-cj 15065  df-re 15066  df-im 15067  df-sqrt 15201  df-abs 15202  df-clim 15454  df-rlim 15455  df-sum 15653  df-0p 25571  df-ply 26093  df-idp 26094  df-coe 26095  df-dgr 26096  df-quot 26199
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator