Theorem recextlem1 8830

Description: Lemma for recexap 8832. (Contributed by Eric Schmidt, 23-May-2007.)

Assertion

Ref	Expression
recextlem1	|- ( ( A e. CC /\ B e. CC ) -> ( ( A + ( _i x. B ) ) x. ( A - ( _i x. B ) ) ) = ( ( A x. A ) + ( B x. B ) ) )

Proof of Theorem recextlem1

Step	Hyp	Ref	Expression
1		simpl 109	. . 3 |- ( ( A e. CC /\ B e. CC ) -> A e. CC )
2		ax-icn 8126	. . . . 5 |- _i e. CC
3		mulcl 8158	. . . . 5 |- ( ( _i e. CC /\ B e. CC ) -> ( _i x. B ) e. CC )
4	2, 3	mpan 424	. . . 4 |- ( B e. CC -> ( _i x. B ) e. CC )
5	4	adantl 277	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( _i x. B ) e. CC )
6		subcl 8377	. . . 4 |- ( ( A e. CC /\ ( _i x. B ) e. CC ) -> ( A - ( _i x. B ) ) e. CC )
7	4, 6	sylan2 286	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( A - ( _i x. B ) ) e. CC )
8	1, 5, 7	adddird 8204	. 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( A + ( _i x. B ) ) x. ( A - ( _i x. B ) ) ) = ( ( A x. ( A - ( _i x. B ) ) ) + ( ( _i x. B ) x. ( A - ( _i x. B ) ) ) ) )
9	1, 1, 5	subdid 8592	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( A x. ( A - ( _i x. B ) ) ) = ( ( A x. A ) - ( A x. ( _i x. B ) ) ) )
10	5, 1, 5	subdid 8592	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( _i x. B ) x. ( A - ( _i x. B ) ) ) = ( ( ( _i x. B ) x. A ) - ( ( _i x. B ) x. ( _i x. B ) ) ) )
11		mulcom 8160	. . . . . 6 |- ( ( A e. CC /\ ( _i x. B ) e. CC ) -> ( A x. ( _i x. B ) ) = ( ( _i x. B ) x. A ) )
12	4, 11	sylan2 286	. . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( A x. ( _i x. B ) ) = ( ( _i x. B ) x. A ) )
13		ixi 8762	. . . . . . . . . 10 |- ( _i x. _i ) = -u 1
14	13	oveq1i 6027	. . . . . . . . 9 |- ( ( _i x. _i ) x. ( B x. B ) ) = ( -u 1 x. ( B x. B ) )
15		mulcl 8158	. . . . . . . . . 10 |- ( ( B e. CC /\ B e. CC ) -> ( B x. B ) e. CC )
16	15	mulm1d 8588	. . . . . . . . 9 |- ( ( B e. CC /\ B e. CC ) -> ( -u 1 x. ( B x. B ) ) = -u ( B x. B ) )
17	14, 16	eqtr2id 2277	. . . . . . . 8 |- ( ( B e. CC /\ B e. CC ) -> -u ( B x. B ) = ( ( _i x. _i ) x. ( B x. B ) ) )
18		mul4 8310	. . . . . . . . 9 |- ( ( ( _i e. CC /\ _i e. CC ) /\ ( B e. CC /\ B e. CC ) ) -> ( ( _i x. _i ) x. ( B x. B ) ) = ( ( _i x. B ) x. ( _i x. B ) ) )
19	2, 2, 18	mpanl12 436	. . . . . . . 8 |- ( ( B e. CC /\ B e. CC ) -> ( ( _i x. _i ) x. ( B x. B ) ) = ( ( _i x. B ) x. ( _i x. B ) ) )
20	17, 19	eqtrd 2264	. . . . . . 7 |- ( ( B e. CC /\ B e. CC ) -> -u ( B x. B ) = ( ( _i x. B ) x. ( _i x. B ) ) )
21	20	anidms 397	. . . . . 6 |- ( B e. CC -> -u ( B x. B ) = ( ( _i x. B ) x. ( _i x. B ) ) )
22	21	adantl 277	. . . . 5 |- ( ( A e. CC /\ B e. CC ) -> -u ( B x. B ) = ( ( _i x. B ) x. ( _i x. B ) ) )
23	12, 22	oveq12d 6035	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. ( _i x. B ) ) - -u ( B x. B ) ) = ( ( ( _i x. B ) x. A ) - ( ( _i x. B ) x. ( _i x. B ) ) ) )
24	10, 23	eqtr4d 2267	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( _i x. B ) x. ( A - ( _i x. B ) ) ) = ( ( A x. ( _i x. B ) ) - -u ( B x. B ) ) )
25	9, 24	oveq12d 6035	. 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. ( A - ( _i x. B ) ) ) + ( ( _i x. B ) x. ( A - ( _i x. B ) ) ) ) = ( ( ( A x. A ) - ( A x. ( _i x. B ) ) ) + ( ( A x. ( _i x. B ) ) - -u ( B x. B ) ) ) )
26		mulcl 8158	. . . . . 6 |- ( ( A e. CC /\ A e. CC ) -> ( A x. A ) e. CC )
27	26	anidms 397	. . . . 5 |- ( A e. CC -> ( A x. A ) e. CC )
28	27	adantr 276	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( A x. A ) e. CC )
29		mulcl 8158	. . . . 5 |- ( ( A e. CC /\ ( _i x. B ) e. CC ) -> ( A x. ( _i x. B ) ) e. CC )
30	4, 29	sylan2 286	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( A x. ( _i x. B ) ) e. CC )
31	15	negcld 8476	. . . . . 6 |- ( ( B e. CC /\ B e. CC ) -> -u ( B x. B ) e. CC )
32	31	anidms 397	. . . . 5 |- ( B e. CC -> -u ( B x. B ) e. CC )
33	32	adantl 277	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> -u ( B x. B ) e. CC )
34	28, 30, 33	npncand 8513	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A x. A ) - ( A x. ( _i x. B ) ) ) + ( ( A x. ( _i x. B ) ) - -u ( B x. B ) ) ) = ( ( A x. A ) - -u ( B x. B ) ) )
35	15	anidms 397	. . . 4 |- ( B e. CC -> ( B x. B ) e. CC )
36		subneg 8427	. . . 4 |- ( ( ( A x. A ) e. CC /\ ( B x. B ) e. CC ) -> ( ( A x. A ) - -u ( B x. B ) ) = ( ( A x. A ) + ( B x. B ) ) )
37	27, 35, 36	syl2an 289	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. A ) - -u ( B x. B ) ) = ( ( A x. A ) + ( B x. B ) ) )
38	34, 37	eqtrd 2264	. 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A x. A ) - ( A x. ( _i x. B ) ) ) + ( ( A x. ( _i x. B ) ) - -u ( B x. B ) ) ) = ( ( A x. A ) + ( B x. B ) ) )
39	8, 25, 38	3eqtrd 2268	1 |- ( ( A e. CC /\ B e. CC ) -> ( ( A + ( _i x. B ) ) x. ( A - ( _i x. B ) ) ) = ( ( A x. A ) + ( B x. B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1397   e. wcel 2202  (class class class)co 6017   CCcc 8029   1c1 8032   _ici 8033   + caddc 8034   x. cmul 8036   - cmin 8349   -ucneg 8350

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635  ax-resscn 8123  ax-1cn 8124  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-mulcom 8132  ax-addass 8133  ax-mulass 8134  ax-distr 8135  ax-i2m1 8136  ax-1rid 8138  ax-0id 8139  ax-rnegex 8140  ax-cnre 8142

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-riota 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-sub 8351  df-neg 8352

This theorem is referenced by:  recexap  8832