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

Theorem prodgt0gt0 8878
Description: Infer that a multiplicand is positive from a positive multiplier and positive product. See prodgt0 8879 for the same theorem with  0  < 
A replaced by the weaker condition 
0  <_  A. (Contributed by Jim Kingdon, 29-Feb-2020.)
Assertion
Ref Expression
prodgt0gt0  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  0  <  B )

Proof of Theorem prodgt0gt0
StepHypRef Expression
1 simpll 527 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  A  e.  RR )
2 simplr 528 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  B  e.  RR )
31, 2remulcld 8057 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  ( A  x.  B )  e.  RR )
4 simprl 529 . . . . 5  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  0  <  A )
51, 4gt0ap0d 8656 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  A #  0 )
61, 5rerecclapd 8861 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  (
1  /  A )  e.  RR )
7 simprr 531 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  0  <  ( A  x.  B
) )
8 recgt0 8877 . . . 4  |-  ( ( A  e.  RR  /\  0  <  A )  -> 
0  <  ( 1  /  A ) )
98ad2ant2r 509 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  0  <  ( 1  /  A
) )
103, 6, 7, 9mulgt0d 8149 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  0  <  ( ( A  x.  B )  x.  (
1  /  A ) ) )
113recnd 8055 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  ( A  x.  B )  e.  CC )
121recnd 8055 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  A  e.  CC )
1311, 12, 5divrecapd 8820 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  (
( A  x.  B
)  /  A )  =  ( ( A  x.  B )  x.  ( 1  /  A
) ) )
14 simpr 110 . . . . . 6  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  B  e.  RR )
1514recnd 8055 . . . . 5  |-  ( ( A  e.  RR  /\  B  e.  RR )  ->  B  e.  CC )
1615adantr 276 . . . 4  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  B  e.  CC )
1716, 12, 5divcanap3d 8822 . . 3  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  (
( A  x.  B
)  /  A )  =  B )
1813, 17eqtr3d 2231 . 2  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  (
( A  x.  B
)  x.  ( 1  /  A ) )  =  B )
1910, 18breqtrd 4059 1  |-  ( ( ( A  e.  RR  /\  B  e.  RR )  /\  ( 0  < 
A  /\  0  <  ( A  x.  B ) ) )  ->  0  <  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2167   class class class wbr 4033  (class class class)co 5922   CCcc 7877   RRcr 7878   0cc0 7879   1c1 7880    x. cmul 7884    < clt 8061    / cdiv 8699
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7970  ax-resscn 7971  ax-1cn 7972  ax-1re 7973  ax-icn 7974  ax-addcl 7975  ax-addrcl 7976  ax-mulcl 7977  ax-mulrcl 7978  ax-addcom 7979  ax-mulcom 7980  ax-addass 7981  ax-mulass 7982  ax-distr 7983  ax-i2m1 7984  ax-0lt1 7985  ax-1rid 7986  ax-0id 7987  ax-rnegex 7988  ax-precex 7989  ax-cnre 7990  ax-pre-ltirr 7991  ax-pre-ltwlin 7992  ax-pre-lttrn 7993  ax-pre-apti 7994  ax-pre-ltadd 7995  ax-pre-mulgt0 7996  ax-pre-mulext 7997
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-id 4328  df-po 4331  df-iso 4332  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-pnf 8063  df-mnf 8064  df-xr 8065  df-ltxr 8066  df-le 8067  df-sub 8199  df-neg 8200  df-reap 8602  df-ap 8609  df-div 8700
This theorem is referenced by:  prodgt0  8879
  Copyright terms: Public domain W3C validator