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

Theorem mul2sq 16115
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 16113 . 2  |-  ( A  e.  S  <->  E. x  e.  ZZ[_i]  A  =  ( ( abs `  x ) ^
2 ) )
312sqlem1 16113 . 2  |-  ( B  e.  S  <->  E. y  e.  ZZ[_i]  B  =  ( ( abs `  y ) ^
2 ) )
4 reeanv 2715 . . 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 13101 . . . . . . 7  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( x  x.  y )  e.  ZZ[_i] )
6 gzcn 13095 . . . . . . . . . 10  |-  ( x  e.  ZZ[_i]  ->  x  e.  CC )
7 gzcn 13095 . . . . . . . . . 10  |-  ( y  e.  ZZ[_i]  ->  y  e.  CC )
8 absmul 11779 . . . . . . . . . 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 6073 . . . . . . . 8  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( ( abs `  ( x  x.  y ) ) ^
2 )  =  ( ( ( abs `  x
)  x.  ( abs `  y ) ) ^
2 ) )
116abscld 11891 . . . . . . . . . 10  |-  ( x  e.  ZZ[_i]  ->  ( abs `  x )  e.  RR )
1211recnd 8318 . . . . . . . . 9  |-  ( x  e.  ZZ[_i]  ->  ( abs `  x )  e.  CC )
137abscld 11891 . . . . . . . . . 10  |-  ( y  e.  ZZ[_i]  ->  ( abs `  y )  e.  RR )
1413recnd 8318 . . . . . . . . 9  |-  ( y  e.  ZZ[_i]  ->  ( abs `  y )  e.  CC )
15 sqmul 10987 . . . . . . . . 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 2268 . . . . . . 7  |-  ( ( x  e.  ZZ[_i]  /\  y  e.  ZZ[_i]
)  ->  ( (
( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) )  =  ( ( abs `  (
x  x.  y ) ) ^ 2 ) )
18 fveq2 5675 . . . . . . . . 9  |-  ( z  =  ( x  x.  y )  ->  ( abs `  z )  =  ( abs `  (
x  x.  y ) ) )
1918oveq1d 6073 . . . . . . . 8  |-  ( z  =  ( x  x.  y )  ->  (
( abs `  z
) ^ 2 )  =  ( ( abs `  ( x  x.  y
) ) ^ 2 ) )
2019rspceeqv 2942 . . . . . . 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 16113 . . . . . 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 6067 . . . . . 6  |-  ( ( A  =  ( ( abs `  x ) ^ 2 )  /\  B  =  ( ( abs `  y ) ^
2 ) )  -> 
( A  x.  B
)  =  ( ( ( abs `  x
) ^ 2 )  x.  ( ( abs `  y ) ^ 2 ) ) )
2524eleq1d 2303 . . . . 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 2668 . . 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 1398    e. wcel 2205   E.wrex 2523    |-> cmpt 4176   ran crn 4755   ` cfv 5357  (class class class)co 6058   CCcc 8141    x. cmul 8148   2c2 9305   ^cexp 10924   abscabs 11707   ZZ[_i]cgz 13092
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-n0 9514  df-z 9595  df-uz 9872  df-rp 10005  df-seqfrec 10834  df-exp 10925  df-cj 11552  df-re 11553  df-im 11554  df-rsqrt 11708  df-abs 11709  df-gz 13093
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator