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

Theorem lt2mulnq 7778
Description: Ordering property of multiplication for positive fractions. (Contributed by Jim Kingdon, 18-Jul-2021.)
Assertion
Ref Expression
lt2mulnq  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( ( A  <Q  B  /\  C  <Q  D )  ->  ( A  .Q  C )  <Q 
( B  .Q  D
) ) )

Proof of Theorem lt2mulnq
StepHypRef Expression
1 ltmnqg 7774 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q.  /\  C  e.  Q. )  ->  ( A  <Q  B  <->  ( C  .Q  A )  <Q  ( C  .Q  B ) ) )
213expa 1234 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  C  e.  Q. )  ->  ( A  <Q  B  <-> 
( C  .Q  A
)  <Q  ( C  .Q  B ) ) )
32adantrr 483 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( A  <Q  B  <->  ( C  .Q  A )  <Q  ( C  .Q  B ) ) )
4 mulcomnqg 7756 . . . . . . 7  |-  ( ( C  e.  Q.  /\  A  e.  Q. )  ->  ( C  .Q  A
)  =  ( A  .Q  C ) )
54ancoms 268 . . . . . 6  |-  ( ( A  e.  Q.  /\  C  e.  Q. )  ->  ( C  .Q  A
)  =  ( A  .Q  C ) )
65ad2ant2r 513 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( C  .Q  A )  =  ( A  .Q  C ) )
7 mulcomnqg 7756 . . . . . . 7  |-  ( ( C  e.  Q.  /\  B  e.  Q. )  ->  ( C  .Q  B
)  =  ( B  .Q  C ) )
87ancoms 268 . . . . . 6  |-  ( ( B  e.  Q.  /\  C  e.  Q. )  ->  ( C  .Q  B
)  =  ( B  .Q  C ) )
98ad2ant2lr 514 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( C  .Q  B )  =  ( B  .Q  C ) )
106, 9breq12d 4144 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( ( C  .Q  A )  <Q 
( C  .Q  B
)  <->  ( A  .Q  C )  <Q  ( B  .Q  C ) ) )
113, 10bitrd 188 . . 3  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( A  <Q  B  <->  ( A  .Q  C )  <Q  ( B  .Q  C ) ) )
12 ltmnqg 7774 . . . . . 6  |-  ( ( C  e.  Q.  /\  D  e.  Q.  /\  B  e.  Q. )  ->  ( C  <Q  D  <->  ( B  .Q  C )  <Q  ( B  .Q  D ) ) )
13123expa 1234 . . . . 5  |-  ( ( ( C  e.  Q.  /\  D  e.  Q. )  /\  B  e.  Q. )  ->  ( C  <Q  D  <-> 
( B  .Q  C
)  <Q  ( B  .Q  D ) ) )
1413ancoms 268 . . . 4  |-  ( ( B  e.  Q.  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( C  <Q  D  <->  ( B  .Q  C )  <Q  ( B  .Q  D ) ) )
1514adantll 480 . . 3  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( C  <Q  D  <->  ( B  .Q  C )  <Q  ( B  .Q  D ) ) )
1611, 15anbi12d 477 . 2  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( ( A  <Q  B  /\  C  <Q  D )  <->  ( ( A  .Q  C )  <Q 
( B  .Q  C
)  /\  ( B  .Q  C )  <Q  ( B  .Q  D ) ) ) )
17 ltsonq 7771 . . 3  |-  <Q  Or  Q.
18 ltrelnq 7738 . . 3  |-  <Q  C_  ( Q.  X.  Q. )
1917, 18sotri 5186 . 2  |-  ( ( ( A  .Q  C
)  <Q  ( B  .Q  C )  /\  ( B  .Q  C )  <Q 
( B  .Q  D
) )  ->  ( A  .Q  C )  <Q 
( B  .Q  D
) )
2016, 19biimtrdi 163 1  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( ( A  <Q  B  /\  C  <Q  D )  ->  ( A  .Q  C )  <Q 
( B  .Q  D
) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   class class class wbr 4131  (class class class)co 6088   Q.cnq 7653    .Q cmq 7656    <Q cltq 7658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-mi 7679  df-lti 7680  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-mqqs 7723  df-ltnqqs 7726
This theorem is used by:  mulnqprlemrl  7946  mulnqprlemru  7947
  Copyright terms: Public domain W3C validator