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

Theorem mul2sq 15626
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 15624 . 2  |-  ( A  e.  S  <->  E. x  e.  ZZ[_i]  A  =  ( ( abs `  x ) ^
2 ) )
312sqlem1 15624 . 2  |-  ( B  e.  S  <->  E. y  e.  ZZ[_i]  B  =  ( ( abs `  y ) ^
2 ) )
4 reeanv 2676 . . 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 12734 . . . . . . 7  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( x  x.  y )  e.  ZZ[_i] )
6 gzcn 12728 . . . . . . . . . 10  |-  ( x  e.  ZZ[_i]  ->  x  e.  CC )
7 gzcn 12728 . . . . . . . . . 10  |-  ( y  e.  ZZ[_i]  ->  y  e.  CC )
8 absmul 11413 . . . . . . . . . 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 5961 . . . . . . . 8  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( ( abs `  ( x  x.  y ) ) ^
2 )  =  ( ( ( abs `  x
)  x.  ( abs `  y ) ) ^
2 ) )
116abscld 11525 . . . . . . . . . 10  |-  ( x  e.  ZZ[_i]  ->  ( abs `  x )  e.  RR )
1211recnd 8103 . . . . . . . . 9  |-  ( x  e.  ZZ[_i]  ->  ( abs `  x )  e.  CC )
137abscld 11525 . . . . . . . . . 10  |-  ( y  e.  ZZ[_i]  ->  ( abs `  y )  e.  RR )
1413recnd 8103 . . . . . . . . 9  |-  ( y  e.  ZZ[_i]  ->  ( abs `  y )  e.  CC )
15 sqmul 10748 . . . . . . . . 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 2239 . . . . . . 7  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( (
( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  (
x  x.  y ) ) ^ 2 ) )
18 fveq2 5578 . . . . . . . . 9  |-  ( z  =  ( x  x.  y )  ->  ( abs `  z )  =  ( abs `  (
x  x.  y ) ) )
1918oveq1d 5961 . . . . . . . 8  |-  ( z  =  ( x  x.  y )  ->  (
( abs `  z
) ^ 2 )  =  ( ( abs `  ( x  x.  y
) ) ^ 2 ) )
2019rspceeqv 2895 . . . . . . 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 15624 . . . . . 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 5955 . . . . . 6  |-  ( ( A  =  ( ( abs `  x ) ^ 2 )  /\  B  =  ( ( abs `  y ) ^
2 ) )  -> 
( A  x.  B
)  =  ( ( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) ) )
2524eleq1d 2274 . . . . 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 2629 . . 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 1373    e. wcel 2176   E.wrex 2485    |-> cmpt 4106   ran crn 4677   ` cfv 5272  (class class class)co 5946   CCcc 7925    x. cmul 7932   2c2 9089   ^cexp 10685   abscabs 11341   ZZ[_i]cgz 12725
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4160  ax-sep 4163  ax-nul 4171  ax-pow 4219  ax-pr 4254  ax-un 4481  ax-setind 4586  ax-iinf 4637  ax-cnex 8018  ax-resscn 8019  ax-1cn 8020  ax-1re 8021  ax-icn 8022  ax-addcl 8023  ax-addrcl 8024  ax-mulcl 8025  ax-mulrcl 8026  ax-addcom 8027  ax-mulcom 8028  ax-addass 8029  ax-mulass 8030  ax-distr 8031  ax-i2m1 8032  ax-0lt1 8033  ax-1rid 8034  ax-0id 8035  ax-rnegex 8036  ax-precex 8037  ax-cnre 8038  ax-pre-ltirr 8039  ax-pre-ltwlin 8040  ax-pre-lttrn 8041  ax-pre-apti 8042  ax-pre-ltadd 8043  ax-pre-mulgt0 8044  ax-pre-mulext 8045  ax-arch 8046  ax-caucvg 8047
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-if 3572  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4046  df-opab 4107  df-mpt 4108  df-tr 4144  df-id 4341  df-po 4344  df-iso 4345  df-iord 4414  df-on 4416  df-ilim 4417  df-suc 4419  df-iom 4640  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-ima 4689  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-f1 5277  df-fo 5278  df-f1o 5279  df-fv 5280  df-riota 5901  df-ov 5949  df-oprab 5950  df-mpo 5951  df-1st 6228  df-2nd 6229  df-recs 6393  df-frec 6479  df-pnf 8111  df-mnf 8112  df-xr 8113  df-ltxr 8114  df-le 8115  df-sub 8247  df-neg 8248  df-reap 8650  df-ap 8657  df-div 8748  df-inn 9039  df-2 9097  df-3 9098  df-4 9099  df-n0 9298  df-z 9375  df-uz 9651  df-rp 9778  df-seqfrec 10595  df-exp 10686  df-cj 11186  df-re 11187  df-im 11188  df-rsqrt 11342  df-abs 11343  df-gz 12726
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator