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

Theorem gcd0id 10370
Description: The gcd of 0 and an integer is the integer's absolute value. (Contributed by Paul Chapman, 21-Mar-2011.)
Assertion
Ref Expression
gcd0id  |-  ( N  e.  ZZ  ->  (
0  gcd  N )  =  ( abs `  N
) )

Proof of Theorem gcd0id
StepHypRef Expression
1 gcd0val 10352 . . . 4  |-  ( 0  gcd  0 )  =  0
2 oveq2 5540 . . . 4  |-  ( N  =  0  ->  (
0  gcd  N )  =  ( 0  gcd  0 ) )
3 fveq2 5198 . . . . 5  |-  ( N  =  0  ->  ( abs `  N )  =  ( abs `  0
) )
4 abs0 9944 . . . . 5  |-  ( abs `  0 )  =  0
53, 4syl6eq 2129 . . . 4  |-  ( N  =  0  ->  ( abs `  N )  =  0 )
61, 2, 53eqtr4a 2139 . . 3  |-  ( N  =  0  ->  (
0  gcd  N )  =  ( abs `  N
) )
76adantl 271 . 2  |-  ( ( N  e.  ZZ  /\  N  =  0 )  ->  ( 0  gcd 
N )  =  ( abs `  N ) )
8 df-ne 2246 . . 3  |-  ( N  =/=  0  <->  -.  N  =  0 )
9 0z 8362 . . . . . . . 8  |-  0  e.  ZZ
10 gcddvds 10355 . . . . . . . 8  |-  ( ( 0  e.  ZZ  /\  N  e.  ZZ )  ->  ( ( 0  gcd 
N )  ||  0  /\  ( 0  gcd  N
)  ||  N )
)
119, 10mpan 414 . . . . . . 7  |-  ( N  e.  ZZ  ->  (
( 0  gcd  N
)  ||  0  /\  ( 0  gcd  N
)  ||  N )
)
1211simprd 112 . . . . . 6  |-  ( N  e.  ZZ  ->  (
0  gcd  N )  ||  N )
1312adantr 270 . . . . 5  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( 0  gcd  N
)  ||  N )
14 gcdcl 10358 . . . . . . . . 9  |-  ( ( 0  e.  ZZ  /\  N  e.  ZZ )  ->  ( 0  gcd  N
)  e.  NN0 )
159, 14mpan 414 . . . . . . . 8  |-  ( N  e.  ZZ  ->  (
0  gcd  N )  e.  NN0 )
1615nn0zd 8467 . . . . . . 7  |-  ( N  e.  ZZ  ->  (
0  gcd  N )  e.  ZZ )
17 dvdsleabs 10245 . . . . . . 7  |-  ( ( ( 0  gcd  N
)  e.  ZZ  /\  N  e.  ZZ  /\  N  =/=  0 )  ->  (
( 0  gcd  N
)  ||  N  ->  ( 0  gcd  N )  <_  ( abs `  N
) ) )
1816, 17syl3an1 1202 . . . . . 6  |-  ( ( N  e.  ZZ  /\  N  e.  ZZ  /\  N  =/=  0 )  ->  (
( 0  gcd  N
)  ||  N  ->  ( 0  gcd  N )  <_  ( abs `  N
) ) )
19183anidm12 1226 . . . . 5  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( ( 0  gcd 
N )  ||  N  ->  ( 0  gcd  N
)  <_  ( abs `  N ) ) )
2013, 19mpd 13 . . . 4  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( 0  gcd  N
)  <_  ( abs `  N ) )
21 zabscl 9972 . . . . . . . 8  |-  ( N  e.  ZZ  ->  ( abs `  N )  e.  ZZ )
22 dvds0 10210 . . . . . . . 8  |-  ( ( abs `  N )  e.  ZZ  ->  ( abs `  N )  ||  0 )
2321, 22syl 14 . . . . . . 7  |-  ( N  e.  ZZ  ->  ( abs `  N )  ||  0 )
24 iddvds 10208 . . . . . . . 8  |-  ( N  e.  ZZ  ->  N  ||  N )
25 absdvdsb 10213 . . . . . . . . 9  |-  ( ( N  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  ||  N  <->  ( abs `  N ) 
||  N ) )
2625anidms 389 . . . . . . . 8  |-  ( N  e.  ZZ  ->  ( N  ||  N  <->  ( abs `  N )  ||  N
) )
2724, 26mpbid 145 . . . . . . 7  |-  ( N  e.  ZZ  ->  ( abs `  N )  ||  N )
2823, 27jca 300 . . . . . 6  |-  ( N  e.  ZZ  ->  (
( abs `  N
)  ||  0  /\  ( abs `  N ) 
||  N ) )
2928adantr 270 . . . . 5  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( ( abs `  N
)  ||  0  /\  ( abs `  N ) 
||  N ) )
30 eqid 2081 . . . . . . . . 9  |-  0  =  0
3130biantrur 297 . . . . . . . 8  |-  ( N  =  0  <->  ( 0  =  0  /\  N  =  0 ) )
3231necon3abii 2281 . . . . . . 7  |-  ( N  =/=  0  <->  -.  (
0  =  0  /\  N  =  0 ) )
33 dvdslegcd 10356 . . . . . . . . . 10  |-  ( ( ( ( abs `  N
)  e.  ZZ  /\  0  e.  ZZ  /\  N  e.  ZZ )  /\  -.  ( 0  =  0  /\  N  =  0 ) )  ->  (
( ( abs `  N
)  ||  0  /\  ( abs `  N ) 
||  N )  -> 
( abs `  N
)  <_  ( 0  gcd  N ) ) )
3433ex 113 . . . . . . . . 9  |-  ( ( ( abs `  N
)  e.  ZZ  /\  0  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( 0  =  0  /\  N  =  0 )  ->  ( (
( abs `  N
)  ||  0  /\  ( abs `  N ) 
||  N )  -> 
( abs `  N
)  <_  ( 0  gcd  N ) ) ) )
359, 34mp3an2 1256 . . . . . . . 8  |-  ( ( ( abs `  N
)  e.  ZZ  /\  N  e.  ZZ )  ->  ( -.  ( 0  =  0  /\  N  =  0 )  -> 
( ( ( abs `  N )  ||  0  /\  ( abs `  N
)  ||  N )  ->  ( abs `  N
)  <_  ( 0  gcd  N ) ) ) )
3621, 35mpancom 413 . . . . . . 7  |-  ( N  e.  ZZ  ->  ( -.  ( 0  =  0  /\  N  =  0 )  ->  ( (
( abs `  N
)  ||  0  /\  ( abs `  N ) 
||  N )  -> 
( abs `  N
)  <_  ( 0  gcd  N ) ) ) )
3732, 36syl5bi 150 . . . . . 6  |-  ( N  e.  ZZ  ->  ( N  =/=  0  ->  (
( ( abs `  N
)  ||  0  /\  ( abs `  N ) 
||  N )  -> 
( abs `  N
)  <_  ( 0  gcd  N ) ) ) )
3837imp 122 . . . . 5  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( ( ( abs `  N )  ||  0  /\  ( abs `  N
)  ||  N )  ->  ( abs `  N
)  <_  ( 0  gcd  N ) ) )
3929, 38mpd 13 . . . 4  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( abs `  N
)  <_  ( 0  gcd  N ) )
4016zred 8469 . . . . . 6  |-  ( N  e.  ZZ  ->  (
0  gcd  N )  e.  RR )
4121zred 8469 . . . . . 6  |-  ( N  e.  ZZ  ->  ( abs `  N )  e.  RR )
4240, 41letri3d 7226 . . . . 5  |-  ( N  e.  ZZ  ->  (
( 0  gcd  N
)  =  ( abs `  N )  <->  ( (
0  gcd  N )  <_  ( abs `  N
)  /\  ( abs `  N )  <_  (
0  gcd  N )
) ) )
4342adantr 270 . . . 4  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( ( 0  gcd 
N )  =  ( abs `  N )  <-> 
( ( 0  gcd 
N )  <_  ( abs `  N )  /\  ( abs `  N )  <_  ( 0  gcd 
N ) ) ) )
4420, 39, 43mpbir2and 885 . . 3  |-  ( ( N  e.  ZZ  /\  N  =/=  0 )  -> 
( 0  gcd  N
)  =  ( abs `  N ) )
458, 44sylan2br 282 . 2  |-  ( ( N  e.  ZZ  /\  -.  N  =  0
)  ->  ( 0  gcd  N )  =  ( abs `  N
) )
46 zdceq 8423 . . . 4  |-  ( ( N  e.  ZZ  /\  0  e.  ZZ )  -> DECID  N  =  0 )
479, 46mpan2 415 . . 3  |-  ( N  e.  ZZ  -> DECID  N  =  0
)
48 exmiddc 777 . . 3  |-  (DECID  N  =  0  ->  ( N  =  0  \/  -.  N  =  0 ) )
4947, 48syl 14 . 2  |-  ( N  e.  ZZ  ->  ( N  =  0  \/  -.  N  =  0
) )
507, 45, 49mpjaodan 744 1  |-  ( N  e.  ZZ  ->  (
0  gcd  N )  =  ( abs `  N
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 102    <-> wb 103    \/ wo 661  DECID wdc 775    /\ w3a 919    = wceq 1284    e. wcel 1433    =/= wne 2245   class class class wbr 3785   ` cfv 4922  (class class class)co 5532   0cc0 6981    <_ cle 7154   NN0cn0 8288   ZZcz 8351   abscabs 9883    || cdvds 10195    gcd cgcd 10338
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-mulrcl 7075  ax-addcom 7076  ax-mulcom 7077  ax-addass 7078  ax-mulass 7079  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-1rid 7083  ax-0id 7084  ax-rnegex 7085  ax-precex 7086  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-apti 7091  ax-pre-ltadd 7092  ax-pre-mulgt0 7093  ax-pre-mulext 7094  ax-arch 7095  ax-caucvg 7096
This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-reu 2355  df-rmo 2356  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-if 3352  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-frec 6001  df-sup 6397  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-sub 7281  df-neg 7282  df-reap 7675  df-ap 7682  df-div 7761  df-inn 8040  df-2 8098  df-3 8099  df-4 8100  df-n0 8289  df-z 8352  df-uz 8620  df-q 8705  df-rp 8735  df-fz 9030  df-fzo 9153  df-fl 9274  df-mod 9325  df-iseq 9432  df-iexp 9476  df-cj 9729  df-re 9730  df-im 9731  df-rsqrt 9884  df-abs 9885  df-dvds 10196  df-gcd 10339
This theorem is referenced by:  gcdid0  10371
  Copyright terms: Public domain W3C validator