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

Theorem coprimeprodsq2 12781
Description: If three numbers are coprime, and the square of one is the product of the other two, then there is a formula for the other two in terms of  gcd and square. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)
Assertion
Ref Expression
coprimeprodsq2  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  -> 
( ( C ^
2 )  =  ( A  x.  B )  ->  B  =  ( ( B  gcd  C
) ^ 2 ) ) )

Proof of Theorem coprimeprodsq2
StepHypRef Expression
1 zcn 9451 . . . . . 6  |-  ( A  e.  ZZ  ->  A  e.  CC )
2 nn0cn 9379 . . . . . 6  |-  ( B  e.  NN0  ->  B  e.  CC )
3 mulcom 8128 . . . . . 6  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  =  ( B  x.  A ) )
41, 2, 3syl2an 289 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  NN0 )  -> 
( A  x.  B
)  =  ( B  x.  A ) )
543adant3 1041 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  ->  ( A  x.  B )  =  ( B  x.  A ) )
65adantr 276 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  -> 
( A  x.  B
)  =  ( B  x.  A ) )
76eqeq2d 2241 . 2  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  -> 
( ( C ^
2 )  =  ( A  x.  B )  <-> 
( C ^ 2 )  =  ( B  x.  A ) ) )
8 simpl2 1025 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  ->  B  e.  NN0 )
9 simpl1 1024 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  ->  A  e.  ZZ )
10 simpl3 1026 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  ->  C  e.  NN0 )
11 nn0z 9466 . . . . . 6  |-  ( B  e.  NN0  ->  B  e.  ZZ )
12 gcdcom 12494 . . . . . . . 8  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( A  gcd  B
)  =  ( B  gcd  A ) )
1312oveq1d 6016 . . . . . . 7  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( A  gcd  B )  gcd  C )  =  ( ( B  gcd  A )  gcd 
C ) )
1413eqeq1d 2238 . . . . . 6  |-  ( ( A  e.  ZZ  /\  B  e.  ZZ )  ->  ( ( ( A  gcd  B )  gcd 
C )  =  1  <-> 
( ( B  gcd  A )  gcd  C )  =  1 ) )
1511, 14sylan2 286 . . . . 5  |-  ( ( A  e.  ZZ  /\  B  e.  NN0 )  -> 
( ( ( A  gcd  B )  gcd 
C )  =  1  <-> 
( ( B  gcd  A )  gcd  C )  =  1 ) )
16153adant3 1041 . . . 4  |-  ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  ->  (
( ( A  gcd  B )  gcd  C )  =  1  <->  ( ( B  gcd  A )  gcd 
C )  =  1 ) )
1716biimpa 296 . . 3  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  -> 
( ( B  gcd  A )  gcd  C )  =  1 )
18 coprimeprodsq 12780 . . 3  |-  ( ( ( B  e.  NN0  /\  A  e.  ZZ  /\  C  e.  NN0 )  /\  ( ( B  gcd  A )  gcd  C )  =  1 )  -> 
( ( C ^
2 )  =  ( B  x.  A )  ->  B  =  ( ( B  gcd  C
) ^ 2 ) ) )
198, 9, 10, 17, 18syl31anc 1274 . 2  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  -> 
( ( C ^
2 )  =  ( B  x.  A )  ->  B  =  ( ( B  gcd  C
) ^ 2 ) ) )
207, 19sylbid 150 1  |-  ( ( ( A  e.  ZZ  /\  B  e.  NN0  /\  C  e.  NN0 )  /\  ( ( A  gcd  B )  gcd  C )  =  1 )  -> 
( ( C ^
2 )  =  ( A  x.  B )  ->  B  =  ( ( B  gcd  C
) ^ 2 ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200  (class class class)co 6001   CCcc 7997   1c1 8000    x. cmul 8004   2c2 9161   NN0cn0 9369   ZZcz 9446   ^cexp 10760    gcd cgcd 12474
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-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-mulrcl 8098  ax-addcom 8099  ax-mulcom 8100  ax-addass 8101  ax-mulass 8102  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-1rid 8106  ax-0id 8107  ax-rnegex 8108  ax-precex 8109  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-apti 8114  ax-pre-ltadd 8115  ax-pre-mulgt0 8116  ax-pre-mulext 8117  ax-arch 8118  ax-caucvg 8119
This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  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 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-po 4387  df-iso 4388  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-sup 7151  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-reap 8722  df-ap 8729  df-div 8820  df-inn 9111  df-2 9169  df-3 9170  df-4 9171  df-n0 9370  df-z 9447  df-uz 9723  df-q 9815  df-rp 9850  df-fz 10205  df-fzo 10339  df-fl 10490  df-mod 10545  df-seqfrec 10670  df-exp 10761  df-cj 11353  df-re 11354  df-im 11355  df-rsqrt 11509  df-abs 11510  df-dvds 12299  df-gcd 12475
This theorem is referenced by:  pythagtriplem7  12794
  Copyright terms: Public domain W3C validator