MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lterpq Structured version   Visualization version   GIF version

Theorem lterpq 9997
Description: Compatibility of ordering on equivalent fractions. (Contributed by Mario Carneiro, 9-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
lterpq (𝐴 <pQ 𝐵 ↔ ([Q]‘𝐴) <Q ([Q]‘𝐵))

Proof of Theorem lterpq
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ltpq 9937 . . . 4 <pQ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥)))}
2 opabssxp 5332 . . . 4 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥)))} ⊆ ((N × N) × (N × N))
31, 2eqsstri 3784 . . 3 <pQ ⊆ ((N × N) × (N × N))
43brel 5307 . 2 (𝐴 <pQ 𝐵 → (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)))
5 ltrelnq 9953 . . . 4 <Q ⊆ (Q × Q)
65brel 5307 . . 3 (([Q]‘𝐴) <Q ([Q]‘𝐵) → (([Q]‘𝐴) ∈ Q ∧ ([Q]‘𝐵) ∈ Q))
7 elpqn 9952 . . . 4 (([Q]‘𝐴) ∈ Q → ([Q]‘𝐴) ∈ (N × N))
8 elpqn 9952 . . . 4 (([Q]‘𝐵) ∈ Q → ([Q]‘𝐵) ∈ (N × N))
9 nqerf 9957 . . . . . . 7 [Q]:(N × N)⟶Q
109fdmi 6194 . . . . . 6 dom [Q] = (N × N)
11 0nelxp 5283 . . . . . 6 ¬ ∅ ∈ (N × N)
1210, 11ndmfvrcl 6362 . . . . 5 (([Q]‘𝐴) ∈ (N × N) → 𝐴 ∈ (N × N))
1310, 11ndmfvrcl 6362 . . . . 5 (([Q]‘𝐵) ∈ (N × N) → 𝐵 ∈ (N × N))
1412, 13anim12i 600 . . . 4 ((([Q]‘𝐴) ∈ (N × N) ∧ ([Q]‘𝐵) ∈ (N × N)) → (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)))
157, 8, 14syl2an 583 . . 3 ((([Q]‘𝐴) ∈ Q ∧ ([Q]‘𝐵) ∈ Q) → (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)))
166, 15syl 17 . 2 (([Q]‘𝐴) <Q ([Q]‘𝐵) → (𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)))
17 xp1st 7350 . . . . 5 (𝐴 ∈ (N × N) → (1st𝐴) ∈ N)
18 xp2nd 7351 . . . . 5 (𝐵 ∈ (N × N) → (2nd𝐵) ∈ N)
19 mulclpi 9920 . . . . 5 (((1st𝐴) ∈ N ∧ (2nd𝐵) ∈ N) → ((1st𝐴) ·N (2nd𝐵)) ∈ N)
2017, 18, 19syl2an 583 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ((1st𝐴) ·N (2nd𝐵)) ∈ N)
21 ltmpi 9931 . . . 4 (((1st𝐴) ·N (2nd𝐵)) ∈ N → (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) <N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))) ↔ (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵)))) <N (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))))))
2220, 21syl 17 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) <N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))) ↔ (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵)))) <N (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))))))
23 nqercl 9958 . . . 4 (𝐴 ∈ (N × N) → ([Q]‘𝐴) ∈ Q)
24 nqercl 9958 . . . 4 (𝐵 ∈ (N × N) → ([Q]‘𝐵) ∈ Q)
25 ordpinq 9970 . . . 4 ((([Q]‘𝐴) ∈ Q ∧ ([Q]‘𝐵) ∈ Q) → (([Q]‘𝐴) <Q ([Q]‘𝐵) ↔ ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) <N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴)))))
2623, 24, 25syl2an 583 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (([Q]‘𝐴) <Q ([Q]‘𝐵) ↔ ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) <N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴)))))
27 1st2nd2 7357 . . . . . 6 (𝐴 ∈ (N × N) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
28 1st2nd2 7357 . . . . . 6 (𝐵 ∈ (N × N) → 𝐵 = ⟨(1st𝐵), (2nd𝐵)⟩)
2927, 28breqan12d 4803 . . . . 5 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 <pQ 𝐵 ↔ ⟨(1st𝐴), (2nd𝐴)⟩ <pQ ⟨(1st𝐵), (2nd𝐵)⟩))
30 ordpipq 9969 . . . . 5 (⟨(1st𝐴), (2nd𝐴)⟩ <pQ ⟨(1st𝐵), (2nd𝐵)⟩ ↔ ((1st𝐴) ·N (2nd𝐵)) <N ((1st𝐵) ·N (2nd𝐴)))
3129, 30syl6bb 276 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 <pQ 𝐵 ↔ ((1st𝐴) ·N (2nd𝐵)) <N ((1st𝐵) ·N (2nd𝐴))))
32 xp1st 7350 . . . . . . 7 (([Q]‘𝐴) ∈ (N × N) → (1st ‘([Q]‘𝐴)) ∈ N)
3323, 7, 323syl 18 . . . . . 6 (𝐴 ∈ (N × N) → (1st ‘([Q]‘𝐴)) ∈ N)
34 xp2nd 7351 . . . . . . 7 (([Q]‘𝐵) ∈ (N × N) → (2nd ‘([Q]‘𝐵)) ∈ N)
3524, 8, 343syl 18 . . . . . 6 (𝐵 ∈ (N × N) → (2nd ‘([Q]‘𝐵)) ∈ N)
36 mulclpi 9920 . . . . . 6 (((1st ‘([Q]‘𝐴)) ∈ N ∧ (2nd ‘([Q]‘𝐵)) ∈ N) → ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ∈ N)
3733, 35, 36syl2an 583 . . . . 5 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ∈ N)
38 ltmpi 9931 . . . . 5 (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ∈ N → (((1st𝐴) ·N (2nd𝐵)) <N ((1st𝐵) ·N (2nd𝐴)) ↔ (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐴) ·N (2nd𝐵))) <N (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐵) ·N (2nd𝐴)))))
3937, 38syl 17 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (((1st𝐴) ·N (2nd𝐵)) <N ((1st𝐵) ·N (2nd𝐴)) ↔ (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐴) ·N (2nd𝐵))) <N (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐵) ·N (2nd𝐴)))))
40 mulcompi 9923 . . . . . 6 (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))))
4140a1i 11 . . . . 5 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵)))))
42 nqerrel 9959 . . . . . . . . 9 (𝐴 ∈ (N × N) → 𝐴 ~Q ([Q]‘𝐴))
4323, 7syl 17 . . . . . . . . . 10 (𝐴 ∈ (N × N) → ([Q]‘𝐴) ∈ (N × N))
44 enqbreq2 9947 . . . . . . . . . 10 ((𝐴 ∈ (N × N) ∧ ([Q]‘𝐴) ∈ (N × N)) → (𝐴 ~Q ([Q]‘𝐴) ↔ ((1st𝐴) ·N (2nd ‘([Q]‘𝐴))) = ((1st ‘([Q]‘𝐴)) ·N (2nd𝐴))))
4543, 44mpdan 667 . . . . . . . . 9 (𝐴 ∈ (N × N) → (𝐴 ~Q ([Q]‘𝐴) ↔ ((1st𝐴) ·N (2nd ‘([Q]‘𝐴))) = ((1st ‘([Q]‘𝐴)) ·N (2nd𝐴))))
4642, 45mpbid 222 . . . . . . . 8 (𝐴 ∈ (N × N) → ((1st𝐴) ·N (2nd ‘([Q]‘𝐴))) = ((1st ‘([Q]‘𝐴)) ·N (2nd𝐴)))
4746eqcomd 2777 . . . . . . 7 (𝐴 ∈ (N × N) → ((1st ‘([Q]‘𝐴)) ·N (2nd𝐴)) = ((1st𝐴) ·N (2nd ‘([Q]‘𝐴))))
48 nqerrel 9959 . . . . . . . 8 (𝐵 ∈ (N × N) → 𝐵 ~Q ([Q]‘𝐵))
4924, 8syl 17 . . . . . . . . 9 (𝐵 ∈ (N × N) → ([Q]‘𝐵) ∈ (N × N))
50 enqbreq2 9947 . . . . . . . . 9 ((𝐵 ∈ (N × N) ∧ ([Q]‘𝐵) ∈ (N × N)) → (𝐵 ~Q ([Q]‘𝐵) ↔ ((1st𝐵) ·N (2nd ‘([Q]‘𝐵))) = ((1st ‘([Q]‘𝐵)) ·N (2nd𝐵))))
5149, 50mpdan 667 . . . . . . . 8 (𝐵 ∈ (N × N) → (𝐵 ~Q ([Q]‘𝐵) ↔ ((1st𝐵) ·N (2nd ‘([Q]‘𝐵))) = ((1st ‘([Q]‘𝐵)) ·N (2nd𝐵))))
5248, 51mpbid 222 . . . . . . 7 (𝐵 ∈ (N × N) → ((1st𝐵) ·N (2nd ‘([Q]‘𝐵))) = ((1st ‘([Q]‘𝐵)) ·N (2nd𝐵)))
5347, 52oveqan12d 6814 . . . . . 6 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (((1st ‘([Q]‘𝐴)) ·N (2nd𝐴)) ·N ((1st𝐵) ·N (2nd ‘([Q]‘𝐵)))) = (((1st𝐴) ·N (2nd ‘([Q]‘𝐴))) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd𝐵))))
54 mulcompi 9923 . . . . . . 7 (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐵) ·N (2nd𝐴))) = (((1st𝐵) ·N (2nd𝐴)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))))
55 fvex 6344 . . . . . . . 8 (1st𝐵) ∈ V
56 fvex 6344 . . . . . . . 8 (2nd𝐴) ∈ V
57 fvex 6344 . . . . . . . 8 (1st ‘([Q]‘𝐴)) ∈ V
58 mulcompi 9923 . . . . . . . 8 (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
59 mulasspi 9924 . . . . . . . 8 ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
60 fvex 6344 . . . . . . . 8 (2nd ‘([Q]‘𝐵)) ∈ V
6155, 56, 57, 58, 59, 60caov411 7016 . . . . . . 7 (((1st𝐵) ·N (2nd𝐴)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵)))) = (((1st ‘([Q]‘𝐴)) ·N (2nd𝐴)) ·N ((1st𝐵) ·N (2nd ‘([Q]‘𝐵))))
6254, 61eqtri 2793 . . . . . 6 (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐵) ·N (2nd𝐴))) = (((1st ‘([Q]‘𝐴)) ·N (2nd𝐴)) ·N ((1st𝐵) ·N (2nd ‘([Q]‘𝐵))))
63 mulcompi 9923 . . . . . . 7 (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴)))) = (((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))) ·N ((1st𝐴) ·N (2nd𝐵)))
64 fvex 6344 . . . . . . . 8 (1st ‘([Q]‘𝐵)) ∈ V
65 fvex 6344 . . . . . . . 8 (2nd ‘([Q]‘𝐴)) ∈ V
66 fvex 6344 . . . . . . . 8 (1st𝐴) ∈ V
67 fvex 6344 . . . . . . . 8 (2nd𝐵) ∈ V
6864, 65, 66, 58, 59, 67caov411 7016 . . . . . . 7 (((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))) ·N ((1st𝐴) ·N (2nd𝐵))) = (((1st𝐴) ·N (2nd ‘([Q]‘𝐴))) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd𝐵)))
6963, 68eqtri 2793 . . . . . 6 (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴)))) = (((1st𝐴) ·N (2nd ‘([Q]‘𝐴))) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd𝐵)))
7053, 62, 693eqtr4g 2830 . . . . 5 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐵) ·N (2nd𝐴))) = (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴)))))
7141, 70breq12d 4800 . . . 4 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ((((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐴) ·N (2nd𝐵))) <N (((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵))) ·N ((1st𝐵) ·N (2nd𝐴))) ↔ (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵)))) <N (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))))))
7231, 39, 713bitrd 294 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 <pQ 𝐵 ↔ (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐴)) ·N (2nd ‘([Q]‘𝐵)))) <N (((1st𝐴) ·N (2nd𝐵)) ·N ((1st ‘([Q]‘𝐵)) ·N (2nd ‘([Q]‘𝐴))))))
7322, 26, 723bitr4rd 301 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 <pQ 𝐵 ↔ ([Q]‘𝐴) <Q ([Q]‘𝐵)))
744, 16, 73pm5.21nii 367 1 (𝐴 <pQ 𝐵 ↔ ([Q]‘𝐴) <Q ([Q]‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 382   = wceq 1631  wcel 2145  cop 4323   class class class wbr 4787  {copab 4847   × cxp 5248  cfv 6030  (class class class)co 6795  1st c1st 7316  2nd c2nd 7317  Ncnpi 9871   ·N cmi 9873   <N clti 9874   <pQ cltpq 9877   ~Q ceq 9878  Qcnq 9879  [Q]cerq 9881   <Q cltq 9885
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4916  ax-nul 4924  ax-pow 4975  ax-pr 5035  ax-un 7099
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3or 1072  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-ral 3066  df-rex 3067  df-reu 3068  df-rmo 3069  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4227  df-pw 4300  df-sn 4318  df-pr 4320  df-tp 4322  df-op 4324  df-uni 4576  df-iun 4657  df-br 4788  df-opab 4848  df-mpt 4865  df-tr 4888  df-id 5158  df-eprel 5163  df-po 5171  df-so 5172  df-fr 5209  df-we 5211  df-xp 5256  df-rel 5257  df-cnv 5258  df-co 5259  df-dm 5260  df-rn 5261  df-res 5262  df-ima 5263  df-pred 5822  df-ord 5868  df-on 5869  df-lim 5870  df-suc 5871  df-iota 5993  df-fun 6032  df-fn 6033  df-f 6034  df-f1 6035  df-fo 6036  df-f1o 6037  df-fv 6038  df-ov 6798  df-oprab 6799  df-mpt2 6800  df-om 7216  df-1st 7318  df-2nd 7319  df-wrecs 7562  df-recs 7624  df-rdg 7662  df-1o 7716  df-oadd 7720  df-omul 7721  df-er 7899  df-ni 9899  df-mi 9901  df-lti 9902  df-ltpq 9937  df-enq 9938  df-nq 9939  df-erq 9940  df-1nq 9943  df-ltnq 9945
This theorem is referenced by:  ltanq  9998  ltmnq  9999  1lt2nq  10000
  Copyright terms: Public domain W3C validator