Theorem muleqadd 8998

Description: Property of numbers whose product equals their sum. Equation 5 of [Kreyszig] p. 12. (Contributed by NM, 13-Nov-2006.)

Assertion

Ref	Expression
muleqadd	|- ( ( A e. CC /\ B e. CC ) -> ( ( A x. B ) = ( A + B ) <-> ( ( A - 1 ) x. ( B - 1 ) ) = 1 ) )

Proof of Theorem muleqadd

Step	Hyp	Ref	Expression
1		ax-1cn 8272	. . . . 5 |- 1 e. CC
2		mulsub 8728	. . . . . 6 |- ( ( ( A e. CC /\ 1 e. CC ) /\ ( B e. CC /\ 1 e. CC ) ) -> ( ( A - 1 ) x. ( B - 1 ) ) = ( ( ( A x. B ) + ( 1 x. 1 ) ) - ( ( A x. 1 ) + ( B x. 1 ) ) ) )
3	1, 2	mpanr2 442	. . . . 5 |- ( ( ( A e. CC /\ 1 e. CC ) /\ B e. CC ) -> ( ( A - 1 ) x. ( B - 1 ) ) = ( ( ( A x. B ) + ( 1 x. 1 ) ) - ( ( A x. 1 ) + ( B x. 1 ) ) ) )
4	1, 3	mpanl2 439	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( A - 1 ) x. ( B - 1 ) ) = ( ( ( A x. B ) + ( 1 x. 1 ) ) - ( ( A x. 1 ) + ( B x. 1 ) ) ) )
5	1	mulridi 8328	. . . . . . 7 |- ( 1 x. 1 ) = 1
6	5	oveq2i 6096	. . . . . 6 |- ( ( A x. B ) + ( 1 x. 1 ) ) = ( ( A x. B ) + 1 )
7	6	a1i 9	. . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. B ) + ( 1 x. 1 ) ) = ( ( A x. B ) + 1 ) )
8		mulrid 8323	. . . . . 6 |- ( A e. CC -> ( A x. 1 ) = A )
9		mulrid 8323	. . . . . 6 |- ( B e. CC -> ( B x. 1 ) = B )
10	8, 9	oveqan12d 6104	. . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. 1 ) + ( B x. 1 ) ) = ( A + B ) )
11	7, 10	oveq12d 6103	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A x. B ) + ( 1 x. 1 ) ) - ( ( A x. 1 ) + ( B x. 1 ) ) ) = ( ( ( A x. B ) + 1 ) - ( A + B ) ) )
12		mulcl 8306	. . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( A x. B ) e. CC )
13		addcl 8304	. . . . 5 |- ( ( A e. CC /\ B e. CC ) -> ( A + B ) e. CC )
14		addsub 8537	. . . . . 6 |- ( ( ( A x. B ) e. CC /\ 1 e. CC /\ ( A + B ) e. CC ) -> ( ( ( A x. B ) + 1 ) - ( A + B ) ) = ( ( ( A x. B ) - ( A + B ) ) + 1 ) )
15	1, 14	mp3an2 1366	. . . . 5 |- ( ( ( A x. B ) e. CC /\ ( A + B ) e. CC ) -> ( ( ( A x. B ) + 1 ) - ( A + B ) ) = ( ( ( A x. B ) - ( A + B ) ) + 1 ) )
16	12, 13, 15	syl2anc 415	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A x. B ) + 1 ) - ( A + B ) ) = ( ( ( A x. B ) - ( A + B ) ) + 1 ) )
17	4, 11, 16	3eqtrd 2275	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( A - 1 ) x. ( B - 1 ) ) = ( ( ( A x. B ) - ( A + B ) ) + 1 ) )
18	17	eqeq1d 2247	. 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A - 1 ) x. ( B - 1 ) ) = 1 <-> ( ( ( A x. B ) - ( A + B ) ) + 1 ) = 1 ) )
19	12, 13	subcld 8637	. . . 4 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. B ) - ( A + B ) ) e. CC )
20		0cn 8318	. . . . 5 |- 0 e. CC
21		addcan2 8507	. . . . 5 |- ( ( ( ( A x. B ) - ( A + B ) ) e. CC /\ 0 e. CC /\ 1 e. CC ) -> ( ( ( ( A x. B ) - ( A + B ) ) + 1 ) = ( 0 + 1 ) <-> ( ( A x. B ) - ( A + B ) ) = 0 ) )
22	20, 1, 21	mp3an23 1370	. . . 4 |- ( ( ( A x. B ) - ( A + B ) ) e. CC -> ( ( ( ( A x. B ) - ( A + B ) ) + 1 ) = ( 0 + 1 ) <-> ( ( A x. B ) - ( A + B ) ) = 0 ) )
23	19, 22	syl 14	. . 3 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( ( A x. B ) - ( A + B ) ) + 1 ) = ( 0 + 1 ) <-> ( ( A x. B ) - ( A + B ) ) = 0 ) )
24	1	addlidi 8469	. . . 4 |- ( 0 + 1 ) = 1
25	24	eqeq2i 2249	. . 3 |- ( ( ( ( A x. B ) - ( A + B ) ) + 1 ) = ( 0 + 1 ) <-> ( ( ( A x. B ) - ( A + B ) ) + 1 ) = 1 )
26	23, 25	bitr3di 195	. 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A x. B ) - ( A + B ) ) = 0 <-> ( ( ( A x. B ) - ( A + B ) ) + 1 ) = 1 ) )
27	12, 13	subeq0ad 8647	. 2 |- ( ( A e. CC /\ B e. CC ) -> ( ( ( A x. B ) - ( A + B ) ) = 0 <-> ( A x. B ) = ( A + B ) ) )
28	18, 26, 27	3bitr2rd 217	1 |- ( ( A e. CC /\ B e. CC ) -> ( ( A x. B ) = ( A + B ) <-> ( ( A - 1 ) x. ( B - 1 ) ) = 1 ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180   + caddc 8182   x. cmul 8184   - cmin 8497

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684  ax-resscn 8271  ax-1cn 8272  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-neg 8500

This theorem is used by:  conjmulap  9059