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

Theorem plyexmo 26544
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 781 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ 𝐷 ∈ Fin)
2 simpll 779 . . . . . . . . . . . . . 14 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ℂ)
32sseld 3933 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ℂ))
4 simprll 791 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 ∈ (Poly‘ℂ))
5 plyf 26425 . . . . . . . . . . . . . . . . . . 19 (𝑝 ∈ (Poly‘ℂ) → 𝑝:ℂ⟶ℂ)
64, 5syl 18 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝:ℂ⟶ℂ)
76ffnd 6707 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 Fn ℂ)
87adantr 486 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝 Fn ℂ)
9 simprrl 793 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 ∈ (Poly‘ℂ))
10 plyf 26425 . . . . . . . . . . . . . . . . . . 19 (𝑎 ∈ (Poly‘ℂ) → 𝑎:ℂ⟶ℂ)
119, 10syl 18 . . . . . . . . . . . . . . . . . 18 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎:ℂ⟶ℂ)
1211ffnd 6707 . . . . . . . . . . . . . . . . 17 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑎 Fn ℂ)
1312adantr 486 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑎 Fn ℂ)
14 cnex 11208 . . . . . . . . . . . . . . . . 17 ℂ ∈ V
1514a1i 11 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ℂ ∈ V)
162sselda 3934 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑏 ∈ ℂ)
17 fnfvof 7698 . . . . . . . . . . . . . . . 16 (((𝑝 Fn ℂ ∧ 𝑎 Fn ℂ) ∧ (ℂ ∈ V ∧ 𝑏 ∈ ℂ)) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
188, 13, 15, 16, 17syl22anc 852 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = ((𝑝𝑏) − (𝑎𝑏)))
196adantr 486 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → 𝑝:ℂ⟶ℂ)
2019, 16ffvelcdmd 7081 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) ∈ ℂ)
21 simprlr 792 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = 𝐹)
22 simprrr 794 . . . . . . . . . . . . . . . . . . . 20 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑎𝐷) = 𝐹)
2321, 22eqtr4d 2800 . . . . . . . . . . . . . . . . . . 19 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝𝐷) = (𝑎𝐷))
2423adantr 486 . . . . . . . . . . . . . . . . . 18 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝐷) = (𝑎𝐷))
2524fveq1d 6884 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = ((𝑎𝐷)‘𝑏))
26 fvres 6901 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
2726adantl 487 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝐷)‘𝑏) = (𝑝𝑏))
28 fvres 6901 . . . . . . . . . . . . . . . . . 18 (𝑏𝐷 → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
2928adantl 487 . . . . . . . . . . . . . . . . 17 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑎𝐷)‘𝑏) = (𝑎𝑏))
3025, 27, 293eqtr3d 2805 . . . . . . . . . . . . . . . 16 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → (𝑝𝑏) = (𝑎𝑏))
3120, 30subeq0bd 11667 . . . . . . . . . . . . . . 15 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝𝑏) − (𝑎𝑏)) = 0)
3218, 31eqtrd 2797 . . . . . . . . . . . . . 14 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ 𝑏𝐷) → ((𝑝f𝑎)‘𝑏) = 0)
3332ex 418 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷 → ((𝑝f𝑎)‘𝑏) = 0))
343, 33jcad 522 . . . . . . . . . . . 12 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷 → (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
35 plysubcl 26449 . . . . . . . . . . . . . 14 ((𝑝 ∈ (Poly‘ℂ) ∧ 𝑎 ∈ (Poly‘ℂ)) → (𝑝f𝑎) ∈ (Poly‘ℂ))
364, 9, 35syl2anc 596 . . . . . . . . . . . . 13 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) ∈ (Poly‘ℂ))
37 plyf 26425 . . . . . . . . . . . . 13 ((𝑝f𝑎) ∈ (Poly‘ℂ) → (𝑝f𝑎):ℂ⟶ℂ)
38 ffn 6706 . . . . . . . . . . . . 13 ((𝑝f𝑎):ℂ⟶ℂ → (𝑝f𝑎) Fn ℂ)
39 fniniseg 7056 . . . . . . . . . . . . 13 ((𝑝f𝑎) Fn ℂ → (𝑏 ∈ ((𝑝f𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
4036, 37, 38, 394syl 20 . . . . . . . . . . . 12 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏 ∈ ((𝑝f𝑎) “ {0}) ↔ (𝑏 ∈ ℂ ∧ ((𝑝f𝑎)‘𝑏) = 0)))
4134, 40sylibrd 262 . . . . . . . . . . 11 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑏𝐷𝑏 ∈ ((𝑝f𝑎) “ {0})))
4241ssrdv 3940 . . . . . . . . . 10 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝐷 ⊆ ((𝑝f𝑎) “ {0}))
43 ssfi 9170 . . . . . . . . . . 11 ((((𝑝f𝑎) “ {0}) ∈ Fin ∧ 𝐷 ⊆ ((𝑝f𝑎) “ {0})) → 𝐷 ∈ Fin)
4443expcom 419 . . . . . . . . . 10 (𝐷 ⊆ ((𝑝f𝑎) “ {0}) → (((𝑝f𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
4542, 44syl 18 . . . . . . . . 9 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (((𝑝f𝑎) “ {0}) ∈ Fin → 𝐷 ∈ Fin))
461, 45mtod 201 . . . . . . . 8 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ¬ ((𝑝f𝑎) “ {0}) ∈ Fin)
47 neqne 2965 . . . . . . . . . . 11 (¬ (𝑝f𝑎) = 0𝑝 → (𝑝f𝑎) ≠ 0𝑝)
48 eqid 2762 . . . . . . . . . . . 12 ((𝑝f𝑎) “ {0}) = ((𝑝f𝑎) “ {0})
4948fta1 26539 . . . . . . . . . . 11 (((𝑝f𝑎) ∈ (Poly‘ℂ) ∧ (𝑝f𝑎) ≠ 0𝑝) → (((𝑝f𝑎) “ {0}) ∈ Fin ∧ (♯‘((𝑝f𝑎) “ {0})) ≤ (deg‘(𝑝f𝑎))))
5036, 47, 49syl2an 608 . . . . . . . . . 10 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ ¬ (𝑝f𝑎) = 0𝑝) → (((𝑝f𝑎) “ {0}) ∈ Fin ∧ (♯‘((𝑝f𝑎) “ {0})) ≤ (deg‘(𝑝f𝑎))))
5150simpld 500 . . . . . . . . 9 ((((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) ∧ ¬ (𝑝f𝑎) = 0𝑝) → ((𝑝f𝑎) “ {0}) ∈ Fin)
5251ex 418 . . . . . . . 8 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (¬ (𝑝f𝑎) = 0𝑝 → ((𝑝f𝑎) “ {0}) ∈ Fin))
5346, 52mt3d 149 . . . . . . 7 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = 0𝑝)
54 df-0p 25899 . . . . . . 7 0𝑝 = (ℂ × {0})
5553, 54eqtrdi 2813 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → (𝑝f𝑎) = (ℂ × {0}))
56 ofsubeq0 12242 . . . . . . 7 ((ℂ ∈ V ∧ 𝑝:ℂ⟶ℂ ∧ 𝑎:ℂ⟶ℂ) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5714, 6, 11, 56mp3an2i 1495 . . . . . 6 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → ((𝑝f𝑎) = (ℂ × {0}) ↔ 𝑝 = 𝑎))
5855, 57mpbid 235 . . . . 5 (((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) ∧ ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹))) → 𝑝 = 𝑎)
5958ex 418 . . . 4 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → (((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6059alrimivv 1961 . . 3 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
61 eleq1w 2845 . . . . 5 (𝑝 = 𝑎 → (𝑝 ∈ (Poly‘ℂ) ↔ 𝑎 ∈ (Poly‘ℂ)))
62 reseq1 5970 . . . . . 6 (𝑝 = 𝑎 → (𝑝𝐷) = (𝑎𝐷))
6362eqeq1d 2764 . . . . 5 (𝑝 = 𝑎 → ((𝑝𝐷) = 𝐹 ↔ (𝑎𝐷) = 𝐹))
6461, 63anbi12d 644 . . . 4 (𝑝 = 𝑎 → ((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)))
6564mo4 2593 . . 3 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ↔ ∀𝑝𝑎(((𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) ∧ (𝑎 ∈ (Poly‘ℂ) ∧ (𝑎𝐷) = 𝐹)) → 𝑝 = 𝑎))
6660, 65sylibr 237 . 2 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
67 plyssc 26427 . . . . 5 (Poly‘𝑆) ⊆ (Poly‘ℂ)
6867sseli 3930 . . . 4 (𝑝 ∈ (Poly‘𝑆) → 𝑝 ∈ (Poly‘ℂ))
6968anim1i 627 . . 3 ((𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹) → (𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹))
7069moimi 2572 . 2 (∃*𝑝(𝑝 ∈ (Poly‘ℂ) ∧ (𝑝𝐷) = 𝐹) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹))
7166, 70syl 18 1 ((𝐷 ⊆ ℂ ∧ ¬ 𝐷 ∈ Fin) → ∃*𝑝(𝑝 ∈ (Poly‘𝑆) ∧ (𝑝𝐷) = 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wal 1568   = wceq 1570  wcel 2145  ∃*wmo 2564  wne 2957  Vcvv 3453  wss 3902  {csn 4587   class class class wbr 5107   × cxp 5657  ccnv 5658  cres 5661  cima 5662   Fn wfn 6532  wf 6533  cfv 6537  (class class class)co 7416  f cof 7679  Fincfn 8955  cc 11125  0cc0 11127  cle 11271  cmin 11468  chash 14396  0𝑝c0p 25898  Polycply 26411  degcdgr 26414
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-inf2 9623  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204  ax-pre-sup 11205
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-se 5613  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-of 7681  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-oadd 8462  df-er 8699  df-map 8831  df-pm 8832  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-sup 9415  df-inf 9416  df-oi 9485  df-dju 9909  df-card 9947  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-div 11899  df-nn 12261  df-2 12330  df-3 12331  df-n0 12532  df-xnn0 12605  df-z 12619  df-uz 12891  df-rp 13045  df-fz 13564  df-fzo 13712  df-fl 13855  df-seq 14068  df-exp 14128  df-hash 14397  df-cj 15188  df-re 15189  df-im 15190  df-sqrt 15324  df-abs 15325  df-clim 15577  df-rlim 15578  df-sum 15776  df-0p 25899  df-ply 26415  df-idp 26416  df-coe 26417  df-dgr 26418  df-quot 26522
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator