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

Theorem lt2mulnq 7525
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 7521 . . . . . 6  |-  ( ( A  e.  Q.  /\  B  e.  Q.  /\  C  e.  Q. )  ->  ( A  <Q  B  <->  ( C  .Q  A )  <Q  ( C  .Q  B ) ) )
213expa 1206 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  C  e.  Q. )  ->  ( A  <Q  B  <-> 
( C  .Q  A
)  <Q  ( C  .Q  B ) ) )
32adantrr 479 . . . 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 7503 . . . . . . 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 509 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( C  .Q  A )  =  ( A  .Q  C ) )
7 mulcomnqg 7503 . . . . . . 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 510 . . . . 5  |-  ( ( ( A  e.  Q.  /\  B  e.  Q. )  /\  ( C  e.  Q.  /\  D  e.  Q. )
)  ->  ( C  .Q  B )  =  ( B  .Q  C ) )
106, 9breq12d 4060 . . . 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 7521 . . . . . 6  |-  ( ( C  e.  Q.  /\  D  e.  Q.  /\  B  e.  Q. )  ->  ( C  <Q  D  <->  ( B  .Q  C )  <Q  ( B  .Q  D ) ) )
13123expa 1206 . . . . 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 476 . . 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 473 . 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 7518 . . 3  |-  <Q  Or  Q.
18 ltrelnq 7485 . . 3  |-  <Q  C_  ( Q.  X.  Q. )
1917, 18sotri 5083 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1373    e. wcel 2177   class class class wbr 4047  (class class class)co 5951   Q.cnq 7400    .Q cmq 7403    <Q cltq 7405
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-coll 4163  ax-sep 4166  ax-nul 4174  ax-pow 4222  ax-pr 4257  ax-un 4484  ax-setind 4589  ax-iinf 4640
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ne 2378  df-ral 2490  df-rex 2491  df-reu 2492  df-rab 2494  df-v 2775  df-sbc 3000  df-csb 3095  df-dif 3169  df-un 3171  df-in 3173  df-ss 3180  df-nul 3462  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-iun 3931  df-br 4048  df-opab 4110  df-mpt 4111  df-tr 4147  df-eprel 4340  df-id 4344  df-po 4347  df-iso 4348  df-iord 4417  df-on 4419  df-suc 4422  df-iom 4643  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-res 4691  df-ima 4692  df-iota 5237  df-fun 5278  df-fn 5279  df-f 5280  df-f1 5281  df-fo 5282  df-f1o 5283  df-fv 5284  df-ov 5954  df-oprab 5955  df-mpo 5956  df-1st 6233  df-2nd 6234  df-recs 6398  df-irdg 6463  df-oadd 6513  df-omul 6514  df-er 6627  df-ec 6629  df-qs 6633  df-ni 7424  df-mi 7426  df-lti 7427  df-mpq 7465  df-enq 7467  df-nqqs 7468  df-mqqs 7470  df-ltnqqs 7473
This theorem is referenced by:  mulnqprlemrl  7693  mulnqprlemru  7694
  Copyright terms: Public domain W3C validator