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

Theorem elqaa 24077
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 24071 are defined only in terms of polynomials over the integers. (Contributed by Mario Carneiro, 23-Jul-2014.) (Proof shortened by AV, 3-Oct-2020.)
Assertion
Ref Expression
elqaa  |-  ( A  e.  AA  <->  ( A  e.  CC  /\  E. f  e.  ( (Poly `  QQ )  \  { 0p } ) ( f `
 A )  =  0 ) )
Distinct variable group:    A, f

Proof of Theorem elqaa
Dummy variables  k  m  n  j are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elaa 24071 . . 3  |-  ( A  e.  AA  <->  ( A  e.  CC  /\  E. f  e.  ( (Poly `  ZZ )  \  { 0p } ) ( f `
 A )  =  0 ) )
2 zssq 11795 . . . . . 6  |-  ZZ  C_  QQ
3 qsscn 11799 . . . . . 6  |-  QQ  C_  CC
4 plyss 23955 . . . . . 6  |-  ( ( ZZ  C_  QQ  /\  QQ  C_  CC )  ->  (Poly `  ZZ )  C_  (Poly `  QQ ) )
52, 3, 4mp2an 708 . . . . 5  |-  (Poly `  ZZ )  C_  (Poly `  QQ )
6 ssdif 3745 . . . . 5  |-  ( (Poly `  ZZ )  C_  (Poly `  QQ )  ->  (
(Poly `  ZZ )  \  { 0p }
)  C_  ( (Poly `  QQ )  \  {
0p } ) )
7 ssrexv 3667 . . . . 5  |-  ( ( (Poly `  ZZ )  \  { 0p }
)  C_  ( (Poly `  QQ )  \  {
0p } )  ->  ( E. f  e.  ( (Poly `  ZZ )  \  { 0p } ) ( f `
 A )  =  0  ->  E. f  e.  ( (Poly `  QQ )  \  { 0p } ) ( f `
 A )  =  0 ) )
85, 6, 7mp2b 10 . . . 4  |-  ( E. f  e.  ( (Poly `  ZZ )  \  {
0p } ) ( f `  A
)  =  0  ->  E. f  e.  (
(Poly `  QQ )  \  { 0p }
) ( f `  A )  =  0 )
98anim2i 593 . . 3  |-  ( ( A  e.  CC  /\  E. f  e.  ( (Poly `  ZZ )  \  {
0p } ) ( f `  A
)  =  0 )  ->  ( A  e.  CC  /\  E. f  e.  ( (Poly `  QQ )  \  { 0p } ) ( f `
 A )  =  0 ) )
101, 9sylbi 207 . 2  |-  ( A  e.  AA  ->  ( A  e.  CC  /\  E. f  e.  ( (Poly `  QQ )  \  {
0p } ) ( f `  A
)  =  0 ) )
11 simpll 790 . . . 4  |-  ( ( ( A  e.  CC  /\  f  e.  ( (Poly `  QQ )  \  {
0p } ) )  /\  ( f `
 A )  =  0 )  ->  A  e.  CC )
12 simplr 792 . . . 4  |-  ( ( ( A  e.  CC  /\  f  e.  ( (Poly `  QQ )  \  {
0p } ) )  /\  ( f `
 A )  =  0 )  ->  f  e.  ( (Poly `  QQ )  \  { 0p } ) )
13 simpr 477 . . . 4  |-  ( ( ( A  e.  CC  /\  f  e.  ( (Poly `  QQ )  \  {
0p } ) )  /\  ( f `
 A )  =  0 )  ->  (
f `  A )  =  0 )
14 eqid 2622 . . . 4  |-  (coeff `  f )  =  (coeff `  f )
15 fveq2 6191 . . . . . . . . . 10  |-  ( m  =  k  ->  (
(coeff `  f ) `  m )  =  ( (coeff `  f ) `  k ) )
1615oveq1d 6665 . . . . . . . . 9  |-  ( m  =  k  ->  (
( (coeff `  f
) `  m )  x.  j )  =  ( ( (coeff `  f
) `  k )  x.  j ) )
1716eleq1d 2686 . . . . . . . 8  |-  ( m  =  k  ->  (
( ( (coeff `  f ) `  m
)  x.  j )  e.  ZZ  <->  ( (
(coeff `  f ) `  k )  x.  j
)  e.  ZZ ) )
1817rabbidv 3189 . . . . . . 7  |-  ( m  =  k  ->  { j  e.  NN  |  ( ( (coeff `  f
) `  m )  x.  j )  e.  ZZ }  =  { j  e.  NN  |  ( ( (coeff `  f ) `  k )  x.  j
)  e.  ZZ }
)
19 oveq2 6658 . . . . . . . . 9  |-  ( j  =  n  ->  (
( (coeff `  f
) `  k )  x.  j )  =  ( ( (coeff `  f
) `  k )  x.  n ) )
2019eleq1d 2686 . . . . . . . 8  |-  ( j  =  n  ->  (
( ( (coeff `  f ) `  k
)  x.  j )  e.  ZZ  <->  ( (
(coeff `  f ) `  k )  x.  n
)  e.  ZZ ) )
2120cbvrabv 3199 . . . . . . 7  |-  { j  e.  NN  |  ( ( (coeff `  f
) `  k )  x.  j )  e.  ZZ }  =  { n  e.  NN  |  ( ( (coeff `  f ) `  k )  x.  n
)  e.  ZZ }
2218, 21syl6eq 2672 . . . . . 6  |-  ( m  =  k  ->  { j  e.  NN  |  ( ( (coeff `  f
) `  m )  x.  j )  e.  ZZ }  =  { n  e.  NN  |  ( ( (coeff `  f ) `  k )  x.  n
)  e.  ZZ }
)
2322infeq1d 8383 . . . . 5  |-  ( m  =  k  -> inf ( { j  e.  NN  | 
( ( (coeff `  f ) `  m
)  x.  j )  e.  ZZ } ,  RR ,  <  )  = inf ( { n  e.  NN  |  ( ( (coeff `  f ) `  k )  x.  n
)  e.  ZZ } ,  RR ,  <  )
)
2423cbvmptv 4750 . . . 4  |-  ( m  e.  NN0  |-> inf ( { j  e.  NN  | 
( ( (coeff `  f ) `  m
)  x.  j )  e.  ZZ } ,  RR ,  <  ) )  =  ( k  e. 
NN0  |-> inf ( { n  e.  NN  |  ( ( (coeff `  f ) `  k )  x.  n
)  e.  ZZ } ,  RR ,  <  )
)
25 eqid 2622 . . . 4  |-  (  seq 0 (  x.  , 
( m  e.  NN0  |-> inf ( { j  e.  NN  |  ( ( (coeff `  f ) `  m
)  x.  j )  e.  ZZ } ,  RR ,  <  ) ) ) `  (deg `  f ) )  =  (  seq 0 (  x.  ,  ( m  e.  NN0  |-> inf ( { j  e.  NN  | 
( ( (coeff `  f ) `  m
)  x.  j )  e.  ZZ } ,  RR ,  <  ) ) ) `  (deg `  f ) )
2611, 12, 13, 14, 24, 25elqaalem3 24076 . . 3  |-  ( ( ( A  e.  CC  /\  f  e.  ( (Poly `  QQ )  \  {
0p } ) )  /\  ( f `
 A )  =  0 )  ->  A  e.  AA )
2726r19.29an 3077 . 2  |-  ( ( A  e.  CC  /\  E. f  e.  ( (Poly `  QQ )  \  {
0p } ) ( f `  A
)  =  0 )  ->  A  e.  AA )
2810, 27impbii 199 1  |-  ( A  e.  AA  <->  ( A  e.  CC  /\  E. f  e.  ( (Poly `  QQ )  \  { 0p } ) ( f `
 A )  =  0 ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   E.wrex 2913   {crab 2916    \ cdif 3571    C_ wss 3574   {csn 4177    |-> cmpt 4729   ` cfv 5888  (class class class)co 6650  infcinf 8347   CCcc 9934   RRcr 9935   0cc0 9936    x. cmul 9941    < clt 10074   NNcn 11020   NN0cn0 11292   ZZcz 11377   QQcq 11788    seqcseq 12801   0pc0p 23436  Polycply 23940  coeffccoe 23942  degcdgr 23943   AAcaa 24069
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538  ax-cnex 9992  ax-resscn 9993  ax-1cn 9994  ax-icn 9995  ax-addcl 9996  ax-addrcl 9997  ax-mulcl 9998  ax-mulrcl 9999  ax-mulcom 10000  ax-addass 10001  ax-mulass 10002  ax-distr 10003  ax-i2m1 10004  ax-1ne0 10005  ax-1rid 10006  ax-rnegex 10007  ax-rrecex 10008  ax-cnre 10009  ax-pre-lttri 10010  ax-pre-lttrn 10011  ax-pre-ltadd 10012  ax-pre-mulgt0 10013  ax-pre-sup 10014  ax-addf 10015
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-of 6897  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-map 7859  df-pm 7860  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-sup 8348  df-inf 8349  df-oi 8415  df-card 8765  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080  df-sub 10268  df-neg 10269  df-div 10685  df-nn 11021  df-2 11079  df-3 11080  df-n0 11293  df-z 11378  df-uz 11688  df-q 11789  df-rp 11833  df-fz 12327  df-fzo 12466  df-fl 12593  df-mod 12669  df-seq 12802  df-exp 12861  df-hash 13118  df-cj 13839  df-re 13840  df-im 13841  df-sqrt 13975  df-abs 13976  df-clim 14219  df-rlim 14220  df-sum 14417  df-0p 23437  df-ply 23944  df-coe 23946  df-dgr 23947  df-aa 24070
This theorem is referenced by:  qaa  24078  dgraalem  37715  dgraaub  37718  aaitgo  37732  aacllem  42547
  Copyright terms: Public domain W3C validator