MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ordpinq Unicode version

Theorem ordpinq 8583
Description: Ordering of positive fractions in terms of positive integers. (Contributed by NM, 13-Feb-1996.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)
Assertion
Ref Expression
ordpinq  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <Q  B  <->  ( ( 1st `  A )  .N  ( 2nd `  B
) )  <N  (
( 1st `  B
)  .N  ( 2nd `  A ) ) ) )

Proof of Theorem ordpinq
StepHypRef Expression
1 brinxp 4768 . . 3  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <pQ  B  <->  A (  <pQ  i^i  ( Q.  X.  Q. ) ) B ) )
2 df-ltnq 8558 . . . 4  |-  <Q  =  (  <pQ  i^i  ( Q.  X.  Q. ) )
32breqi 4045 . . 3  |-  ( A 
<Q  B  <->  A (  <pQ  i^i  ( Q.  X.  Q. ) ) B )
41, 3syl6bbr 254 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <pQ  B  <->  A  <Q  B ) )
5 relxp 4810 . . . . 5  |-  Rel  ( N.  X.  N. )
6 elpqn 8565 . . . . 5  |-  ( A  e.  Q.  ->  A  e.  ( N.  X.  N. ) )
7 1st2nd 6182 . . . . 5  |-  ( ( Rel  ( N.  X.  N. )  /\  A  e.  ( N.  X.  N. ) )  ->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
85, 6, 7sylancr 644 . . . 4  |-  ( A  e.  Q.  ->  A  =  <. ( 1st `  A
) ,  ( 2nd `  A ) >. )
9 elpqn 8565 . . . . 5  |-  ( B  e.  Q.  ->  B  e.  ( N.  X.  N. ) )
10 1st2nd 6182 . . . . 5  |-  ( ( Rel  ( N.  X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  B  =  <. ( 1st `  B
) ,  ( 2nd `  B ) >. )
115, 9, 10sylancr 644 . . . 4  |-  ( B  e.  Q.  ->  B  =  <. ( 1st `  B
) ,  ( 2nd `  B ) >. )
128, 11breqan12d 4054 . . 3  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <pQ  B  <->  <. ( 1st `  A ) ,  ( 2nd `  A )
>.  <pQ  <. ( 1st `  B
) ,  ( 2nd `  B ) >. )
)
13 ordpipq 8582 . . 3  |-  ( <.
( 1st `  A
) ,  ( 2nd `  A ) >.  <pQ  <. ( 1st `  B ) ,  ( 2nd `  B
) >. 
<->  ( ( 1st `  A
)  .N  ( 2nd `  B ) )  <N 
( ( 1st `  B
)  .N  ( 2nd `  A ) ) )
1412, 13syl6bb 252 . 2  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <pQ  B  <->  ( ( 1st `  A )  .N  ( 2nd `  B
) )  <N  (
( 1st `  B
)  .N  ( 2nd `  A ) ) ) )
154, 14bitr3d 246 1  |-  ( ( A  e.  Q.  /\  B  e.  Q. )  ->  ( A  <Q  B  <->  ( ( 1st `  A )  .N  ( 2nd `  B
) )  <N  (
( 1st `  B
)  .N  ( 2nd `  A ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696    i^i cin 3164   <.cop 3656   class class class wbr 4039    X. cxp 4703   Rel wrel 4710   ` cfv 5271  (class class class)co 5874   1stc1st 6136   2ndc2nd 6137   N.cnpi 8482    .N cmi 8484    <N clti 8485    <pQ cltpq 8488   Q.cnq 8490    <Q cltq 8496
This theorem is referenced by:  ltsonq  8609  lterpq  8610  ltanq  8611  ltmnq  8612  ltexnq  8615  archnq  8620
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-omul 6500  df-ni 8512  df-mi 8514  df-lti 8515  df-ltpq 8550  df-nq 8552  df-ltnq 8558
  Copyright terms: Public domain W3C validator