Theorem ltnqpr 7924

Description: We can order fractions via <_Q or <_P. (Contributed by Jim Kingdon, 19-Jun-2021.)

Assertion

Ref	Expression
ltnqpr	⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <Q 𝐵 ↔ ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩))

Distinct variable groups:   𝐴,𝑙   𝑢,𝐴   𝐵,𝑙   𝑢,𝐵

Proof of Theorem ltnqpr

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ltbtwnnqq 7746	. 2 ⊢ (𝐴 <Q 𝐵 ↔ ∃𝑥 ∈ Q (𝐴 <Q 𝑥 ∧ 𝑥 <Q 𝐵))
2		nqprlu 7878	. . . 4 ⊢ (𝐴 ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩ ∈ P)
3		nqprlu 7878	. . . 4 ⊢ (𝐵 ∈ Q → ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩ ∈ P)
4		ltdfpr 7837	. . . 4 ⊢ ((⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩ ∈ P ∧ ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩ ∈ P) → (⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩ ↔ ∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩))))
5	2, 3, 4	syl2an 289	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩ ↔ ∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩))))
6		vex 2818	. . . . . 6 ⊢ 𝑥 ∈ V
7		breq2 4118	. . . . . 6 ⊢ (𝑢 = 𝑥 → (𝐴 <Q 𝑢 ↔ 𝐴 <Q 𝑥))
8		ltnqex 7880	. . . . . . 7 ⊢ {𝑙 ∣ 𝑙 <Q 𝐴} ∈ V
9		gtnqex 7881	. . . . . . 7 ⊢ {𝑢 ∣ 𝐴 <Q 𝑢} ∈ V
10	8, 9	op2nd 6354	. . . . . 6 ⊢ (2nd ‘⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) = {𝑢 ∣ 𝐴 <Q 𝑢}
11	6, 7, 10	elab2 2968	. . . . 5 ⊢ (𝑥 ∈ (2nd ‘⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) ↔ 𝐴 <Q 𝑥)
12		breq1 4117	. . . . . 6 ⊢ (𝑙 = 𝑥 → (𝑙 <Q 𝐵 ↔ 𝑥 <Q 𝐵))
13		ltnqex 7880	. . . . . . 7 ⊢ {𝑙 ∣ 𝑙 <Q 𝐵} ∈ V
14		gtnqex 7881	. . . . . . 7 ⊢ {𝑢 ∣ 𝐵 <Q 𝑢} ∈ V
15	13, 14	op1st 6353	. . . . . 6 ⊢ (1st ‘⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩) = {𝑙 ∣ 𝑙 <Q 𝐵}
16	6, 12, 15	elab2 2968	. . . . 5 ⊢ (𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩) ↔ 𝑥 <Q 𝐵)
17	11, 16	anbi12i 460	. . . 4 ⊢ ((𝑥 ∈ (2nd ‘⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩)) ↔ (𝐴 <Q 𝑥 ∧ 𝑥 <Q 𝐵))
18	17	rexbii 2551	. . 3 ⊢ (∃𝑥 ∈ Q (𝑥 ∈ (2nd ‘⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st ‘⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩)) ↔ ∃𝑥 ∈ Q (𝐴 <Q 𝑥 ∧ 𝑥 <Q 𝐵))
19	5, 18	bitrdi 196	. 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩ ↔ ∃𝑥 ∈ Q (𝐴 <Q 𝑥 ∧ 𝑥 <Q 𝐵)))
20	1, 19	bitr4id 199	1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 <Q 𝐵 ↔ ⟨{𝑙 ∣ 𝑙 <Q 𝐴}, {𝑢 ∣ 𝐴 <Q 𝑢}⟩<P ⟨{𝑙 ∣ 𝑙 <Q 𝐵}, {𝑢 ∣ 𝐵 <Q 𝑢}⟩))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∈ wcel 2205  {cab 2220  ∃wrex 2523  ⟨cop 3697   class class class wbr 4114  ‘cfv 5357  1^st c1st 6345  2^nd c2nd 6346  Qcnq 7611   <_Q cltq 7616  Pcnp 7622  <_P cltp 7626

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-inp 7797  df-iltp 7801

This theorem is referenced by:  prplnqu  7951  ltrennb  8185