Theorem subrecap 9169

Description: Subtraction of reciprocals. (Contributed by Scott Fenton, 9-Jul-2015.)

Assertion

Ref	Expression
subrecap	|- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( ( 1 / A ) - ( 1 / B ) ) = ( ( B - A ) / ( A x. B ) ) )

Proof of Theorem subrecap

Step	Hyp	Ref	Expression
1		1cnd 8342	. . 3 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> 1 e. CC )
2		id 19	. . 3 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) )
3		divsubdivap 9058	. . 3 |- ( ( ( 1 e. CC /\ 1 e. CC ) /\ ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) ) -> ( ( 1 / A ) - ( 1 / B ) ) = ( ( ( 1 x. B ) - ( 1 x. A ) ) / ( A x. B ) ) )
4	1, 1, 2, 3	syl21anc 1277	. 2 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( ( 1 / A ) - ( 1 / B ) ) = ( ( ( 1 x. B ) - ( 1 x. A ) ) / ( A x. B ) ) )
5		simprl 535	. . . . 5 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> B e. CC )
6	5	mullidd 8344	. . . 4 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( 1 x. B ) = B )
7		simpll 531	. . . . 5 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> A e. CC )
8	7	mullidd 8344	. . . 4 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( 1 x. A ) = A )
9	6, 8	oveq12d 6103	. . 3 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( ( 1 x. B ) - ( 1 x. A ) ) = ( B - A ) )
10	9	oveq1d 6100	. 2 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( ( ( 1 x. B ) - ( 1 x. A ) ) / ( A x. B ) ) = ( ( B - A ) / ( A x. B ) ) )
11	4, 10	eqtrd 2271	1 |- ( ( ( A e. CC /\ A # 0 ) /\ ( B e. CC /\ B # 0 ) ) -> ( ( 1 / A ) - ( 1 / B ) ) = ( ( B - A ) / ( A x. B ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   class class class wbr 4130  (class class class)co 6085   CCcc 8177   0cc0 8179   1c1 8180   x. cmul 8184   - cmin 8497   # cap 8909   / cdiv 9002

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-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

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-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  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-po 4441  df-iso 4442  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-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003

This theorem is used by:  subrecapi  9170  subrecapd  9171