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

Theorem muleqadd 8422
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
StepHypRef Expression
1 ax-1cn 7706 . . . . 5  |-  1  e.  CC
2 mulsub 8156 . . . . . 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 ) ) ) )
31, 2mpanr2 434 . . . . 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 ) ) ) )
41, 3mpanl2 431 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  - 
1 )  x.  ( B  -  1 ) )  =  ( ( ( A  x.  B
)  +  ( 1  x.  1 ) )  -  ( ( A  x.  1 )  +  ( B  x.  1 ) ) ) )
51mulid1i 7761 . . . . . . 7  |-  ( 1  x.  1 )  =  1
65oveq2i 5778 . . . . . 6  |-  ( ( A  x.  B )  +  ( 1  x.  1 ) )  =  ( ( A  x.  B )  +  1 )
76a1i 9 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  B )  +  ( 1  x.  1 ) )  =  ( ( A  x.  B )  +  1 ) )
8 mulid1 7756 . . . . . 6  |-  ( A  e.  CC  ->  ( A  x.  1 )  =  A )
9 mulid1 7756 . . . . . 6  |-  ( B  e.  CC  ->  ( B  x.  1 )  =  B )
108, 9oveqan12d 5786 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  1 )  +  ( B  x.  1 ) )  =  ( A  +  B ) )
117, 10oveq12d 5785 . . . 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 7740 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  e.  CC )
13 addcl 7738 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  +  B
)  e.  CC )
14 addsub 7966 . . . . . 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 ) )
151, 14mp3an2 1303 . . . . 5  |-  ( ( ( A  x.  B
)  e.  CC  /\  ( A  +  B
)  e.  CC )  ->  ( ( ( A  x.  B )  +  1 )  -  ( A  +  B
) )  =  ( ( ( A  x.  B )  -  ( A  +  B )
)  +  1 ) )
1612, 13, 15syl2anc 408 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  B )  +  1 )  -  ( A  +  B )
)  =  ( ( ( A  x.  B
)  -  ( A  +  B ) )  +  1 ) )
174, 11, 163eqtrd 2174 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  - 
1 )  x.  ( B  -  1 ) )  =  ( ( ( A  x.  B
)  -  ( A  +  B ) )  +  1 ) )
1817eqeq1d 2146 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  -  1 )  x.  ( B  -  1 ) )  =  1  <-> 
( ( ( A  x.  B )  -  ( A  +  B
) )  +  1 )  =  1 ) )
191addid2i 7898 . . . 4  |-  ( 0  +  1 )  =  1
2019eqeq2i 2148 . . 3  |-  ( ( ( ( A  x.  B )  -  ( A  +  B )
)  +  1 )  =  ( 0  +  1 )  <->  ( (
( A  x.  B
)  -  ( A  +  B ) )  +  1 )  =  1 )
2112, 13subcld 8066 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  B )  -  ( A  +  B )
)  e.  CC )
22 0cn 7751 . . . . 5  |-  0  e.  CC
23 addcan2 7936 . . . . 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 ) )
2422, 1, 23mp3an23 1307 . . . 4  |-  ( ( ( A  x.  B
)  -  ( A  +  B ) )  e.  CC  ->  (
( ( ( A  x.  B )  -  ( A  +  B
) )  +  1 )  =  ( 0  +  1 )  <->  ( ( A  x.  B )  -  ( A  +  B ) )  =  0 ) )
2521, 24syl 14 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( ( A  x.  B )  -  ( A  +  B ) )  +  1 )  =  ( 0  +  1 )  <-> 
( ( A  x.  B )  -  ( A  +  B )
)  =  0 ) )
2620, 25syl5rbbr 194 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  B )  -  ( A  +  B
) )  =  0  <-> 
( ( ( A  x.  B )  -  ( A  +  B
) )  +  1 )  =  1 ) )
2712, 13subeq0ad 8076 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  B )  -  ( A  +  B
) )  =  0  <-> 
( A  x.  B
)  =  ( A  +  B ) ) )
2818, 26, 273bitr2rd 216 1  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  B )  =  ( A  +  B )  <-> 
( ( A  - 
1 )  x.  ( B  -  1 ) )  =  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480  (class class class)co 5767   CCcc 7611   0cc0 7613   1c1 7614    + caddc 7616    x. cmul 7618    - cmin 7926
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-setind 4447  ax-resscn 7705  ax-1cn 7706  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-mulcom 7714  ax-addass 7715  ax-mulass 7716  ax-distr 7717  ax-i2m1 7718  ax-1rid 7720  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-iota 5083  df-fun 5120  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-sub 7928  df-neg 7929
This theorem is referenced by:  conjmulap  8482
  Copyright terms: Public domain W3C validator