ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ltdiv2 Unicode version
Theorem ltdiv2 8959
Description: Division of a positive number by both sides of 'less than'. (Contributed by NM, 27-Apr-2005.)
Assertion
Ref Expression
ltdiv2 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( C / B ) < ( C / A ) ) )
Proof of Theorem ltdiv2
StepHypRef Expression
1 simp2l 1025 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> B e. RR )
2 gt0ap0 8698 . . . . 5 |- ( ( B e. RR /\ 0 < B ) -> B # 0 )
323ad2ant2 1021 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> B # 0 )
41, 3rerecclapd 8906 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( 1 / B ) e. RR )
5 gt0ap0 8698 . . . . 5 |- ( ( A e. RR /\ 0 < A ) -> A # 0 )
6 rerecclap 8802 . . . . 5 |- ( ( A e. RR /\ A # 0 ) -> ( 1 / A ) e. RR )
75, 6syldan 282 . . . 4 |- ( ( A e. RR /\ 0 < A ) -> ( 1 / A ) e. RR )
873ad2ant1 1020 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( 1 / A ) e. RR )
9 simp3 1001 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( C e. RR /\ 0 < C ) )
10 ltmul2 8928 . . 3 |- ( ( ( 1 / B ) e. RR /\ ( 1 / A ) e. RR /\ ( C e. RR /\ 0 < C ) ) -> ( ( 1 / B ) < ( 1 / A ) <-> ( C x. ( 1 / B ) ) < ( C x. ( 1 / A ) ) ) )
114, 8, 9, 10syl3anc 1249 . 2 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( ( 1 / B ) < ( 1 / A ) <-> ( C x. ( 1 / B ) ) < ( C x. ( 1 / A ) ) ) )
12 ltrec 8955 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> ( A < B <-> ( 1 / B ) < ( 1 / A ) ) )
13123adant3 1019 . 2 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( 1 / B ) < ( 1 / A ) ) )
14 simp3l 1027 . . . . 5 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> C e. RR )
1514recnd 8100 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> C e. CC )
161recnd 8100 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> B e. CC )
1715, 16, 3divrecapd 8865 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( C / B ) = ( C x. ( 1 / B ) ) )
18 simp1l 1023 . . . . 5 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> A e. RR )
1918recnd 8100 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> A e. CC )
2053ad2ant1 1020 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> A # 0 )
2115, 19, 20divrecapd 8865 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( C / A ) = ( C x. ( 1 / A ) ) )
2217, 21breq12d 4056 . 2 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( ( C / B ) < ( C / A ) <-> ( C x. ( 1 / B ) ) < ( C x. ( 1 / A ) ) ) )
2311, 13, 223bitr4d 220 1 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( C / B ) < ( C / A ) ) )
Colors of variables: wff set class
Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 980   e. wcel 2175   class class class wbr 4043  (class class class)co 5943   RRcr 7923   0cc0 7924   1c1 7925   x. cmul 7929   < clt 8106   # cap 8653   / cdiv 8744
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 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-cnex 8015  ax-resscn 8016  ax-1cn 8017  ax-1re 8018  ax-icn 8019  ax-addcl 8020  ax-addrcl 8021  ax-mulcl 8022  ax-mulrcl 8023  ax-addcom 8024  ax-mulcom 8025  ax-addass 8026  ax-mulass 8027  ax-distr 8028  ax-i2m1 8029  ax-0lt1 8030  ax-1rid 8031  ax-0id 8032  ax-rnegex 8033  ax-precex 8034  ax-cnre 8035  ax-pre-ltirr 8036  ax-pre-ltwlin 8037  ax-pre-lttrn 8038  ax-pre-apti 8039  ax-pre-ltadd 8040  ax-pre-mulgt0 8041  ax-pre-mulext 8042
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-nel 2471  df-ral 2488  df-rex 2489  df-reu 2490  df-rmo 2491  df-rab 2492  df-v 2773  df-sbc 2998  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-id 4339  df-po 4342  df-iso 4343  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-iota 5231  df-fun 5272  df-fv 5278  df-riota 5898  df-ov 5946  df-oprab 5947  df-mpo 5948  df-pnf 8108  df-mnf 8109  df-xr 8110  df-ltxr 8111  df-le 8112  df-sub 8244  df-neg 8245  df-reap 8647  df-ap 8654  df-div 8745
This theorem is referenced by:  ltdiv2d  9841  sin01gt0  12044  coseq0negpitopi  15279  sincos6thpi  15285  cos02pilt1  15294  perfectlem2  15443
  Copyright terms: Public domain W3C validator