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

Theorem nqprloc 7764
Description: A cut produced from a rational is located. Lemma for nqprlu 7766. (Contributed by Jim Kingdon, 8-Dec-2019.)
Assertion
Ref Expression
nqprloc  |-  ( A  e.  Q.  ->  A. q  e.  Q.  A. r  e. 
Q.  ( q  <Q 
r  ->  ( q  e.  { x  |  x 
<Q  A }  \/  r  e.  { x  |  A  <Q  x } ) ) )
Distinct variable group:    x, A, r, q

Proof of Theorem nqprloc
StepHypRef Expression
1 nqtri3or 7615 . . . . . . 7  |-  ( ( q  e.  Q.  /\  A  e.  Q. )  ->  ( q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
21ancoms 268 . . . . . 6  |-  ( ( A  e.  Q.  /\  q  e.  Q. )  ->  ( q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
32ad2antrr 488 . . . . 5  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
4 vex 2805 . . . . . . . . . 10  |-  q  e. 
_V
5 breq1 4091 . . . . . . . . . 10  |-  ( x  =  q  ->  (
x  <Q  A  <->  q  <Q  A ) )
64, 5elab 2950 . . . . . . . . 9  |-  ( q  e.  { x  |  x  <Q  A }  <->  q 
<Q  A )
76biimpri 133 . . . . . . . 8  |-  ( q 
<Q  A  ->  q  e. 
{ x  |  x 
<Q  A } )
87orcd 740 . . . . . . 7  |-  ( q 
<Q  A  ->  ( q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) )
98a1i 9 . . . . . 6  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  <Q  A  ->  (
q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) ) )
10 simpr 110 . . . . . . . 8  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  q  <Q  r )
11 breq1 4091 . . . . . . . 8  |-  ( q  =  A  ->  (
q  <Q  r  <->  A  <Q  r ) )
1210, 11syl5ibcom 155 . . . . . . 7  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  =  A  ->  A  <Q  r ) )
13 vex 2805 . . . . . . . . 9  |-  r  e. 
_V
14 breq2 4092 . . . . . . . . 9  |-  ( x  =  r  ->  ( A  <Q  x  <->  A  <Q  r ) )
1513, 14elab 2950 . . . . . . . 8  |-  ( r  e.  { x  |  A  <Q  x }  <->  A 
<Q  r )
16 olc 718 . . . . . . . 8  |-  ( r  e.  { x  |  A  <Q  x }  ->  ( q  e.  {
x  |  x  <Q  A }  \/  r  e. 
{ x  |  A  <Q  x } ) )
1715, 16sylbir 135 . . . . . . 7  |-  ( A 
<Q  r  ->  ( q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) )
1812, 17syl6 33 . . . . . 6  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  =  A  -> 
( q  e.  {
x  |  x  <Q  A }  \/  r  e. 
{ x  |  A  <Q  x } ) ) )
19 ltsonq 7617 . . . . . . . . . 10  |-  <Q  Or  Q.
20 ltrelnq 7584 . . . . . . . . . 10  |-  <Q  C_  ( Q.  X.  Q. )
2119, 20sotri 5132 . . . . . . . . 9  |-  ( ( A  <Q  q  /\  q  <Q  r )  ->  A  <Q  r )
2221, 17syl 14 . . . . . . . 8  |-  ( ( A  <Q  q  /\  q  <Q  r )  -> 
( q  e.  {
x  |  x  <Q  A }  \/  r  e. 
{ x  |  A  <Q  x } ) )
2322expcom 116 . . . . . . 7  |-  ( q 
<Q  r  ->  ( A 
<Q  q  ->  ( q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) ) )
2423adantl 277 . . . . . 6  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  ( A  <Q  q  ->  (
q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) ) )
259, 18, 243jaod 1340 . . . . 5  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
( q  <Q  A  \/  q  =  A  \/  A  <Q  q )  -> 
( q  e.  {
x  |  x  <Q  A }  \/  r  e. 
{ x  |  A  <Q  x } ) ) )
263, 25mpd 13 . . . 4  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) )
2726ex 115 . . 3  |-  ( ( ( A  e.  Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  ->  ( q  <Q 
r  ->  ( q  e.  { x  |  x 
<Q  A }  \/  r  e.  { x  |  A  <Q  x } ) ) )
2827ralrimiva 2605 . 2  |-  ( ( A  e.  Q.  /\  q  e.  Q. )  ->  A. r  e.  Q.  ( q  <Q  r  ->  ( q  e.  {
x  |  x  <Q  A }  \/  r  e. 
{ x  |  A  <Q  x } ) ) )
2928ralrimiva 2605 1  |-  ( A  e.  Q.  ->  A. q  e.  Q.  A. r  e. 
Q.  ( q  <Q 
r  ->  ( q  e.  { x  |  x 
<Q  A }  \/  r  e.  { x  |  A  <Q  x } ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ wo 715    \/ w3o 1003    = wceq 1397    e. wcel 2202   {cab 2217   A.wral 2510   class class class wbr 4088   Q.cnq 7499    <Q cltq 7504
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-mi 7525  df-lti 7526  df-enq 7566  df-nqqs 7567  df-ltnqqs 7572
This theorem is referenced by:  nqprxx  7765
  Copyright terms: Public domain W3C validator