ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  bezoutlemsup Unicode version

Theorem bezoutlemsup 12570
Description: Lemma for Bézout's identity. The number satisfying the greatest common divisor condition is the supremum of divisors of both  A and  B. (Contributed by Mario Carneiro and Jim Kingdon, 9-Jan-2022.)
Hypotheses
Ref Expression
bezoutlemgcd.1  |-  ( ph  ->  A  e.  ZZ )
bezoutlemgcd.2  |-  ( ph  ->  B  e.  ZZ )
bezoutlemgcd.3  |-  ( ph  ->  D  e.  NN0 )
bezoutlemgcd.4  |-  ( ph  ->  A. z  e.  ZZ  ( z  ||  D  <->  ( z  ||  A  /\  z  ||  B ) ) )
bezoutlemgcd.5  |-  ( ph  ->  -.  ( A  =  0  /\  B  =  0 ) )
Assertion
Ref Expression
bezoutlemsup  |-  ( ph  ->  D  =  sup ( { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } ,  RR ,  <  ) )
Distinct variable groups:    z, D    z, A    z, B    ph, z

Proof of Theorem bezoutlemsup
Dummy variables  w  f  g  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bezoutlemgcd.3 . . . 4  |-  ( ph  ->  D  e.  NN0 )
21nn0red 9446 . . 3  |-  ( ph  ->  D  e.  RR )
3 elrabi 2957 . . . . . . 7  |-  ( w  e.  { z  e.  ZZ  |  ( z 
||  A  /\  z  ||  B ) }  ->  w  e.  ZZ )
43adantl 277 . . . . . 6  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  w  e.  ZZ )
54zred 9592 . . . . 5  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  w  e.  RR )
62adantr 276 . . . . 5  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  D  e.  RR )
7 breq1 4089 . . . . . . . . . 10  |-  ( z  =  w  ->  (
z  ||  A  <->  w  ||  A
) )
8 breq1 4089 . . . . . . . . . 10  |-  ( z  =  w  ->  (
z  ||  B  <->  w  ||  B
) )
97, 8anbi12d 473 . . . . . . . . 9  |-  ( z  =  w  ->  (
( z  ||  A  /\  z  ||  B )  <-> 
( w  ||  A  /\  w  ||  B ) ) )
109elrab 2960 . . . . . . . 8  |-  ( w  e.  { z  e.  ZZ  |  ( z 
||  A  /\  z  ||  B ) }  <->  ( w  e.  ZZ  /\  ( w 
||  A  /\  w  ||  B ) ) )
1110simprbi 275 . . . . . . 7  |-  ( w  e.  { z  e.  ZZ  |  ( z 
||  A  /\  z  ||  B ) }  ->  ( w  ||  A  /\  w  ||  B ) )
1211adantl 277 . . . . . 6  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  (
w  ||  A  /\  w  ||  B ) )
13 breq1 4089 . . . . . . . . 9  |-  ( z  =  w  ->  (
z  <_  D  <->  w  <_  D ) )
149, 13imbi12d 234 . . . . . . . 8  |-  ( z  =  w  ->  (
( ( z  ||  A  /\  z  ||  B
)  ->  z  <_  D )  <->  ( ( w 
||  A  /\  w  ||  B )  ->  w  <_  D ) ) )
15 bezoutlemgcd.1 . . . . . . . . . 10  |-  ( ph  ->  A  e.  ZZ )
16 bezoutlemgcd.2 . . . . . . . . . 10  |-  ( ph  ->  B  e.  ZZ )
17 bezoutlemgcd.4 . . . . . . . . . 10  |-  ( ph  ->  A. z  e.  ZZ  ( z  ||  D  <->  ( z  ||  A  /\  z  ||  B ) ) )
18 bezoutlemgcd.5 . . . . . . . . . 10  |-  ( ph  ->  -.  ( A  =  0  /\  B  =  0 ) )
1915, 16, 1, 17, 18bezoutlemle 12569 . . . . . . . . 9  |-  ( ph  ->  A. z  e.  ZZ  ( ( z  ||  A  /\  z  ||  B
)  ->  z  <_  D ) )
2019adantr 276 . . . . . . . 8  |-  ( (
ph  /\  w  e.  ZZ )  ->  A. z  e.  ZZ  ( ( z 
||  A  /\  z  ||  B )  ->  z  <_  D ) )
21 simpr 110 . . . . . . . 8  |-  ( (
ph  /\  w  e.  ZZ )  ->  w  e.  ZZ )
2214, 20, 21rspcdva 2913 . . . . . . 7  |-  ( (
ph  /\  w  e.  ZZ )  ->  ( ( w  ||  A  /\  w  ||  B )  ->  w  <_  D ) )
233, 22sylan2 286 . . . . . 6  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  (
( w  ||  A  /\  w  ||  B )  ->  w  <_  D
) )
2412, 23mpd 13 . . . . 5  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  w  <_  D )
255, 6, 24lensymd 8291 . . . 4  |-  ( (
ph  /\  w  e.  { z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) } )  ->  -.  D  <  w )
2625ralrimiva 2603 . . 3  |-  ( ph  ->  A. w  e.  {
z  e.  ZZ  | 
( z  ||  A  /\  z  ||  B ) }  -.  D  < 
w )
271nn0zd 9590 . . . . . . . . . 10  |-  ( ph  ->  D  e.  ZZ )
28 iddvds 12355 . . . . . . . . . 10  |-  ( D  e.  ZZ  ->  D  ||  D )
2927, 28syl 14 . . . . . . . . 9  |-  ( ph  ->  D  ||  D )
30 breq1 4089 . . . . . . . . . . 11  |-  ( z  =  D  ->  (
z  ||  D  <->  D  ||  D
) )
31 breq1 4089 . . . . . . . . . . . 12  |-  ( z  =  D  ->  (
z  ||  A  <->  D  ||  A
) )
32 breq1 4089 . . . . . . . . . . . 12  |-  ( z  =  D  ->  (
z  ||  B  <->  D  ||  B
) )
3331, 32anbi12d 473 . . . . . . . . . . 11  |-  ( z  =  D  ->  (
( z  ||  A  /\  z  ||  B )  <-> 
( D  ||  A  /\  D  ||  B ) ) )
3430, 33bibi12d 235 . . . . . . . . . 10  |-  ( z  =  D  ->  (
( z  ||  D  <->  ( z  ||  A  /\  z  ||  B ) )  <-> 
( D  ||  D  <->  ( D  ||  A  /\  D  ||  B ) ) ) )
3534, 17, 27rspcdva 2913 . . . . . . . . 9  |-  ( ph  ->  ( D  ||  D  <->  ( D  ||  A  /\  D  ||  B ) ) )
3629, 35mpbid 147 . . . . . . . 8  |-  ( ph  ->  ( D  ||  A  /\  D  ||  B ) )
3736ad2antrr 488 . . . . . . 7  |-  ( ( ( ph  /\  w  e.  RR )  /\  w  <  D )  ->  ( D  ||  A  /\  D  ||  B ) )
381ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  w  e.  RR )  /\  w  <  D )  ->  D  e.  NN0 )
3938nn0zd 9590 . . . . . . . 8  |-  ( ( ( ph  /\  w  e.  RR )  /\  w  <  D )  ->  D  e.  ZZ )
4033elrab3 2961 . . . . . . . 8  |-  ( D  e.  ZZ  ->  ( D  e.  { z  e.  ZZ  |  ( z 
||  A  /\  z  ||  B ) }  <->  ( D  ||  A  /\  D  ||  B ) ) )
4139, 40syl 14 . . . . . . 7  |-  ( ( ( ph  /\  w  e.  RR )  /\  w  <  D )  ->  ( D  e.  { z  e.  ZZ  |  ( z 
||  A  /\  z  ||  B ) }  <->  ( D  ||  A  /\  D  ||  B ) ) )
4237, 41mpbird 167 . . . . . 6  |-  ( ( ( ph  /\  w  e.  RR )  /\  w  <  D )  ->  D  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } )
43 breq2 4090 . . . . . . 7  |-  ( u  =  D  ->  (
w  <  u  <->  w  <  D ) )
4443rspcev 2908 . . . . . 6  |-  ( ( D  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B ) }  /\  w  <  D
)  ->  E. u  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } w  < 
u )
4542, 44sylancom 420 . . . . 5  |-  ( ( ( ph  /\  w  e.  RR )  /\  w  <  D )  ->  E. u  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } w  < 
u )
4645ex 115 . . . 4  |-  ( (
ph  /\  w  e.  RR )  ->  ( w  <  D  ->  E. u  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } w  < 
u ) )
4746ralrimiva 2603 . . 3  |-  ( ph  ->  A. w  e.  RR  ( w  <  D  ->  E. u  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B ) } w  <  u ) )
48 lttri3 8249 . . . . 5  |-  ( ( f  e.  RR  /\  g  e.  RR )  ->  ( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
4948adantl 277 . . . 4  |-  ( (
ph  /\  ( f  e.  RR  /\  g  e.  RR ) )  -> 
( f  =  g  <-> 
( -.  f  < 
g  /\  -.  g  <  f ) ) )
5049eqsupti 7186 . . 3  |-  ( ph  ->  ( ( D  e.  RR  /\  A. w  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) }  -.  D  <  w  /\  A. w  e.  RR  ( w  < 
D  ->  E. u  e.  { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } w  < 
u ) )  ->  sup ( { z  e.  ZZ  |  ( z 
||  A  /\  z  ||  B ) } ,  RR ,  <  )  =  D ) )
512, 26, 47, 50mp3and 1374 . 2  |-  ( ph  ->  sup ( { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B ) } ,  RR ,  <  )  =  D )
5251eqcomd 2235 1  |-  ( ph  ->  D  =  sup ( { z  e.  ZZ  |  ( z  ||  A  /\  z  ||  B
) } ,  RR ,  <  ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1395    e. wcel 2200   A.wral 2508   E.wrex 2509   {crab 2512   class class class wbr 4086   supcsup 7172   RRcr 8021   0cc0 8022    < clt 8204    <_ cle 8205   NN0cn0 9392   ZZcz 9469    || cdvds 12338
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-mulrcl 8121  ax-addcom 8122  ax-mulcom 8123  ax-addass 8124  ax-mulass 8125  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-1rid 8129  ax-0id 8130  ax-rnegex 8131  ax-precex 8132  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-apti 8137  ax-pre-ltadd 8138  ax-pre-mulgt0 8139  ax-pre-mulext 8140
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-iun 3970  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-po 4391  df-iso 4392  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-1st 6298  df-2nd 6299  df-sup 7174  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-reap 8745  df-ap 8752  df-div 8843  df-inn 9134  df-n0 9393  df-z 9470  df-q 9844  df-dvds 12339
This theorem is referenced by:  dfgcd3  12571
  Copyright terms: Public domain W3C validator