| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordpinq | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| ordpinq | ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brinxp 5737 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <pQ 𝐵 ↔ 𝐴( <pQ ∩ (Q × Q))𝐵)) | |
| 2 | df-ltnq 11041 | . . . 4 ⊢ <Q = ( <pQ ∩ (Q × Q)) | |
| 3 | 2 | breqi 5113 | . . 3 ⊢ (𝐴 <Q 𝐵 ↔ 𝐴( <pQ ∩ (Q × Q))𝐵) |
| 4 | 1, 3 | bitr4di 292 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <pQ 𝐵 ↔ 𝐴 <Q 𝐵)) |
| 5 | relxp 5675 | . . . . 5 ⊢ Rel (N × N) | |
| 6 | elpqn 11048 | . . . . 5 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N)) | |
| 7 | 1st2nd 8083 | . . . . 5 ⊢ ((Rel (N × N) ∧ 𝐴 ∈ (N × N)) → 𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉) | |
| 8 | 5, 6, 7 | sylancr 599 | . . . 4 ⊢ (𝐴 ∈ Q → 𝐴 = 〈(1st ‘𝐴), (2nd ‘𝐴)〉) |
| 9 | elpqn 11048 | . . . . 5 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N)) | |
| 10 | 1st2nd 8083 | . . . . 5 ⊢ ((Rel (N × N) ∧ 𝐵 ∈ (N × N)) → 𝐵 = 〈(1st ‘𝐵), (2nd ‘𝐵)〉) | |
| 11 | 5, 9, 10 | sylancr 599 | . . . 4 ⊢ (𝐵 ∈ Q → 𝐵 = 〈(1st ‘𝐵), (2nd ‘𝐵)〉) |
| 12 | 8, 11 | breqan12d 5123 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <pQ 𝐵 ↔ 〈(1st ‘𝐴), (2nd ‘𝐴)〉 <pQ 〈(1st ‘𝐵), (2nd ‘𝐵)〉)) |
| 13 | ordpipq 11065 | . . 3 ⊢ (〈(1st ‘𝐴), (2nd ‘𝐴)〉 <pQ 〈(1st ‘𝐵), (2nd ‘𝐵)〉 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴))) | |
| 14 | 12, 13 | bitrdi 290 | . 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <pQ 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) |
| 15 | 4, 14 | bitr3d 284 | 1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) <N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∩ cin 4091 〈cop 4839 class class class wbr 5107 × cxp 5655 Rel wrel 5662 ‘cfv 6565 (class class class)co 7450 1st c1st 8032 2nd c2nd 8033 Ncnpi 10967 ·N cmi 10969 <N clti 10970 <pQ cltpq 10973 Qcnq 10975 <Q cltq 10981 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-fv 6573 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-omul 8518 df-ni 10995 df-mi 10997 df-lti 10998 df-ltpq 11033 df-nq 11035 df-ltnq 11041 |
| This theorem is used by: ltsonq 11092 lterpq 11093 ltanq 11094 ltmnq 11095 ltexnq 11098 archnq 11103 |
| Copyright terms: Public domain | W3C validator |