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

Theorem bezoutr1 12829
Description: Converse of bezout 12807 for when the greater common divisor is one (sufficient condition for relative primality). (Contributed by Stefan O'Rear, 23-Sep-2014.)
Assertion
Ref Expression
bezoutr1  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  -> 
( ( ( A  x.  X )  +  ( B  x.  Y
) )  =  1  ->  ( A  gcd  B )  =  1 ) )

Proof of Theorem bezoutr1
StepHypRef Expression
1 bezoutr 12828 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  -> 
( A  gcd  B
)  ||  ( ( A  x.  X )  +  ( B  x.  Y ) ) )
21adantr 276 . . . . 5  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  gcd  B )  ||  ( ( A  x.  X )  +  ( B  x.  Y ) ) )
3 simpr 110 . . . . 5  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( ( A  x.  X )  +  ( B  x.  Y
) )  =  1 )
42, 3breqtrd 4156 . . . 4  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  gcd  B )  ||  1 )
5 gcdcl 12762 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  gcd  B
)  e.  NN0 )
65nn0zd 9771 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  gcd  B
)  e.  ZZ )
76ad2antrr 492 . . . . 5  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  gcd  B )  e.  ZZ )
8 1nn 9318 . . . . . 6  |-  1  e.  NN
98a1i 9 . . . . 5  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  1  e.  NN )
10 dvdsle 12630 . . . . 5  |-  ( ( ( A  gcd  B
)  e.  ZZ  /\  1  e.  NN )  ->  ( ( A  gcd  B )  ||  1  -> 
( A  gcd  B
)  <_  1 ) )
117, 9, 10syl2anc 415 . . . 4  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( ( A  gcd  B )  ||  1  ->  ( A  gcd  B )  <_  1 ) )
124, 11mpd 13 . . 3  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  gcd  B )  <_  1 )
13 simpll 531 . . . . 5  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  e.  ZZ  /\  B  e.  ZZ ) )
14 oveq1 6092 . . . . . . . . . . . . 13  |-  ( A  =  0  ->  ( A  x.  X )  =  ( 0  x.  X ) )
15 oveq1 6092 . . . . . . . . . . . . 13  |-  ( B  =  0  ->  ( B  x.  Y )  =  ( 0  x.  Y ) )
1614, 15oveqan12d 6104 . . . . . . . . . . . 12  |-  ( ( A  =  0  /\  B  =  0 )  ->  ( ( A  x.  X )  +  ( B  x.  Y
) )  =  ( ( 0  x.  X
)  +  ( 0  x.  Y ) ) )
17 zcn 9654 . . . . . . . . . . . . . 14  |-  ( X  e.  ZZ  ->  X  e.  CC )
1817mul02d 8721 . . . . . . . . . . . . 13  |-  ( X  e.  ZZ  ->  (
0  x.  X )  =  0 )
19 zcn 9654 . . . . . . . . . . . . . 14  |-  ( Y  e.  ZZ  ->  Y  e.  CC )
2019mul02d 8721 . . . . . . . . . . . . 13  |-  ( Y  e.  ZZ  ->  (
0  x.  Y )  =  0 )
2118, 20oveqan12d 6104 . . . . . . . . . . . 12  |-  ( ( X  e.  ZZ  /\  Y  e.  ZZ )  ->  ( ( 0  x.  X )  +  ( 0  x.  Y ) )  =  ( 0  +  0 ) )
2216, 21sylan9eqr 2293 . . . . . . . . . . 11  |-  ( ( ( X  e.  ZZ  /\  Y  e.  ZZ )  /\  ( A  =  0  /\  B  =  0 ) )  -> 
( ( A  x.  X )  +  ( B  x.  Y ) )  =  ( 0  +  0 ) )
23 00id 8469 . . . . . . . . . . 11  |-  ( 0  +  0 )  =  0
2422, 23eqtrdi 2287 . . . . . . . . . 10  |-  ( ( ( X  e.  ZZ  /\  Y  e.  ZZ )  /\  ( A  =  0  /\  B  =  0 ) )  -> 
( ( A  x.  X )  +  ( B  x.  Y ) )  =  0 )
2524adantll 480 . . . . . . . . 9  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( A  =  0  /\  B  =  0
) )  ->  (
( A  x.  X
)  +  ( B  x.  Y ) )  =  0 )
26 0ne1 9374 . . . . . . . . . 10  |-  0  =/=  1
2726a1i 9 . . . . . . . . 9  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( A  =  0  /\  B  =  0
) )  ->  0  =/=  1 )
2825, 27eqnetrd 2444 . . . . . . . 8  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( A  =  0  /\  B  =  0
) )  ->  (
( A  x.  X
)  +  ( B  x.  Y ) )  =/=  1 )
2928ex 115 . . . . . . 7  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  -> 
( ( A  =  0  /\  B  =  0 )  ->  (
( A  x.  X
)  +  ( B  x.  Y ) )  =/=  1 ) )
3029necon2bd 2478 . . . . . 6  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  -> 
( ( ( A  x.  X )  +  ( B  x.  Y
) )  =  1  ->  -.  ( A  =  0  /\  B  =  0 ) ) )
3130imp 124 . . . . 5  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  -.  ( A  =  0  /\  B  =  0 ) )
32 gcdn0cl 12758 . . . . 5  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  -.  ( A  =  0  /\  B  =  0 ) )  ->  ( A  gcd  B )  e.  NN )
3313, 31, 32syl2anc 415 . . . 4  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  gcd  B )  e.  NN )
34 nnle1eq1 9331 . . . 4  |-  ( ( A  gcd  B )  e.  NN  ->  (
( A  gcd  B
)  <_  1  <->  ( A  gcd  B )  =  1 ) )
3533, 34syl 14 . . 3  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( ( A  gcd  B )  <_ 
1  <->  ( A  gcd  B )  =  1 ) )
3612, 35mpbid 147 . 2  |-  ( ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  /\  ( ( A  x.  X )  +  ( B  x.  Y ) )  =  1 )  ->  ( A  gcd  B )  =  1 )
3736ex 115 1  |-  ( ( ( A  e.  ZZ  /\  B  e.  ZZ )  /\  ( X  e.  ZZ  /\  Y  e.  ZZ ) )  -> 
( ( ( A  x.  X )  +  ( B  x.  Y
) )  =  1  ->  ( A  gcd  B )  =  1 ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    =/= wne 2420   class class class wbr 4130  (class class class)co 6085   0cc0 8180   1c1 8181    + caddc 8183    x. cmul 8185    <_ cle 8362   NNcn 9307   ZZcz 9649    || cdvds 12573    gcd cgcd 12749
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298  ax-arch 8299  ax-caucvg 8300
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-sup 7325  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-n0 9569  df-z 9650  df-uz 9932  df-q 10030  df-rp 10066  df-fz 10423  df-fzo 10561  df-fl 10716  df-mod 10775  df-seqfrec 10900  df-exp 10991  df-cj 11623  df-re 11624  df-im 11625  df-rsqrt 11780  df-abs 11781  df-dvds 12574  df-gcd 12750
This theorem is used by:  divgcdcoprm0  12898
  Copyright terms: Public domain W3C validator