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

Theorem prarloclem 7442
Description: A special case of Lemma 6.16 from [BauerTaylor], p. 32. Given evenly spaced rational numbers from 
A to  A  +Q  ( N  .Q  P ) (which are in the lower and upper cuts, respectively, of a real number), there are a pair of numbers, two positions apart in the even spacing, which straddle the cut. (Contributed by Jim Kingdon, 22-Oct-2019.)
Assertion
Ref Expression
prarloclem  |-  ( ( ( <. L ,  U >.  e.  P.  /\  A  e.  L )  /\  ( N  e.  N.  /\  P  e.  Q.  /\  1o  <N  N )  /\  ( A  +Q  ( [ <. N ,  1o >. ]  ~Q  .Q  P ) )  e.  U )  ->  E. j  e.  om  ( ( A +Q0  ( [ <. j ,  1o >. ] ~Q0 ·Q0  P )
)  e.  L  /\  ( A  +Q  ( [ <. ( j  +o  2o ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
) )
Distinct variable groups:    A, j    j, L    j, N    P, j    U, j

Proof of Theorem prarloclem
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 prarloclem5 7441 . 2  |-  ( ( ( <. L ,  U >.  e.  P.  /\  A  e.  L )  /\  ( N  e.  N.  /\  P  e.  Q.  /\  1o  <N  N )  /\  ( A  +Q  ( [ <. N ,  1o >. ]  ~Q  .Q  P ) )  e.  U )  ->  E. x  e.  om  E. y  e. 
om  ( ( A +Q0  ( [ <. y ,  1o >. ] ~Q0 ·Q0  P )
)  e.  L  /\  ( A  +Q  ( [ <. ( ( y  +o  2o )  +o  x ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
) )
2 prarloclem4 7439 . . . 4  |-  ( ( ( <. L ,  U >.  e.  P.  /\  A  e.  L )  /\  P  e.  Q. )  ->  ( E. x  e.  om  E. y  e.  om  (
( A +Q0  ( [ <. y ,  1o >. ] ~Q0 ·Q0  P ) )  e.  L  /\  ( A  +Q  ( [ <. ( ( y  +o  2o )  +o  x ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
)  ->  E. j  e.  om  ( ( A +Q0  ( [ <. j ,  1o >. ] ~Q0 ·Q0  P )
)  e.  L  /\  ( A  +Q  ( [ <. ( j  +o  2o ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
) ) )
323ad2antr2 1153 . . 3  |-  ( ( ( <. L ,  U >.  e.  P.  /\  A  e.  L )  /\  ( N  e.  N.  /\  P  e.  Q.  /\  1o  <N  N ) )  ->  ( E. x  e.  om  E. y  e.  om  (
( A +Q0  ( [ <. y ,  1o >. ] ~Q0 ·Q0  P ) )  e.  L  /\  ( A  +Q  ( [ <. ( ( y  +o  2o )  +o  x ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
)  ->  E. j  e.  om  ( ( A +Q0  ( [ <. j ,  1o >. ] ~Q0 ·Q0  P )
)  e.  L  /\  ( A  +Q  ( [ <. ( j  +o  2o ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
) ) )
433adant3 1007 . 2  |-  ( ( ( <. L ,  U >.  e.  P.  /\  A  e.  L )  /\  ( N  e.  N.  /\  P  e.  Q.  /\  1o  <N  N )  /\  ( A  +Q  ( [ <. N ,  1o >. ]  ~Q  .Q  P ) )  e.  U )  ->  ( E. x  e.  om  E. y  e.  om  (
( A +Q0  ( [ <. y ,  1o >. ] ~Q0 ·Q0  P ) )  e.  L  /\  ( A  +Q  ( [ <. ( ( y  +o  2o )  +o  x ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
)  ->  E. j  e.  om  ( ( A +Q0  ( [ <. j ,  1o >. ] ~Q0 ·Q0  P )
)  e.  L  /\  ( A  +Q  ( [ <. ( j  +o  2o ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
) ) )
51, 4mpd 13 1  |-  ( ( ( <. L ,  U >.  e.  P.  /\  A  e.  L )  /\  ( N  e.  N.  /\  P  e.  Q.  /\  1o  <N  N )  /\  ( A  +Q  ( [ <. N ,  1o >. ]  ~Q  .Q  P ) )  e.  U )  ->  E. j  e.  om  ( ( A +Q0  ( [ <. j ,  1o >. ] ~Q0 ·Q0  P )
)  e.  L  /\  ( A  +Q  ( [ <. ( j  +o  2o ) ,  1o >. ]  ~Q  .Q  P
) )  e.  U
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 968    e. wcel 2136   E.wrex 2445   <.cop 3579   class class class wbr 3982   omcom 4567  (class class class)co 5842   1oc1o 6377   2oc2o 6378    +o coa 6381   [cec 6499   N.cnpi 7213    <N clti 7216    ~Q ceq 7220   Q.cnq 7221    +Q cplq 7223    .Q cmq 7224   ~Q0 ceq0 7227   +Q0 cplq0 7230   ·Q0 cmq0 7231   P.cnp 7232
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 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-eprel 4267  df-id 4271  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-1o 6384  df-2o 6385  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-pli 7246  df-mi 7247  df-lti 7248  df-plpq 7285  df-mpq 7286  df-enq 7288  df-nqqs 7289  df-plqqs 7290  df-mqqs 7291  df-ltnqqs 7294  df-enq0 7365  df-nq0 7366  df-0nq0 7367  df-plq0 7368  df-mq0 7369  df-inp 7407
This theorem is referenced by:  prarloc  7444
  Copyright terms: Public domain W3C validator