Metamath Proof Explorer


Theorem ltrnq

Description: Ordering property of reciprocal for positive fractions. Proposition 9-2.6(iv) of Gleason p. 120. (Contributed by NM, 9-Mar-1996) (Revised by Mario Carneiro, 10-May-2013) (New usage is discouraged.)

Ref Expression
Assertion ltrnq A<𝑸B*𝑸B<𝑸*𝑸A

Proof

Step Hyp Ref Expression
1 ltrelnq <𝑸𝑸×𝑸
2 1 brel A<𝑸BA𝑸B𝑸
3 1 brel *𝑸B<𝑸*𝑸A*𝑸B𝑸*𝑸A𝑸
4 dmrecnq dom*𝑸=𝑸
5 0nnq ¬𝑸
6 4 5 ndmfvrcl *𝑸B𝑸B𝑸
7 4 5 ndmfvrcl *𝑸A𝑸A𝑸
8 6 7 anim12ci *𝑸B𝑸*𝑸A𝑸A𝑸B𝑸
9 3 8 syl *𝑸B<𝑸*𝑸AA𝑸B𝑸
10 breq1 x=Ax<𝑸yA<𝑸y
11 fveq2 x=A*𝑸x=*𝑸A
12 11 breq2d x=A*𝑸y<𝑸*𝑸x*𝑸y<𝑸*𝑸A
13 10 12 bibi12d x=Ax<𝑸y*𝑸y<𝑸*𝑸xA<𝑸y*𝑸y<𝑸*𝑸A
14 breq2 y=BA<𝑸yA<𝑸B
15 fveq2 y=B*𝑸y=*𝑸B
16 15 breq1d y=B*𝑸y<𝑸*𝑸A*𝑸B<𝑸*𝑸A
17 14 16 bibi12d y=BA<𝑸y*𝑸y<𝑸*𝑸AA<𝑸B*𝑸B<𝑸*𝑸A
18 recclnq x𝑸*𝑸x𝑸
19 recclnq y𝑸*𝑸y𝑸
20 mulclnq *𝑸x𝑸*𝑸y𝑸*𝑸x𝑸*𝑸y𝑸
21 18 19 20 syl2an x𝑸y𝑸*𝑸x𝑸*𝑸y𝑸
22 ltmnq *𝑸x𝑸*𝑸y𝑸x<𝑸y*𝑸x𝑸*𝑸y𝑸x<𝑸*𝑸x𝑸*𝑸y𝑸y
23 21 22 syl x𝑸y𝑸x<𝑸y*𝑸x𝑸*𝑸y𝑸x<𝑸*𝑸x𝑸*𝑸y𝑸y
24 mulcomnq *𝑸x𝑸*𝑸y𝑸x=x𝑸*𝑸x𝑸*𝑸y
25 mulassnq x𝑸*𝑸x𝑸*𝑸y=x𝑸*𝑸x𝑸*𝑸y
26 mulcomnq x𝑸*𝑸x𝑸*𝑸y=*𝑸y𝑸x𝑸*𝑸x
27 24 25 26 3eqtr2i *𝑸x𝑸*𝑸y𝑸x=*𝑸y𝑸x𝑸*𝑸x
28 recidnq x𝑸x𝑸*𝑸x=1𝑸
29 28 oveq2d x𝑸*𝑸y𝑸x𝑸*𝑸x=*𝑸y𝑸1𝑸
30 mulidnq *𝑸y𝑸*𝑸y𝑸1𝑸=*𝑸y
31 19 30 syl y𝑸*𝑸y𝑸1𝑸=*𝑸y
32 29 31 sylan9eq x𝑸y𝑸*𝑸y𝑸x𝑸*𝑸x=*𝑸y
33 27 32 eqtrid x𝑸y𝑸*𝑸x𝑸*𝑸y𝑸x=*𝑸y
34 mulassnq *𝑸x𝑸*𝑸y𝑸y=*𝑸x𝑸*𝑸y𝑸y
35 mulcomnq *𝑸y𝑸y=y𝑸*𝑸y
36 35 oveq2i *𝑸x𝑸*𝑸y𝑸y=*𝑸x𝑸y𝑸*𝑸y
37 34 36 eqtri *𝑸x𝑸*𝑸y𝑸y=*𝑸x𝑸y𝑸*𝑸y
38 recidnq y𝑸y𝑸*𝑸y=1𝑸
39 38 oveq2d y𝑸*𝑸x𝑸y𝑸*𝑸y=*𝑸x𝑸1𝑸
40 mulidnq *𝑸x𝑸*𝑸x𝑸1𝑸=*𝑸x
41 18 40 syl x𝑸*𝑸x𝑸1𝑸=*𝑸x
42 39 41 sylan9eqr x𝑸y𝑸*𝑸x𝑸y𝑸*𝑸y=*𝑸x
43 37 42 eqtrid x𝑸y𝑸*𝑸x𝑸*𝑸y𝑸y=*𝑸x
44 33 43 breq12d x𝑸y𝑸*𝑸x𝑸*𝑸y𝑸x<𝑸*𝑸x𝑸*𝑸y𝑸y*𝑸y<𝑸*𝑸x
45 23 44 bitrd x𝑸y𝑸x<𝑸y*𝑸y<𝑸*𝑸x
46 13 17 45 vtocl2ga A𝑸B𝑸A<𝑸B*𝑸B<𝑸*𝑸A
47 2 9 46 pm5.21nii A<𝑸B*𝑸B<𝑸*𝑸A