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

Theorem bezoutlemeu 12707
Description: Lemma for Bézout's identity. There is exactly one nonnegative integer meeting the greatest common divisor condition. (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 ) ) )
Assertion
Ref Expression
bezoutlemeu  |-  ( ph  ->  E! d  e.  NN0  A. z  e.  ZZ  (
z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) ) )
Distinct variable groups:    z, D    A, d, z    B, d, z    ph, d
Allowed substitution hints:    ph( z)    D( d)

Proof of Theorem bezoutlemeu
Dummy variables  e  w  s  t are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bezoutlemgcd.1 . . 3  |-  ( ph  ->  A  e.  ZZ )
2 bezoutlemgcd.2 . . 3  |-  ( ph  ->  B  e.  ZZ )
3 bezoutlembi 12705 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  E. d  e.  NN0  ( A. z  e.  ZZ  ( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  /\  E. s  e.  ZZ  E. t  e.  ZZ  d  =  ( ( A  x.  s
)  +  ( B  x.  t ) ) ) )
4 simpl 109 . . . . 5  |-  ( ( A. z  e.  ZZ  ( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  /\  E. s  e.  ZZ  E. t  e.  ZZ  d  =  ( ( A  x.  s
)  +  ( B  x.  t ) ) )  ->  A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) ) )
54reximi 2641 . . . 4  |-  ( E. d  e.  NN0  ( A. z  e.  ZZ  ( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  /\  E. s  e.  ZZ  E. t  e.  ZZ  d  =  ( ( A  x.  s
)  +  ( B  x.  t ) ) )  ->  E. d  e.  NN0  A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) ) )
63, 5syl 14 . . 3  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  E. d  e.  NN0  A. z  e.  ZZ  (
z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) ) )
71, 2, 6syl2anc 411 . 2  |-  ( ph  ->  E. d  e.  NN0  A. z  e.  ZZ  (
z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) ) )
81ad2antrr 488 . . . . . 6  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  ->  A  e.  ZZ )
92ad2antrr 488 . . . . . 6  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  ->  B  e.  ZZ )
10 simplrl 537 . . . . . 6  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  -> 
d  e.  NN0 )
11 simprl 531 . . . . . . 7  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  ->  A. z  e.  ZZ  ( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) ) )
12 breq1 4114 . . . . . . . . 9  |-  ( z  =  w  ->  (
z  ||  d  <->  w  ||  d
) )
13 breq1 4114 . . . . . . . . . 10  |-  ( z  =  w  ->  (
z  ||  A  <->  w  ||  A
) )
14 breq1 4114 . . . . . . . . . 10  |-  ( z  =  w  ->  (
z  ||  B  <->  w  ||  B
) )
1513, 14anbi12d 473 . . . . . . . . 9  |-  ( z  =  w  ->  (
( z  ||  A  /\  z  ||  B )  <-> 
( w  ||  A  /\  w  ||  B ) ) )
1612, 15bibi12d 235 . . . . . . . 8  |-  ( z  =  w  ->  (
( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  <-> 
( w  ||  d  <->  ( w  ||  A  /\  w  ||  B ) ) ) )
1716cbvralv 2780 . . . . . . 7  |-  ( A. z  e.  ZZ  (
z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  <->  A. w  e.  ZZ  ( w  ||  d 
<->  ( w  ||  A  /\  w  ||  B ) ) )
1811, 17sylib 122 . . . . . 6  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  ->  A. w  e.  ZZ  ( w  ||  d  <->  ( w  ||  A  /\  w  ||  B ) ) )
19 simplrr 538 . . . . . 6  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  -> 
e  e.  NN0 )
20 simprr 533 . . . . . . 7  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  ->  A. z  e.  ZZ  ( z  ||  e  <->  ( z  ||  A  /\  z  ||  B ) ) )
21 breq1 4114 . . . . . . . . 9  |-  ( z  =  w  ->  (
z  ||  e  <->  w  ||  e
) )
2221, 15bibi12d 235 . . . . . . . 8  |-  ( z  =  w  ->  (
( z  ||  e  <->  ( z  ||  A  /\  z  ||  B ) )  <-> 
( w  ||  e  <->  ( w  ||  A  /\  w  ||  B ) ) ) )
2322cbvralv 2780 . . . . . . 7  |-  ( A. z  e.  ZZ  (
z  ||  e  <->  ( z  ||  A  /\  z  ||  B ) )  <->  A. w  e.  ZZ  ( w  ||  e 
<->  ( w  ||  A  /\  w  ||  B ) ) )
2420, 23sylib 122 . . . . . 6  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  ->  A. w  e.  ZZ  ( w  ||  e  <->  ( w  ||  A  /\  w  ||  B ) ) )
258, 9, 10, 18, 19, 24bezoutlemmo 12706 . . . . 5  |-  ( ( ( ph  /\  (
d  e.  NN0  /\  e  e.  NN0 ) )  /\  ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )  -> 
d  =  e )
2625ex 115 . . . 4  |-  ( (
ph  /\  ( d  e.  NN0  /\  e  e. 
NN0 ) )  -> 
( ( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) )  ->  d  =  e ) )
2726ralrimivva 2626 . . 3  |-  ( ph  ->  A. d  e.  NN0  A. e  e.  NN0  (
( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) )  ->  d  =  e ) )
28 breq2 4115 . . . . . 6  |-  ( d  =  e  ->  (
z  ||  d  <->  z  ||  e ) )
2928bibi1d 233 . . . . 5  |-  ( d  =  e  ->  (
( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  <-> 
( z  ||  e  <->  ( z  ||  A  /\  z  ||  B ) ) ) )
3029ralbidv 2544 . . . 4  |-  ( d  =  e  ->  ( A. z  e.  ZZ  ( z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) )  <->  A. z  e.  ZZ  ( z  ||  e  <->  ( z  ||  A  /\  z  ||  B ) ) ) )
3130rmo4 3012 . . 3  |-  ( E* d  e.  NN0  A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  <->  A. d  e.  NN0  A. e  e.  NN0  (
( A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  A. z  e.  ZZ  ( z  ||  e 
<->  ( z  ||  A  /\  z  ||  B ) ) )  ->  d  =  e ) )
3227, 31sylibr 134 . 2  |-  ( ph  ->  E* d  e.  NN0  A. z  e.  ZZ  (
z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) ) )
33 reu5 2764 . 2  |-  ( E! d  e.  NN0  A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  <->  ( E. d  e.  NN0  A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) )  /\  E* d  e.  NN0  A. z  e.  ZZ  ( z  ||  d 
<->  ( z  ||  A  /\  z  ||  B ) ) ) )
347, 32, 33sylanbrc 417 1  |-  ( ph  ->  E! d  e.  NN0  A. z  e.  ZZ  (
z  ||  d  <->  ( z  ||  A  /\  z  ||  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   A.wral 2522   E.wrex 2523   E!wreu 2524   E*wrmo 2525   class class class wbr 4111  (class class class)co 6052    + caddc 8132    x. cmul 8134   NN0cn0 9498   ZZcz 9579    || cdvds 12477
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-mulrcl 8228  ax-addcom 8229  ax-mulcom 8230  ax-addass 8231  ax-mulass 8232  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-1rid 8236  ax-0id 8237  ax-rnegex 8238  ax-precex 8239  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245  ax-pre-mulgt0 8246  ax-pre-mulext 8247  ax-arch 8248  ax-caucvg 8249
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-reap 8851  df-ap 8858  df-div 8949  df-inn 9240  df-2 9298  df-3 9299  df-4 9300  df-n0 9499  df-z 9580  df-uz 9857  df-q 9955  df-rp 9990  df-fz 10346  df-fl 10634  df-mod 10689  df-seqfrec 10814  df-exp 10905  df-cj 11531  df-re 11532  df-im 11533  df-rsqrt 11687  df-abs 11688  df-dvds 12478
This theorem is referenced by:  dfgcd3  12710  bezout  12711
  Copyright terms: Public domain W3C validator