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

Theorem nqprloc 7346
Description: A cut produced from a rational is located. Lemma for nqprlu 7348. (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 7197 . . . . . . 7  |-  ( ( q  e.  Q.  /\  A  e.  Q. )  ->  ( q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
21ancoms 266 . . . . . 6  |-  ( ( A  e.  Q.  /\  q  e.  Q. )  ->  ( q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
32ad2antrr 479 . . . . 5  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  <Q  A  \/  q  =  A  \/  A  <Q  q ) )
4 vex 2684 . . . . . . . . . 10  |-  q  e. 
_V
5 breq1 3927 . . . . . . . . . 10  |-  ( x  =  q  ->  (
x  <Q  A  <->  q  <Q  A ) )
64, 5elab 2823 . . . . . . . . 9  |-  ( q  e.  { x  |  x  <Q  A }  <->  q 
<Q  A )
76biimpri 132 . . . . . . . 8  |-  ( q 
<Q  A  ->  q  e. 
{ x  |  x 
<Q  A } )
87orcd 722 . . . . . . 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 109 . . . . . . . 8  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  q  <Q  r )
11 breq1 3927 . . . . . . . 8  |-  ( q  =  A  ->  (
q  <Q  r  <->  A  <Q  r ) )
1210, 11syl5ibcom 154 . . . . . . 7  |-  ( ( ( ( A  e. 
Q.  /\  q  e.  Q. )  /\  r  e.  Q. )  /\  q  <Q  r )  ->  (
q  =  A  ->  A  <Q  r ) )
13 vex 2684 . . . . . . . . 9  |-  r  e. 
_V
14 breq2 3928 . . . . . . . . 9  |-  ( x  =  r  ->  ( A  <Q  x  <->  A  <Q  r ) )
1513, 14elab 2823 . . . . . . . 8  |-  ( r  e.  { x  |  A  <Q  x }  <->  A 
<Q  r )
16 olc 700 . . . . . . . 8  |-  ( r  e.  { x  |  A  <Q  x }  ->  ( q  e.  {
x  |  x  <Q  A }  \/  r  e. 
{ x  |  A  <Q  x } ) )
1715, 16sylbir 134 . . . . . . 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 7199 . . . . . . . . . 10  |-  <Q  Or  Q.
20 ltrelnq 7166 . . . . . . . . . 10  |-  <Q  C_  ( Q.  X.  Q. )
2119, 20sotri 4929 . . . . . . . . 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 115 . . . . . . 7  |-  ( q 
<Q  r  ->  ( A 
<Q  q  ->  ( q  e.  { x  |  x  <Q  A }  \/  r  e.  { x  |  A  <Q  x }
) ) )
2423adantl 275 . . . . . 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 1282 . . . . 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 114 . . 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 2503 . 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 2503 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 103    \/ wo 697    \/ w3o 961    = wceq 1331    e. wcel 1480   {cab 2123   A.wral 2414   class class class wbr 3924   Q.cnq 7081    <Q cltq 7086
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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-mi 7107  df-lti 7108  df-enq 7148  df-nqqs 7149  df-ltnqqs 7154
This theorem is referenced by:  nqprxx  7347
  Copyright terms: Public domain W3C validator