Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dgraaval Structured version   Unicode version

Theorem dgraaval 29639
Description: Value of the degree function on an algebraic number. (Contributed by Stefan O'Rear, 25-Nov-2014.)
Assertion
Ref Expression
dgraaval  |-  ( A  e.  AA  ->  (degAA `  A )  =  sup ( { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  { 0p }
) ( (deg `  p )  =  d  /\  ( p `  A )  =  0 ) } ,  RR ,  `'  <  ) )
Distinct variable group:    A, d, p

Proof of Theorem dgraaval
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 fveq2 5789 . . . . . . 7  |-  ( a  =  A  ->  (
p `  a )  =  ( p `  A ) )
21eqeq1d 2453 . . . . . 6  |-  ( a  =  A  ->  (
( p `  a
)  =  0  <->  (
p `  A )  =  0 ) )
32anbi2d 703 . . . . 5  |-  ( a  =  A  ->  (
( (deg `  p
)  =  d  /\  ( p `  a
)  =  0 )  <-> 
( (deg `  p
)  =  d  /\  ( p `  A
)  =  0 ) ) )
43rexbidv 2844 . . . 4  |-  ( a  =  A  ->  ( E. p  e.  (
(Poly `  QQ )  \  { 0p }
) ( (deg `  p )  =  d  /\  ( p `  a )  =  0 )  <->  E. p  e.  ( (Poly `  QQ )  \  { 0p }
) ( (deg `  p )  =  d  /\  ( p `  A )  =  0 ) ) )
54rabbidv 3060 . . 3  |-  ( a  =  A  ->  { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  {
0p } ) ( (deg `  p
)  =  d  /\  ( p `  a
)  =  0 ) }  =  { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  {
0p } ) ( (deg `  p
)  =  d  /\  ( p `  A
)  =  0 ) } )
65supeq1d 7797 . 2  |-  ( a  =  A  ->  sup ( { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  { 0p }
) ( (deg `  p )  =  d  /\  ( p `  a )  =  0 ) } ,  RR ,  `'  <  )  =  sup ( { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  {
0p } ) ( (deg `  p
)  =  d  /\  ( p `  A
)  =  0 ) } ,  RR ,  `'  <  ) )
7 df-dgraa 29637 . 2  |- degAA  =  (
a  e.  AA  |->  sup ( { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  { 0p } ) ( (deg
`  p )  =  d  /\  ( p `
 a )  =  0 ) } ,  RR ,  `'  <  ) )
8 ltso 9556 . . . 4  |-  <  Or  RR
9 cnvso 5474 . . . 4  |-  (  < 
Or  RR  <->  `'  <  Or  RR )
108, 9mpbi 208 . . 3  |-  `'  <  Or  RR
1110supex 7814 . 2  |-  sup ( { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  { 0p }
) ( (deg `  p )  =  d  /\  ( p `  A )  =  0 ) } ,  RR ,  `'  <  )  e. 
_V
126, 7, 11fvmpt 5873 1  |-  ( A  e.  AA  ->  (degAA `  A )  =  sup ( { d  e.  NN  |  E. p  e.  ( (Poly `  QQ )  \  { 0p }
) ( (deg `  p )  =  d  /\  ( p `  A )  =  0 ) } ,  RR ,  `'  <  ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1370    e. wcel 1758   E.wrex 2796   {crab 2799    \ cdif 3423   {csn 3975    Or wor 4738   `'ccnv 4937   ` cfv 5516   supcsup 7791   RRcr 9382   0cc0 9383    < clt 9519   NNcn 10423   QQcq 11054   0pc0p 21263  Polycply 21768  degcdgr 21771   AAcaa 21896  degAAcdgraa 29635
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952  ax-ext 2430  ax-sep 4511  ax-nul 4519  ax-pow 4568  ax-pr 4629  ax-un 6472  ax-resscn 9440  ax-pre-lttri 9457  ax-pre-lttrn 9458
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-nel 2647  df-ral 2800  df-rex 2801  df-rmo 2803  df-rab 2804  df-v 3070  df-sbc 3285  df-csb 3387  df-dif 3429  df-un 3431  df-in 3433  df-ss 3440  df-nul 3736  df-if 3890  df-pw 3960  df-sn 3976  df-pr 3978  df-op 3982  df-uni 4190  df-br 4391  df-opab 4449  df-mpt 4450  df-id 4734  df-po 4739  df-so 4740  df-xp 4944  df-rel 4945  df-cnv 4946  df-co 4947  df-dm 4948  df-rn 4949  df-res 4950  df-ima 4951  df-iota 5479  df-fun 5518  df-fn 5519  df-f 5520  df-f1 5521  df-fo 5522  df-f1o 5523  df-fv 5524  df-er 7201  df-en 7411  df-dom 7412  df-sdom 7413  df-sup 7792  df-pnf 9521  df-mnf 9522  df-ltxr 9524  df-dgraa 29637
This theorem is referenced by:  dgraalem  29640  dgraaub  29643
  Copyright terms: Public domain W3C validator