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

Theorem ordpipq 10799
Description: Ordering of positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)
Assertion
Ref Expression
ordpipq (⟨𝐴, 𝐵⟩ <pQ𝐶, 𝐷⟩ ↔ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))

Proof of Theorem ordpipq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 5409 . . 3 𝐴, 𝐵⟩ ∈ V
2 opex 5409 . . 3 𝐶, 𝐷⟩ ∈ V
3 eleq1 2824 . . . . . 6 (𝑥 = ⟨𝐴, 𝐵⟩ → (𝑥 ∈ (N × N) ↔ ⟨𝐴, 𝐵⟩ ∈ (N × N)))
43anbi1d 630 . . . . 5 (𝑥 = ⟨𝐴, 𝐵⟩ → ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ↔ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N))))
54anbi1d 630 . . . 4 (𝑥 = ⟨𝐴, 𝐵⟩ → (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥))) ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥)))))
6 fveq2 6825 . . . . . . . 8 (𝑥 = ⟨𝐴, 𝐵⟩ → (1st𝑥) = (1st ‘⟨𝐴, 𝐵⟩))
7 opelxp 5656 . . . . . . . . . 10 (⟨𝐴, 𝐵⟩ ∈ (N × N) ↔ (𝐴N𝐵N))
8 op1stg 7911 . . . . . . . . . 10 ((𝐴N𝐵N) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
97, 8sylbi 216 . . . . . . . . 9 (⟨𝐴, 𝐵⟩ ∈ (N × N) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
109adantr 481 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
116, 10sylan9eq 2796 . . . . . . 7 ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N))) → (1st𝑥) = 𝐴)
1211oveq1d 7352 . . . . . 6 ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N))) → ((1st𝑥) ·N (2nd𝑦)) = (𝐴 ·N (2nd𝑦)))
13 fveq2 6825 . . . . . . . 8 (𝑥 = ⟨𝐴, 𝐵⟩ → (2nd𝑥) = (2nd ‘⟨𝐴, 𝐵⟩))
14 op2ndg 7912 . . . . . . . . . 10 ((𝐴N𝐵N) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
157, 14sylbi 216 . . . . . . . . 9 (⟨𝐴, 𝐵⟩ ∈ (N × N) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
1615adantr 481 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
1713, 16sylan9eq 2796 . . . . . . 7 ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N))) → (2nd𝑥) = 𝐵)
1817oveq2d 7353 . . . . . 6 ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N))) → ((1st𝑦) ·N (2nd𝑥)) = ((1st𝑦) ·N 𝐵))
1912, 18breq12d 5105 . . . . 5 ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N))) → (((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥)) ↔ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵)))
2019pm5.32da 579 . . . 4 (𝑥 = ⟨𝐴, 𝐵⟩ → (((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥))) ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵))))
215, 20bitrd 278 . . 3 (𝑥 = ⟨𝐴, 𝐵⟩ → (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥))) ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵))))
22 eleq1 2824 . . . . . 6 (𝑦 = ⟨𝐶, 𝐷⟩ → (𝑦 ∈ (N × N) ↔ ⟨𝐶, 𝐷⟩ ∈ (N × N)))
2322anbi2d 629 . . . . 5 (𝑦 = ⟨𝐶, 𝐷⟩ → ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ↔ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N))))
2423anbi1d 630 . . . 4 (𝑦 = ⟨𝐶, 𝐷⟩ → (((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵)) ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵))))
25 fveq2 6825 . . . . . . . 8 (𝑦 = ⟨𝐶, 𝐷⟩ → (2nd𝑦) = (2nd ‘⟨𝐶, 𝐷⟩))
26 opelxp 5656 . . . . . . . . . 10 (⟨𝐶, 𝐷⟩ ∈ (N × N) ↔ (𝐶N𝐷N))
27 op2ndg 7912 . . . . . . . . . 10 ((𝐶N𝐷N) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
2826, 27sylbi 216 . . . . . . . . 9 (⟨𝐶, 𝐷⟩ ∈ (N × N) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
2928adantl 482 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) → (2nd ‘⟨𝐶, 𝐷⟩) = 𝐷)
3025, 29sylan9eq 2796 . . . . . . 7 ((𝑦 = ⟨𝐶, 𝐷⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N))) → (2nd𝑦) = 𝐷)
3130oveq2d 7353 . . . . . 6 ((𝑦 = ⟨𝐶, 𝐷⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N))) → (𝐴 ·N (2nd𝑦)) = (𝐴 ·N 𝐷))
32 fveq2 6825 . . . . . . . 8 (𝑦 = ⟨𝐶, 𝐷⟩ → (1st𝑦) = (1st ‘⟨𝐶, 𝐷⟩))
33 op1stg 7911 . . . . . . . . . 10 ((𝐶N𝐷N) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
3426, 33sylbi 216 . . . . . . . . 9 (⟨𝐶, 𝐷⟩ ∈ (N × N) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
3534adantl 482 . . . . . . . 8 ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) → (1st ‘⟨𝐶, 𝐷⟩) = 𝐶)
3632, 35sylan9eq 2796 . . . . . . 7 ((𝑦 = ⟨𝐶, 𝐷⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N))) → (1st𝑦) = 𝐶)
3736oveq1d 7352 . . . . . 6 ((𝑦 = ⟨𝐶, 𝐷⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N))) → ((1st𝑦) ·N 𝐵) = (𝐶 ·N 𝐵))
3831, 37breq12d 5105 . . . . 5 ((𝑦 = ⟨𝐶, 𝐷⟩ ∧ (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N))) → ((𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵) ↔ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵)))
3938pm5.32da 579 . . . 4 (𝑦 = ⟨𝐶, 𝐷⟩ → (((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵)) ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))))
4024, 39bitrd 278 . . 3 (𝑦 = ⟨𝐶, 𝐷⟩ → (((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝐴 ·N (2nd𝑦)) <N ((1st𝑦) ·N 𝐵)) ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))))
41 df-ltpq 10767 . . 3 <pQ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ((1st𝑥) ·N (2nd𝑦)) <N ((1st𝑦) ·N (2nd𝑥)))}
421, 2, 21, 40, 41brab 5487 . 2 (⟨𝐴, 𝐵⟩ <pQ𝐶, 𝐷⟩ ↔ ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵)))
43 simpr 485 . . 3 (((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵)) → (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))
44 ltrelpi 10746 . . . . . 6 <N ⊆ (N × N)
4544brel 5683 . . . . 5 ((𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵) → ((𝐴 ·N 𝐷) ∈ N ∧ (𝐶 ·N 𝐵) ∈ N))
46 dmmulpi 10748 . . . . . . 7 dom ·N = (N × N)
47 0npi 10739 . . . . . . 7 ¬ ∅ ∈ N
4846, 47ndmovrcl 7520 . . . . . 6 ((𝐴 ·N 𝐷) ∈ N → (𝐴N𝐷N))
4946, 47ndmovrcl 7520 . . . . . 6 ((𝐶 ·N 𝐵) ∈ N → (𝐶N𝐵N))
5048, 49anim12i 613 . . . . 5 (((𝐴 ·N 𝐷) ∈ N ∧ (𝐶 ·N 𝐵) ∈ N) → ((𝐴N𝐷N) ∧ (𝐶N𝐵N)))
51 opelxpi 5657 . . . . . . 7 ((𝐴N𝐵N) → ⟨𝐴, 𝐵⟩ ∈ (N × N))
5251ad2ant2rl 746 . . . . . 6 (((𝐴N𝐷N) ∧ (𝐶N𝐵N)) → ⟨𝐴, 𝐵⟩ ∈ (N × N))
53 simprl 768 . . . . . . 7 (((𝐴N𝐷N) ∧ (𝐶N𝐵N)) → 𝐶N)
54 simplr 766 . . . . . . 7 (((𝐴N𝐷N) ∧ (𝐶N𝐵N)) → 𝐷N)
5553, 54opelxpd 5658 . . . . . 6 (((𝐴N𝐷N) ∧ (𝐶N𝐵N)) → ⟨𝐶, 𝐷⟩ ∈ (N × N))
5652, 55jca 512 . . . . 5 (((𝐴N𝐷N) ∧ (𝐶N𝐵N)) → (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)))
5745, 50, 563syl 18 . . . 4 ((𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵) → (⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)))
5857ancri 550 . . 3 ((𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵) → ((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵)))
5943, 58impbii 208 . 2 (((⟨𝐴, 𝐵⟩ ∈ (N × N) ∧ ⟨𝐶, 𝐷⟩ ∈ (N × N)) ∧ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵)) ↔ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))
6042, 59bitri 274 1 (⟨𝐴, 𝐵⟩ <pQ𝐶, 𝐷⟩ ↔ (𝐴 ·N 𝐷) <N (𝐶 ·N 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1540  wcel 2105  cop 4579   class class class wbr 5092   × cxp 5618  cfv 6479  (class class class)co 7337  1st c1st 7897  2nd c2nd 7898  Ncnpi 10701   ·N cmi 10703   <N clti 10704   <pQ cltpq 10707
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-sep 5243  ax-nul 5250  ax-pr 5372  ax-un 7650
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3404  df-v 3443  df-sbc 3728  df-csb 3844  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4270  df-if 4474  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4853  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5176  df-id 5518  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-iota 6431  df-fun 6481  df-fn 6482  df-f 6483  df-fv 6487  df-ov 7340  df-oprab 7341  df-mpo 7342  df-om 7781  df-1st 7899  df-2nd 7900  df-omul 8372  df-ni 10729  df-mi 10731  df-lti 10732  df-ltpq 10767
This theorem is referenced by:  ordpinq  10800  lterpq  10827  ltanq  10828  ltmnq  10829  1lt2nq  10830
  Copyright terms: Public domain W3C validator