ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ltdiv2 Unicode version
Theorem ltdiv2 8846
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 1023 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> B e. RR )
2 gt0ap0 8585 . . . . 5 |- ( ( B e. RR /\ 0 < B ) -> B # 0 )
323ad2ant2 1019 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> B # 0 )
41, 3rerecclapd 8793 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( 1 / B ) e. RR )
5 gt0ap0 8585 . . . . 5 |- ( ( A e. RR /\ 0 < A ) -> A # 0 )
6 rerecclap 8689 . . . . 5 |- ( ( A e. RR /\ A # 0 ) -> ( 1 / A ) e. RR )
75, 6syldan 282 . . . 4 |- ( ( A e. RR /\ 0 < A ) -> ( 1 / A ) e. RR )
873ad2ant1 1018 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( 1 / A ) e. RR )
9 simp3 999 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( C e. RR /\ 0 < C ) )
10 ltmul2 8815 . . 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 1238 . 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 8842 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) ) -> ( A < B <-> ( 1 / B ) < ( 1 / A ) ) )
13123adant3 1017 . 2 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( A < B <-> ( 1 / B ) < ( 1 / A ) ) )
14 simp3l 1025 . . . . 5 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> C e. RR )
1514recnd 7988 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> C e. CC )
161recnd 7988 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> B e. CC )
1715, 16, 3divrecapd 8752 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( C / B ) = ( C x. ( 1 / B ) ) )
18 simp1l 1021 . . . . 5 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> A e. RR )
1918recnd 7988 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> A e. CC )
2053ad2ant1 1018 . . . 4 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> A # 0 )
2115, 19, 20divrecapd 8752 . . 3 |- ( ( ( A e. RR /\ 0 < A ) /\ ( B e. RR /\ 0 < B ) /\ ( C e. RR /\ 0 < C ) ) -> ( C / A ) = ( C x. ( 1 / A ) ) )
2217, 21breq12d 4018 . 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 978   e. wcel 2148   class class class wbr 4005  (class class class)co 5877   RRcr 7812   0cc0 7813   1c1 7814   x. cmul 7818   < clt 7994   # cap 8540   / cdiv 8631
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-mulrcl 7912  ax-addcom 7913  ax-mulcom 7914  ax-addass 7915  ax-mulass 7916  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-1rid 7920  ax-0id 7921  ax-rnegex 7922  ax-precex 7923  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-apti 7928  ax-pre-ltadd 7929  ax-pre-mulgt0 7930  ax-pre-mulext 7931
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-id 4295  df-po 4298  df-iso 4299  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-iota 5180  df-fun 5220  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-reap 8534  df-ap 8541  df-div 8632
This theorem is referenced by:  ltdiv2d  9722  sin01gt0  11771  coseq0negpitopi  14342  sincos6thpi  14348  cos02pilt1  14357
  Copyright terms: Public domain W3C validator