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

Theorem conjmulap 8482
Description: Two numbers whose reciprocals sum to 1 are called "conjugates" and satisfy this relationship. (Contributed by Jim Kingdon, 26-Feb-2020.)
Assertion
Ref Expression
conjmulap  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( ( 1  /  P )  +  ( 1  /  Q ) )  =  1  <->  ( ( P  -  1 )  x.  ( Q  -  1 ) )  =  1 ) )

Proof of Theorem conjmulap
StepHypRef Expression
1 simpll 518 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  P  e.  CC )
2 simprl 520 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  Q  e.  CC )
3 recclap 8432 . . . . . . . 8  |-  ( ( P  e.  CC  /\  P #  0 )  ->  (
1  /  P )  e.  CC )
43adantr 274 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( 1  /  P )  e.  CC )
51, 2, 4mul32d 7908 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( 1  /  P
) )  =  ( ( P  x.  (
1  /  P ) )  x.  Q ) )
6 recidap 8439 . . . . . . . 8  |-  ( ( P  e.  CC  /\  P #  0 )  ->  ( P  x.  ( 1  /  P ) )  =  1 )
76oveq1d 5782 . . . . . . 7  |-  ( ( P  e.  CC  /\  P #  0 )  ->  (
( P  x.  (
1  /  P ) )  x.  Q )  =  ( 1  x.  Q ) )
87adantr 274 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  ( 1  /  P ) )  x.  Q )  =  ( 1  x.  Q ) )
9 mulid2 7757 . . . . . . 7  |-  ( Q  e.  CC  ->  (
1  x.  Q )  =  Q )
109ad2antrl 481 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( 1  x.  Q )  =  Q )
115, 8, 103eqtrd 2174 . . . . 5  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( 1  /  P
) )  =  Q )
12 recclap 8432 . . . . . . . 8  |-  ( ( Q  e.  CC  /\  Q #  0 )  ->  (
1  /  Q )  e.  CC )
1312adantl 275 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( 1  /  Q )  e.  CC )
141, 2, 13mulassd 7782 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( 1  /  Q
) )  =  ( P  x.  ( Q  x.  ( 1  /  Q ) ) ) )
15 recidap 8439 . . . . . . . 8  |-  ( ( Q  e.  CC  /\  Q #  0 )  ->  ( Q  x.  ( 1  /  Q ) )  =  1 )
1615oveq2d 5783 . . . . . . 7  |-  ( ( Q  e.  CC  /\  Q #  0 )  ->  ( P  x.  ( Q  x.  ( 1  /  Q
) ) )  =  ( P  x.  1 ) )
1716adantl 275 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  ( Q  x.  (
1  /  Q ) ) )  =  ( P  x.  1 ) )
18 mulid1 7756 . . . . . . 7  |-  ( P  e.  CC  ->  ( P  x.  1 )  =  P )
1918ad2antrr 479 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  1 )  =  P )
2014, 17, 193eqtrd 2174 . . . . 5  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( 1  /  Q
) )  =  P )
2111, 20oveq12d 5785 . . . 4  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( ( P  x.  Q )  x.  ( 1  /  P ) )  +  ( ( P  x.  Q )  x.  (
1  /  Q ) ) )  =  ( Q  +  P ) )
22 mulcl 7740 . . . . . 6  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( P  x.  Q
)  e.  CC )
2322ad2ant2r 500 . . . . 5  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  Q )  e.  CC )
2423, 4, 13adddid 7783 . . . 4  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q ) ) )  =  ( ( ( P  x.  Q )  x.  (
1  /  P ) )  +  ( ( P  x.  Q )  x.  ( 1  /  Q ) ) ) )
25 addcom 7892 . . . . 5  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( P  +  Q
)  =  ( Q  +  P ) )
2625ad2ant2r 500 . . . 4  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  +  Q )  =  ( Q  +  P ) )
2721, 24, 263eqtr4d 2180 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q ) ) )  =  ( P  +  Q ) )
2822mulid1d 7776 . . . 4  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( ( P  x.  Q )  x.  1 )  =  ( P  x.  Q ) )
2928ad2ant2r 500 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  1 )  =  ( P  x.  Q ) )
3027, 29eqeq12d 2152 . 2  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q
) ) )  =  ( ( P  x.  Q )  x.  1 )  <->  ( P  +  Q )  =  ( P  x.  Q ) ) )
31 addcl 7738 . . . 4  |-  ( ( ( 1  /  P
)  e.  CC  /\  ( 1  /  Q
)  e.  CC )  ->  ( ( 1  /  P )  +  ( 1  /  Q
) )  e.  CC )
323, 12, 31syl2an 287 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( 1  /  P )  +  ( 1  /  Q
) )  e.  CC )
33 mulap0 8408 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  Q ) #  0 )
34 ax-1cn 7706 . . . 4  |-  1  e.  CC
35 mulcanap 8419 . . . 4  |-  ( ( ( ( 1  /  P )  +  ( 1  /  Q ) )  e.  CC  /\  1  e.  CC  /\  (
( P  x.  Q
)  e.  CC  /\  ( P  x.  Q
) #  0 ) )  ->  ( ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q
) ) )  =  ( ( P  x.  Q )  x.  1 )  <->  ( ( 1  /  P )  +  ( 1  /  Q
) )  =  1 ) )
3634, 35mp3an2 1303 . . 3  |-  ( ( ( ( 1  /  P )  +  ( 1  /  Q ) )  e.  CC  /\  ( ( P  x.  Q )  e.  CC  /\  ( P  x.  Q
) #  0 ) )  ->  ( ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q
) ) )  =  ( ( P  x.  Q )  x.  1 )  <->  ( ( 1  /  P )  +  ( 1  /  Q
) )  =  1 ) )
3732, 23, 33, 36syl12anc 1214 . 2  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q
) ) )  =  ( ( P  x.  Q )  x.  1 )  <->  ( ( 1  /  P )  +  ( 1  /  Q
) )  =  1 ) )
38 eqcom 2139 . . . 4  |-  ( ( P  +  Q )  =  ( P  x.  Q )  <->  ( P  x.  Q )  =  ( P  +  Q ) )
39 muleqadd 8422 . . . 4  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( ( P  x.  Q )  =  ( P  +  Q )  <-> 
( ( P  - 
1 )  x.  ( Q  -  1 ) )  =  1 ) )
4038, 39syl5bb 191 . . 3  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( ( P  +  Q )  =  ( P  x.  Q )  <-> 
( ( P  - 
1 )  x.  ( Q  -  1 ) )  =  1 ) )
4140ad2ant2r 500 . 2  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  +  Q )  =  ( P  x.  Q
)  <->  ( ( P  -  1 )  x.  ( Q  -  1 ) )  =  1 ) )
4230, 37, 413bitr3d 217 1  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( ( 1  /  P )  +  ( 1  /  Q ) )  =  1  <->  ( ( P  -  1 )  x.  ( Q  -  1 ) )  =  1 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480   class class class wbr 3924  (class class class)co 5767   CCcc 7611   0cc0 7613   1c1 7614    + caddc 7616    x. cmul 7618    - cmin 7926   # cap 8336    / cdiv 8425
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-13 1491  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-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-mulrcl 7712  ax-addcom 7713  ax-mulcom 7714  ax-addass 7715  ax-mulass 7716  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-1rid 7720  ax-0id 7721  ax-rnegex 7722  ax-precex 7723  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-apti 7728  ax-pre-ltadd 7729  ax-pre-mulgt0 7730  ax-pre-mulext 7731
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-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rmo 2422  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-po 4213  df-iso 4214  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-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-reap 8330  df-ap 8337  df-div 8426
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator