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

Theorem mul2sq 14023
Description: Fibonacci's identity (actually due to Diophantus). The product of two sums of two squares is also a sum of two squares. We can take advantage of Gaussian integers here to trivialize the proof. (Contributed by Mario Carneiro, 19-Jun-2015.)
Hypothesis
Ref Expression
2sq.1  |-  S  =  ran  ( w  e.  ZZ[_i]  |->  ( ( abs `  w
) ^ 2 ) )
Assertion
Ref Expression
mul2sq  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( A  x.  B
)  e.  S )

Proof of Theorem mul2sq
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2sq.1 . . 3  |-  S  =  ran  ( w  e.  ZZ[_i]  |->  ( ( abs `  w
) ^ 2 ) )
212sqlem1 14021 . 2  |-  ( A  e.  S  <->  E. x  e.  ZZ[_i]  A  =  ( ( abs `  x ) ^
2 ) )
312sqlem1 14021 . 2  |-  ( B  e.  S  <->  E. y  e.  ZZ[_i]  B  =  ( ( abs `  y ) ^
2 ) )
4 reeanv 2644 . . 3  |-  ( E. x  e.  ZZ[_i]  E. y  e.  ZZ[_i] 
( A  =  ( ( abs `  x
) ^ 2 )  /\  B  =  ( ( abs `  y
) ^ 2 ) )  <->  ( E. x  e.  ZZ[_i]  A  =  ( ( abs `  x ) ^
2 )  /\  E. y  e.  ZZ[_i]  B  =  ( ( abs `  y
) ^ 2 ) ) )
5 gzmulcl 12343 . . . . . . 7  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( x  x.  y )  e.  ZZ[_i] )
6 gzcn 12337 . . . . . . . . . 10  |-  ( x  e.  ZZ[_i]  ->  x  e.  CC )
7 gzcn 12337 . . . . . . . . . 10  |-  ( y  e.  ZZ[_i]  ->  y  e.  CC )
8 absmul 11046 . . . . . . . . . 10  |-  ( ( x  e.  CC  /\  y  e.  CC )  ->  ( abs `  (
x  x.  y ) )  =  ( ( abs `  x )  x.  ( abs `  y
) ) )
96, 7, 8syl2an 289 . . . . . . . . 9  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( abs `  ( x  x.  y
) )  =  ( ( abs `  x
)  x.  ( abs `  y ) ) )
109oveq1d 5880 . . . . . . . 8  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( ( abs `  ( x  x.  y ) ) ^
2 )  =  ( ( ( abs `  x
)  x.  ( abs `  y ) ) ^
2 ) )
116abscld 11158 . . . . . . . . . 10  |-  ( x  e.  ZZ[_i]  ->  ( abs `  x )  e.  RR )
1211recnd 7960 . . . . . . . . 9  |-  ( x  e.  ZZ[_i]  ->  ( abs `  x )  e.  CC )
137abscld 11158 . . . . . . . . . 10  |-  ( y  e.  ZZ[_i]  ->  ( abs `  y )  e.  RR )
1413recnd 7960 . . . . . . . . 9  |-  ( y  e.  ZZ[_i]  ->  ( abs `  y )  e.  CC )
15 sqmul 10552 . . . . . . . . 9  |-  ( ( ( abs `  x
)  e.  CC  /\  ( abs `  y )  e.  CC )  -> 
( ( ( abs `  x )  x.  ( abs `  y ) ) ^ 2 )  =  ( ( ( abs `  x ) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) ) )
1612, 14, 15syl2an 289 . . . . . . . 8  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( (
( abs `  x
)  x.  ( abs `  y ) ) ^
2 )  =  ( ( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) ) )
1710, 16eqtr2d 2209 . . . . . . 7  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( (
( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  (
x  x.  y ) ) ^ 2 ) )
18 fveq2 5507 . . . . . . . . 9  |-  ( z  =  ( x  x.  y )  ->  ( abs `  z )  =  ( abs `  (
x  x.  y ) ) )
1918oveq1d 5880 . . . . . . . 8  |-  ( z  =  ( x  x.  y )  ->  (
( abs `  z
) ^ 2 )  =  ( ( abs `  ( x  x.  y
) ) ^ 2 ) )
2019rspceeqv 2857 . . . . . . 7  |-  ( ( ( x  x.  y
)  e.  ZZ[_i]  /\  (
( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  (
x  x.  y ) ) ^ 2 ) )  ->  E. z  e.  ZZ[_i] 
( ( ( abs `  x ) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  z ) ^ 2 ) )
215, 17, 20syl2anc 411 . . . . . 6  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  E. z  e.  ZZ[_i] 
( ( ( abs `  x ) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  z ) ^ 2 ) )
2212sqlem1 14021 . . . . . 6  |-  ( ( ( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  e.  S  <->  E. z  e.  ZZ[_i]  ( (
( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  z
) ^ 2 ) )
2321, 22sylibr 134 . . . . 5  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( (
( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  e.  S
)
24 oveq12 5874 . . . . . 6  |-  ( ( A  =  ( ( abs `  x ) ^ 2 )  /\  B  =  ( ( abs `  y ) ^
2 ) )  -> 
( A  x.  B
)  =  ( ( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) ) )
2524eleq1d 2244 . . . . 5  |-  ( ( A  =  ( ( abs `  x ) ^ 2 )  /\  B  =  ( ( abs `  y ) ^
2 ) )  -> 
( ( A  x.  B )  e.  S  <->  ( ( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  e.  S
) )
2623, 25syl5ibrcom 157 . . . 4  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( ( A  =  ( ( abs `  x ) ^
2 )  /\  B  =  ( ( abs `  y ) ^ 2 ) )  ->  ( A  x.  B )  e.  S ) )
2726rexlimivv 2598 . . 3  |-  ( E. x  e.  ZZ[_i]  E. y  e.  ZZ[_i] 
( A  =  ( ( abs `  x
) ^ 2 )  /\  B  =  ( ( abs `  y
) ^ 2 ) )  ->  ( A  x.  B )  e.  S
)
284, 27sylbir 135 . 2  |-  ( ( E. x  e.  ZZ[_i]  A  =  ( ( abs `  x ) ^ 2 )  /\  E. y  e.  ZZ[_i]  B  =  ( ( abs `  y ) ^
2 ) )  -> 
( A  x.  B
)  e.  S )
292, 3, 28syl2anb 291 1  |-  ( ( A  e.  S  /\  B  e.  S )  ->  ( A  x.  B
)  e.  S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1353    e. wcel 2146   E.wrex 2454    |-> cmpt 4059   ran crn 4621   ` cfv 5208  (class class class)co 5865   CCcc 7784    x. cmul 7791   2c2 8943   ^cexp 10489   abscabs 10974   ZZ[_i]cgz 12334
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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-coll 4113  ax-sep 4116  ax-nul 4124  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-iinf 4581  ax-cnex 7877  ax-resscn 7878  ax-1cn 7879  ax-1re 7880  ax-icn 7881  ax-addcl 7882  ax-addrcl 7883  ax-mulcl 7884  ax-mulrcl 7885  ax-addcom 7886  ax-mulcom 7887  ax-addass 7888  ax-mulass 7889  ax-distr 7890  ax-i2m1 7891  ax-0lt1 7892  ax-1rid 7893  ax-0id 7894  ax-rnegex 7895  ax-precex 7896  ax-cnre 7897  ax-pre-ltirr 7898  ax-pre-ltwlin 7899  ax-pre-lttrn 7900  ax-pre-apti 7901  ax-pre-ltadd 7902  ax-pre-mulgt0 7903  ax-pre-mulext 7904  ax-arch 7905  ax-caucvg 7906
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-nel 2441  df-ral 2458  df-rex 2459  df-reu 2460  df-rmo 2461  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-nul 3421  df-if 3533  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-tr 4097  df-id 4287  df-po 4290  df-iso 4291  df-iord 4360  df-on 4362  df-ilim 4363  df-suc 4365  df-iom 4584  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-f1 5213  df-fo 5214  df-f1o 5215  df-fv 5216  df-riota 5821  df-ov 5868  df-oprab 5869  df-mpo 5870  df-1st 6131  df-2nd 6132  df-recs 6296  df-frec 6382  df-pnf 7968  df-mnf 7969  df-xr 7970  df-ltxr 7971  df-le 7972  df-sub 8104  df-neg 8105  df-reap 8506  df-ap 8513  df-div 8603  df-inn 8893  df-2 8951  df-3 8952  df-4 8953  df-n0 9150  df-z 9227  df-uz 9502  df-rp 9625  df-seqfrec 10416  df-exp 10490  df-cj 10819  df-re 10820  df-im 10821  df-rsqrt 10975  df-abs 10976  df-gz 12335
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator