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

Theorem nqpru 7883
Description: Comparing a fraction to a real can be done by whether it is an element of the upper cut, or by 
<P. (Contributed by Jim Kingdon, 29-Nov-2020.)
Assertion
Ref Expression
nqpru  |-  ( ( A  e.  Q.  /\  B  e.  P. )  ->  ( A  e.  ( 2nd `  B )  <-> 
B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
)
Distinct variable group:    A, l, u
Allowed substitution hints:    B( u, l)

Proof of Theorem nqpru
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 prop 7806 . . . . . 6  |-  ( B  e.  P.  ->  <. ( 1st `  B ) ,  ( 2nd `  B
) >.  e.  P. )
2 prnminu 7820 . . . . . 6  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  A  e.  ( 2nd `  B ) )  ->  E. x  e.  ( 2nd `  B ) x 
<Q  A )
31, 2sylan 283 . . . . 5  |-  ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  ->  E. x  e.  ( 2nd `  B ) x 
<Q  A )
4 elprnqu 7813 . . . . . . . . . 10  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  x  e.  ( 2nd `  B ) )  ->  x  e.  Q. )
51, 4sylan 283 . . . . . . . . 9  |-  ( ( B  e.  P.  /\  x  e.  ( 2nd `  B ) )  ->  x  e.  Q. )
65ad2ant2r 509 . . . . . . . 8  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  x  e.  Q. )
7 simprl 531 . . . . . . . 8  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  x  e.  ( 2nd `  B ) )
8 vex 2818 . . . . . . . . . . . 12  |-  x  e. 
_V
9 breq1 4117 . . . . . . . . . . . 12  |-  ( l  =  x  ->  (
l  <Q  A  <->  x  <Q  A ) )
108, 9elab 2964 . . . . . . . . . . 11  |-  ( x  e.  { l  |  l  <Q  A }  <->  x 
<Q  A )
1110biimpri 133 . . . . . . . . . 10  |-  ( x 
<Q  A  ->  x  e. 
{ l  |  l 
<Q  A } )
12 ltnqex 7880 . . . . . . . . . . . 12  |-  { l  |  l  <Q  A }  e.  _V
13 gtnqex 7881 . . . . . . . . . . . 12  |-  { u  |  A  <Q  u }  e.  _V
1412, 13op1st 6353 . . . . . . . . . . 11  |-  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )  =  { l  |  l 
<Q  A }
1514eleq2i 2301 . . . . . . . . . 10  |-  ( x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )  <->  x  e.  { l  |  l  <Q  A }
)
1611, 15sylibr 134 . . . . . . . . 9  |-  ( x 
<Q  A  ->  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. ) )
1716ad2antll 491 . . . . . . . 8  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
)
18 19.8a 1639 . . . . . . . 8  |-  ( ( x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) )  ->  E. x ( x  e.  Q.  /\  (
x  e.  ( 2nd `  B )  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. ) ) ) )
196, 7, 17, 18syl12anc 1272 . . . . . . 7  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  E. x ( x  e.  Q.  /\  (
x  e.  ( 2nd `  B )  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. ) ) ) )
20 df-rex 2528 . . . . . . 7  |-  ( E. x  e.  Q.  (
x  e.  ( 2nd `  B )  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. ) )  <->  E. x
( x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
) ) )
2119, 20sylibr 134 . . . . . 6  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  E. x  e.  Q.  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) )
22 elprnqu 7813 . . . . . . . . 9  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  A  e.  ( 2nd `  B ) )  ->  A  e.  Q. )
231, 22sylan 283 . . . . . . . 8  |-  ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  ->  A  e.  Q. )
24 nqprlu 7878 . . . . . . . . 9  |-  ( A  e.  Q.  ->  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  e.  P. )
25 ltdfpr 7837 . . . . . . . . 9  |-  ( ( B  e.  P.  /\  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  e.  P. )  ->  ( B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  <->  E. x  e.  Q.  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )
2624, 25sylan2 286 . . . . . . . 8  |-  ( ( B  e.  P.  /\  A  e.  Q. )  ->  ( B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  <->  E. x  e.  Q.  ( x  e.  ( 2nd `  B
)  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
) ) )
2723, 26syldan 282 . . . . . . 7  |-  ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  -> 
( B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  <->  E. x  e.  Q.  ( x  e.  ( 2nd `  B
)  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
) ) )
2827adantr 276 . . . . . 6  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  ( B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >.  <->  E. x  e.  Q.  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )
2921, 28mpbird 167 . . . . 5  |-  ( ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  /\  ( x  e.  ( 2nd `  B )  /\  x  <Q  A ) )  ->  B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
303, 29rexlimddv 2667 . . . 4  |-  ( ( B  e.  P.  /\  A  e.  ( 2nd `  B ) )  ->  B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
3130ex 115 . . 3  |-  ( B  e.  P.  ->  ( A  e.  ( 2nd `  B )  ->  B  <P 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) )
3231adantl 277 . 2  |-  ( ( A  e.  Q.  /\  B  e.  P. )  ->  ( A  e.  ( 2nd `  B )  ->  B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
)
3326ancoms 268 . . . . 5  |-  ( ( A  e.  Q.  /\  B  e.  P. )  ->  ( B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  <->  E. x  e.  Q.  ( x  e.  ( 2nd `  B
)  /\  x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
) ) )
3433biimpa 296 . . . 4  |-  ( ( ( A  e.  Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )  ->  E. x  e.  Q.  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) )
3515, 10bitri 184 . . . . . . . 8  |-  ( x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )  <->  x  <Q  A )
3635biimpi 120 . . . . . . 7  |-  ( x  e.  ( 1st `  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )  ->  x  <Q  A )
3736ad2antll 491 . . . . . 6  |-  ( ( x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) )  ->  x  <Q  A )
3837adantl 277 . . . . 5  |-  ( ( ( ( A  e. 
Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. )  /\  (
x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )  ->  x  <Q  A )
39 simpllr 536 . . . . . 6  |-  ( ( ( ( A  e. 
Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. )  /\  (
x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )  ->  B  e.  P. )
40 simprrl 541 . . . . . 6  |-  ( ( ( ( A  e. 
Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. )  /\  (
x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )  ->  x  e.  ( 2nd `  B ) )
41 prcunqu 7816 . . . . . . 7  |-  ( (
<. ( 1st `  B
) ,  ( 2nd `  B ) >.  e.  P.  /\  x  e.  ( 2nd `  B ) )  -> 
( x  <Q  A  ->  A  e.  ( 2nd `  B ) ) )
421, 41sylan 283 . . . . . 6  |-  ( ( B  e.  P.  /\  x  e.  ( 2nd `  B ) )  -> 
( x  <Q  A  ->  A  e.  ( 2nd `  B ) ) )
4339, 40, 42syl2anc 411 . . . . 5  |-  ( ( ( ( A  e. 
Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. )  /\  (
x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )  ->  ( x  <Q  A  ->  A  e.  ( 2nd `  B ) ) )
4438, 43mpd 13 . . . 4  |-  ( ( ( ( A  e. 
Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. )  /\  (
x  e.  Q.  /\  ( x  e.  ( 2nd `  B )  /\  x  e.  ( 1st ` 
<. { l  |  l 
<Q  A } ,  {
u  |  A  <Q  u } >. ) ) ) )  ->  A  e.  ( 2nd `  B ) )
4534, 44rexlimddv 2667 . . 3  |-  ( ( ( A  e.  Q.  /\  B  e.  P. )  /\  B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )  ->  A  e.  ( 2nd `  B ) )
4645ex 115 . 2  |-  ( ( A  e.  Q.  /\  B  e.  P. )  ->  ( B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >.  ->  A  e.  ( 2nd `  B
) ) )
4732, 46impbid 129 1  |-  ( ( A  e.  Q.  /\  B  e.  P. )  ->  ( A  e.  ( 2nd `  B )  <-> 
B  <P  <. { l  |  l  <Q  A } ,  { u  |  A  <Q  u } >. )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   E.wex 1541    e. wcel 2205   {cab 2220   E.wrex 2523   <.cop 3697   class class class wbr 4114   ` cfv 5357   1stc1st 6345   2ndc2nd 6346   Q.cnq 7611    <Q cltq 7616   P.cnp 7622    <P cltp 7626
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-inp 7797  df-iltp 7801
This theorem is referenced by:  prplnqu  7951  caucvgprprlemmu  8026  caucvgprprlemopu  8030  caucvgprprlemexbt  8037  caucvgprprlem2  8041  suplocexprlemloc  8052
  Copyright terms: Public domain W3C validator