Metamath Proof Explorer


Theorem elqaa

Description: The set of numbers generated by the roots of polynomials in the rational numbers is the same as the set of algebraic numbers, which by elaa are defined only in terms of polynomials over the integers. (Contributed by Mario Carneiro, 23-Jul-2014) (Proof shortened by AV, 3-Oct-2020)

Ref Expression
Assertion elqaa A 𝔸 A f Poly 0 𝑝 f A = 0

Proof

Step Hyp Ref Expression
1 elaa A 𝔸 A f Poly 0 𝑝 f A = 0
2 zssq
3 qsscn
4 plyss Poly Poly
5 2 3 4 mp2an Poly Poly
6 ssdif Poly Poly Poly 0 𝑝 Poly 0 𝑝
7 ssrexv Poly 0 𝑝 Poly 0 𝑝 f Poly 0 𝑝 f A = 0 f Poly 0 𝑝 f A = 0
8 5 6 7 mp2b f Poly 0 𝑝 f A = 0 f Poly 0 𝑝 f A = 0
9 8 anim2i A f Poly 0 𝑝 f A = 0 A f Poly 0 𝑝 f A = 0
10 1 9 sylbi A 𝔸 A f Poly 0 𝑝 f A = 0
11 simpll A f Poly 0 𝑝 f A = 0 A
12 simplr A f Poly 0 𝑝 f A = 0 f Poly 0 𝑝
13 simpr A f Poly 0 𝑝 f A = 0 f A = 0
14 eqid coeff f = coeff f
15 fveq2 m = k coeff f m = coeff f k
16 15 oveq1d m = k coeff f m j = coeff f k j
17 16 eleq1d m = k coeff f m j coeff f k j
18 17 rabbidv m = k j | coeff f m j = j | coeff f k j
19 oveq2 j = n coeff f k j = coeff f k n
20 19 eleq1d j = n coeff f k j coeff f k n
21 20 cbvrabv j | coeff f k j = n | coeff f k n
22 18 21 eqtrdi m = k j | coeff f m j = n | coeff f k n
23 22 infeq1d m = k sup j | coeff f m j < = sup n | coeff f k n <
24 23 cbvmptv m 0 sup j | coeff f m j < = k 0 sup n | coeff f k n <
25 eqid seq 0 × m 0 sup j | coeff f m j < deg f = seq 0 × m 0 sup j | coeff f m j < deg f
26 11 12 13 14 24 25 elqaalem3 A f Poly 0 𝑝 f A = 0 A 𝔸
27 26 r19.29an A f Poly 0 𝑝 f A = 0 A 𝔸
28 10 27 impbii A 𝔸 A f Poly 0 𝑝 f A = 0