ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nqprl GIF version

Theorem nqprl 7323
Description: Comparing a fraction to a real can be done by whether it is an element of the lower cut, or by <P. (Contributed by Jim Kingdon, 8-Jul-2020.)
Assertion
Ref Expression
nqprl ((𝐴Q𝐵P) → (𝐴 ∈ (1st𝐵) ↔ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵))
Distinct variable group:   𝐴,𝑙,𝑢
Allowed substitution hints:   𝐵(𝑢,𝑙)

Proof of Theorem nqprl
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 prop 7247 . . . . . 6 (𝐵P → ⟨(1st𝐵), (2nd𝐵)⟩ ∈ P)
2 prnmaxl 7260 . . . . . 6 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝐴 ∈ (1st𝐵)) → ∃𝑥 ∈ (1st𝐵)𝐴 <Q 𝑥)
31, 2sylan 279 . . . . 5 ((𝐵P𝐴 ∈ (1st𝐵)) → ∃𝑥 ∈ (1st𝐵)𝐴 <Q 𝑥)
4 elprnql 7253 . . . . . . . . . 10 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝑥 ∈ (1st𝐵)) → 𝑥Q)
51, 4sylan 279 . . . . . . . . 9 ((𝐵P𝑥 ∈ (1st𝐵)) → 𝑥Q)
65ad2ant2r 498 . . . . . . . 8 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → 𝑥Q)
7 vex 2661 . . . . . . . . . . . 12 𝑥 ∈ V
8 breq2 3901 . . . . . . . . . . . 12 (𝑢 = 𝑥 → (𝐴 <Q 𝑢𝐴 <Q 𝑥))
97, 8elab 2800 . . . . . . . . . . 11 (𝑥 ∈ {𝑢𝐴 <Q 𝑢} ↔ 𝐴 <Q 𝑥)
109biimpri 132 . . . . . . . . . 10 (𝐴 <Q 𝑥𝑥 ∈ {𝑢𝐴 <Q 𝑢})
11 ltnqex 7321 . . . . . . . . . . . 12 {𝑙𝑙 <Q 𝐴} ∈ V
12 gtnqex 7322 . . . . . . . . . . . 12 {𝑢𝐴 <Q 𝑢} ∈ V
1311, 12op2nd 6011 . . . . . . . . . . 11 (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) = {𝑢𝐴 <Q 𝑢}
1413eleq2i 2182 . . . . . . . . . 10 (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ↔ 𝑥 ∈ {𝑢𝐴 <Q 𝑢})
1510, 14sylibr 133 . . . . . . . . 9 (𝐴 <Q 𝑥𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
1615ad2antll 480 . . . . . . . 8 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → 𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩))
17 simprl 503 . . . . . . . 8 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → 𝑥 ∈ (1st𝐵))
18 19.8a 1552 . . . . . . . 8 ((𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))) → ∃𝑥(𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
196, 16, 17, 18syl12anc 1197 . . . . . . 7 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → ∃𝑥(𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
20 df-rex 2397 . . . . . . 7 (∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)) ↔ ∃𝑥(𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
2119, 20sylibr 133 . . . . . 6 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → ∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))
22 elprnql 7253 . . . . . . . . 9 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝐴 ∈ (1st𝐵)) → 𝐴Q)
231, 22sylan 279 . . . . . . . 8 ((𝐵P𝐴 ∈ (1st𝐵)) → 𝐴Q)
24 simpl 108 . . . . . . . 8 ((𝐵P𝐴 ∈ (1st𝐵)) → 𝐵P)
25 nqprlu 7319 . . . . . . . . 9 (𝐴Q → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P)
26 ltdfpr 7278 . . . . . . . . 9 ((⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩ ∈ P𝐵P) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵 ↔ ∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
2725, 26sylan 279 . . . . . . . 8 ((𝐴Q𝐵P) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵 ↔ ∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
2823, 24, 27syl2anc 406 . . . . . . 7 ((𝐵P𝐴 ∈ (1st𝐵)) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵 ↔ ∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
2928adantr 272 . . . . . 6 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵 ↔ ∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))))
3021, 29mpbird 166 . . . . 5 (((𝐵P𝐴 ∈ (1st𝐵)) ∧ (𝑥 ∈ (1st𝐵) ∧ 𝐴 <Q 𝑥)) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵)
313, 30rexlimddv 2529 . . . 4 ((𝐵P𝐴 ∈ (1st𝐵)) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵)
3231ex 114 . . 3 (𝐵P → (𝐴 ∈ (1st𝐵) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵))
3332adantl 273 . 2 ((𝐴Q𝐵P) → (𝐴 ∈ (1st𝐵) → ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵))
3427biimpa 292 . . . 4 (((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) → ∃𝑥Q (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))
3514, 9bitri 183 . . . . . . . 8 (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ↔ 𝐴 <Q 𝑥)
3635biimpi 119 . . . . . . 7 (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) → 𝐴 <Q 𝑥)
3736ad2antrl 479 . . . . . 6 ((𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵))) → 𝐴 <Q 𝑥)
3837adantl 273 . . . . 5 ((((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) ∧ (𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))) → 𝐴 <Q 𝑥)
39 simpllr 506 . . . . . 6 ((((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) ∧ (𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))) → 𝐵P)
40 simprrr 512 . . . . . 6 ((((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) ∧ (𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))) → 𝑥 ∈ (1st𝐵))
41 prcdnql 7256 . . . . . . 7 ((⟨(1st𝐵), (2nd𝐵)⟩ ∈ P𝑥 ∈ (1st𝐵)) → (𝐴 <Q 𝑥𝐴 ∈ (1st𝐵)))
421, 41sylan 279 . . . . . 6 ((𝐵P𝑥 ∈ (1st𝐵)) → (𝐴 <Q 𝑥𝐴 ∈ (1st𝐵)))
4339, 40, 42syl2anc 406 . . . . 5 ((((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) ∧ (𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))) → (𝐴 <Q 𝑥𝐴 ∈ (1st𝐵)))
4438, 43mpd 13 . . . 4 ((((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) ∧ (𝑥Q ∧ (𝑥 ∈ (2nd ‘⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩) ∧ 𝑥 ∈ (1st𝐵)))) → 𝐴 ∈ (1st𝐵))
4534, 44rexlimddv 2529 . . 3 (((𝐴Q𝐵P) ∧ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵) → 𝐴 ∈ (1st𝐵))
4645ex 114 . 2 ((𝐴Q𝐵P) → (⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵𝐴 ∈ (1st𝐵)))
4733, 46impbid 128 1 ((𝐴Q𝐵P) → (𝐴 ∈ (1st𝐵) ↔ ⟨{𝑙𝑙 <Q 𝐴}, {𝑢𝐴 <Q 𝑢}⟩<P 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wex 1451  wcel 1463  {cab 2101  wrex 2392  cop 3498   class class class wbr 3897  cfv 5091  1st c1st 6002  2nd c2nd 6003  Qcnq 7052   <Q cltq 7057  Pcnp 7063  <P cltp 7067
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4011  ax-sep 4014  ax-nul 4022  ax-pow 4066  ax-pr 4099  ax-un 4323  ax-setind 4420  ax-iinf 4470
This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ne 2284  df-ral 2396  df-rex 2397  df-reu 2398  df-rab 2400  df-v 2660  df-sbc 2881  df-csb 2974  df-dif 3041  df-un 3043  df-in 3045  df-ss 3052  df-nul 3332  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-int 3740  df-iun 3783  df-br 3898  df-opab 3958  df-mpt 3959  df-tr 3995  df-eprel 4179  df-id 4183  df-po 4186  df-iso 4187  df-iord 4256  df-on 4258  df-suc 4261  df-iom 4473  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-rn 4518  df-res 4519  df-ima 4520  df-iota 5056  df-fun 5093  df-fn 5094  df-f 5095  df-f1 5096  df-fo 5097  df-f1o 5098  df-fv 5099  df-ov 5743  df-oprab 5744  df-mpo 5745  df-1st 6004  df-2nd 6005  df-recs 6168  df-irdg 6233  df-1o 6279  df-oadd 6283  df-omul 6284  df-er 6395  df-ec 6397  df-qs 6401  df-ni 7076  df-pli 7077  df-mi 7078  df-lti 7079  df-plpq 7116  df-mpq 7117  df-enq 7119  df-nqqs 7120  df-plqqs 7121  df-mqqs 7122  df-1nqqs 7123  df-rq 7124  df-ltnqqs 7125  df-inp 7238  df-iltp 7242
This theorem is referenced by:  caucvgprlemcanl  7416  cauappcvgprlem1  7431  archrecpr  7436  caucvgprlem1  7451  caucvgprprlemml  7466  caucvgprprlemopl  7469
  Copyright terms: Public domain W3C validator