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

Theorem nqprloc 7657
Description: A cut produced from a rational is located. Lemma for nqprlu 7659. (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 7508 . . . . . . 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 2774 . . . . . . . . . 10  |-  q  e. 
_V
5 breq1 4046 . . . . . . . . . 10  |-  ( x  =  q  ->  (
x  <Q  A  <->  q  <Q  A ) )
64, 5elab 2916 . . . . . . . . 9  |-  ( q  e.  { x  |  x  <Q  A }  <->  q 
<Q  A )
76biimpri 133 . . . . . . . 8  |-  ( q 
<Q  A  ->  q  e. 
{ x  |  x 
<Q  A } )
87orcd 734 . . . . . . 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 4046 . . . . . . . 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 2774 . . . . . . . . 9  |-  r  e. 
_V
14 breq2 4047 . . . . . . . . 9  |-  ( x  =  r  ->  ( A  <Q  x  <->  A  <Q  r ) )
1513, 14elab 2916 . . . . . . . 8  |-  ( r  e.  { x  |  A  <Q  x }  <->  A 
<Q  r )
16 olc 712 . . . . . . . 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 7510 . . . . . . . . . 10  |-  <Q  Or  Q.
20 ltrelnq 7477 . . . . . . . . . 10  |-  <Q  C_  ( Q.  X.  Q. )
2119, 20sotri 5077 . . . . . . . . 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 1316 . . . . 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 2578 . 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 2578 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 709    \/ w3o 979    = wceq 1372    e. wcel 2175   {cab 2190   A.wral 2483   class class class wbr 4043   Q.cnq 7392    <Q cltq 7397
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 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-coll 4158  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584  ax-iinf 4635
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-reu 2490  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-iun 3928  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-eprel 4335  df-id 4339  df-po 4342  df-iso 4343  df-iord 4412  df-on 4414  df-suc 4417  df-iom 4638  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-recs 6390  df-irdg 6455  df-oadd 6505  df-omul 6506  df-er 6619  df-ec 6621  df-qs 6625  df-ni 7416  df-mi 7418  df-lti 7419  df-enq 7459  df-nqqs 7460  df-ltnqqs 7465
This theorem is referenced by:  nqprxx  7658
  Copyright terms: Public domain W3C validator