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

Theorem muleqadd 8942
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 8220 . . . . 5  |-  1  e.  CC
2 mulsub 8674 . . . . . 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 438 . . . . 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 435 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  - 
1 )  x.  ( B  -  1 ) )  =  ( ( ( A  x.  B
)  +  ( 1  x.  1 ) )  -  ( ( A  x.  1 )  +  ( B  x.  1 ) ) ) )
51mulridi 8276 . . . . . . 7  |-  ( 1  x.  1 )  =  1
65oveq2i 6061 . . . . . 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 mulrid 8271 . . . . . 6  |-  ( A  e.  CC  ->  ( A  x.  1 )  =  A )
9 mulrid 8271 . . . . . 6  |-  ( B  e.  CC  ->  ( B  x.  1 )  =  B )
108, 9oveqan12d 6069 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  1 )  +  ( B  x.  1 ) )  =  ( A  +  B ) )
117, 10oveq12d 6068 . . . 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 8254 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  x.  B
)  e.  CC )
13 addcl 8252 . . . . 5  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( A  +  B
)  e.  CC )
14 addsub 8484 . . . . . 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 1362 . . . . 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 411 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  B )  +  1 )  -  ( A  +  B )
)  =  ( ( ( A  x.  B
)  -  ( A  +  B ) )  +  1 ) )
174, 11, 163eqtrd 2269 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  - 
1 )  x.  ( B  -  1 ) )  =  ( ( ( A  x.  B
)  -  ( A  +  B ) )  +  1 ) )
1817eqeq1d 2241 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  -  1 )  x.  ( B  -  1 ) )  =  1  <-> 
( ( ( A  x.  B )  -  ( A  +  B
) )  +  1 )  =  1 ) )
1912, 13subcld 8584 . . . 4  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( A  x.  B )  -  ( A  +  B )
)  e.  CC )
20 0cn 8266 . . . . 5  |-  0  e.  CC
21 addcan2 8454 . . . . 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 ) )
2220, 1, 21mp3an23 1366 . . . 4  |-  ( ( ( A  x.  B
)  -  ( A  +  B ) )  e.  CC  ->  (
( ( ( A  x.  B )  -  ( A  +  B
) )  +  1 )  =  ( 0  +  1 )  <->  ( ( A  x.  B )  -  ( A  +  B ) )  =  0 ) )
2319, 22syl 14 . . 3  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( ( A  x.  B )  -  ( A  +  B ) )  +  1 )  =  ( 0  +  1 )  <-> 
( ( A  x.  B )  -  ( A  +  B )
)  =  0 ) )
241addlidi 8416 . . . 4  |-  ( 0  +  1 )  =  1
2524eqeq2i 2243 . . 3  |-  ( ( ( ( A  x.  B )  -  ( A  +  B )
)  +  1 )  =  ( 0  +  1 )  <->  ( (
( A  x.  B
)  -  ( A  +  B ) )  +  1 )  =  1 )
2623, 25bitr3di 195 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  B )  -  ( A  +  B
) )  =  0  <-> 
( ( ( A  x.  B )  -  ( A  +  B
) )  +  1 )  =  1 ) )
2712, 13subeq0ad 8594 . 2  |-  ( ( A  e.  CC  /\  B  e.  CC )  ->  ( ( ( A  x.  B )  -  ( A  +  B
) )  =  0  <-> 
( A  x.  B
)  =  ( A  +  B ) ) )
2818, 26, 273bitr2rd 217 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 104    <-> wb 105    = wceq 1398    e. wcel 2203  (class class class)co 6050   CCcc 8125   0cc0 8127   1c1 8128    + caddc 8130    x. cmul 8132    - cmin 8444
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-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659  ax-resscn 8219  ax-1cn 8220  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-mulcom 8228  ax-addass 8229  ax-mulass 8230  ax-distr 8231  ax-i2m1 8232  ax-1rid 8234  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-sub 8446  df-neg 8447
This theorem is referenced by:  conjmulap  9003
  Copyright terms: Public domain W3C validator