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

Theorem conjmulap 9020
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 527 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  P  e.  CC )
2 simprl 531 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  Q  e.  CC )
3 recclap 8970 . . . . . . . 8  |-  ( ( P  e.  CC  /\  P #  0 )  ->  (
1  /  P )  e.  CC )
43adantr 276 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( 1  /  P )  e.  CC )
51, 2, 4mul32d 8442 . . . . . 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 8977 . . . . . . . 8  |-  ( ( P  e.  CC  /\  P #  0 )  ->  ( P  x.  ( 1  /  P ) )  =  1 )
76oveq1d 6073 . . . . . . 7  |-  ( ( P  e.  CC  /\  P #  0 )  ->  (
( P  x.  (
1  /  P ) )  x.  Q )  =  ( 1  x.  Q ) )
87adantr 276 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  ( 1  /  P ) )  x.  Q )  =  ( 1  x.  Q ) )
9 mullid 8288 . . . . . . 7  |-  ( Q  e.  CC  ->  (
1  x.  Q )  =  Q )
109ad2antrl 490 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( 1  x.  Q )  =  Q )
115, 8, 103eqtrd 2271 . . . . 5  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( 1  /  P
) )  =  Q )
12 recclap 8970 . . . . . . . 8  |-  ( ( Q  e.  CC  /\  Q #  0 )  ->  (
1  /  Q )  e.  CC )
1312adantl 277 . . . . . . 7  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( 1  /  Q )  e.  CC )
141, 2, 13mulassd 8313 . . . . . 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 8977 . . . . . . . 8  |-  ( ( Q  e.  CC  /\  Q #  0 )  ->  ( Q  x.  ( 1  /  Q ) )  =  1 )
1615oveq2d 6074 . . . . . . 7  |-  ( ( Q  e.  CC  /\  Q #  0 )  ->  ( P  x.  ( Q  x.  ( 1  /  Q
) ) )  =  ( P  x.  1 ) )
1716adantl 277 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  ( Q  x.  (
1  /  Q ) ) )  =  ( P  x.  1 ) )
18 mulrid 8287 . . . . . . 7  |-  ( P  e.  CC  ->  ( P  x.  1 )  =  P )
1918ad2antrr 488 . . . . . 6  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  1 )  =  P )
2014, 17, 193eqtrd 2271 . . . . 5  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( 1  /  Q
) )  =  P )
2111, 20oveq12d 6076 . . . 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 8270 . . . . . 6  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( P  x.  Q
)  e.  CC )
2322ad2ant2r 509 . . . . 5  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  Q )  e.  CC )
2423, 4, 13adddid 8314 . . . 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 8426 . . . . 5  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( P  +  Q
)  =  ( Q  +  P ) )
2625ad2ant2r 509 . . . 4  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  +  Q )  =  ( Q  +  P ) )
2721, 24, 263eqtr4d 2277 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  ( ( 1  /  P )  +  ( 1  /  Q ) ) )  =  ( P  +  Q ) )
2822mulridd 8307 . . . 4  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( ( P  x.  Q )  x.  1 )  =  ( P  x.  Q ) )
2928ad2ant2r 509 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( P  x.  Q )  x.  1 )  =  ( P  x.  Q ) )
3027, 29eqeq12d 2249 . 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 8268 . . . 4  |-  ( ( ( 1  /  P
)  e.  CC  /\  ( 1  /  Q
)  e.  CC )  ->  ( ( 1  /  P )  +  ( 1  /  Q
) )  e.  CC )
323, 12, 31syl2an 289 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( ( 1  /  P )  +  ( 1  /  Q
) )  e.  CC )
33 mulap0 8945 . . 3  |-  ( ( ( P  e.  CC  /\  P #  0 )  /\  ( Q  e.  CC  /\  Q #  0 ) )  ->  ( P  x.  Q ) #  0 )
34 ax-1cn 8236 . . . 4  |-  1  e.  CC
35 mulcanap 8956 . . . 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 1362 . . 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 1272 . 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 2236 . . . 4  |-  ( ( P  +  Q )  =  ( P  x.  Q )  <->  ( P  x.  Q )  =  ( P  +  Q ) )
39 muleqadd 8959 . . . 4  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( ( P  x.  Q )  =  ( P  +  Q )  <-> 
( ( P  - 
1 )  x.  ( Q  -  1 ) )  =  1 ) )
4038, 39bitrid 192 . . 3  |-  ( ( P  e.  CC  /\  Q  e.  CC )  ->  ( ( P  +  Q )  =  ( P  x.  Q )  <-> 
( ( P  - 
1 )  x.  ( Q  -  1 ) )  =  1 ) )
4140ad2ant2r 509 . 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 218 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 104    <-> wb 105    = wceq 1398    e. wcel 2205   class class class wbr 4114  (class class class)co 6058   CCcc 8141   0cc0 8143   1c1 8144    + caddc 8146    x. cmul 8148    - cmin 8460   # cap 8872    / cdiv 8963
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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-po 4422  df-iso 4423  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-iota 5317  df-fun 5359  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-reap 8866  df-ap 8873  df-div 8964
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator