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

Theorem nqprloc 7902
Description: A cut produced from a rational is located. Lemma for nqprlu 7904. (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 7753 . . . . . . 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 492 . . . . 5  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
4 vex 2824 . . . . . . . . . 10  |-  q  e. 
_V
5 breq1 4128 . . . . . . . . . 10  |-  ( x  =  q  ->  (
x  <Q  A  <->  q  <Q  A ) )
64, 5elab 2970 . . . . . . . . 9  |-  ( q  e.  { x  |  x  <Q  A }  <->  q 
<Q  A )
76biimpri 133 . . . . . . . 8  |-  ( q 
<Q  A  ->  q  e. 
{ x  |  x 
<Q  A } )
87orcd 745 . . . . . . 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 4128 . . . . . . . 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 2824 . . . . . . . . 9  |-  r  e. 
_V
14 breq2 4129 . . . . . . . . 9  |-  ( x  =  r  ->  ( A  <Q  x  <->  A  <Q  r ) )
1513, 14elab 2970 . . . . . . . 8  |-  ( r  e.  { x  |  A  <Q  x }  <->  A 
<Q  r )
16 olc 723 . . . . . . . 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 7755 . . . . . . . . . 10  |-  <Q  Or  Q.
20 ltrelnq 7722 . . . . . . . . . 10  |-  <Q  C_  ( Q.  X.  Q. )
2119, 20sotri 5178 . . . . . . . . 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 1345 . . . . 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 2623 . 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 2623 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 720    \/ w3o 1008    = wceq 1402    e. wcel 2209   {cab 2224   A.wral 2528   class class class wbr 4125   Q.cnq 7637    <Q cltq 7642
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-eprel 4429  df-id 4433  df-po 4436  df-iso 4437  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-1st 6364  df-2nd 6365  df-recs 6566  df-irdg 6631  df-oadd 6681  df-omul 6682  df-er 6797  df-ec 6799  df-qs 6803  df-ni 7661  df-mi 7663  df-lti 7664  df-enq 7704  df-nqqs 7705  df-ltnqqs 7710
This theorem is referenced by:  nqprxx  7903
  Copyright terms: Public domain W3C validator