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

Theorem prarloclem 7616
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 7615 . 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 7613 . . . 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 1166 . . 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 1020 . 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 104    /\ w3a 981    e. wcel 2176   E.wrex 2485   <.cop 3636   class class class wbr 4045   omcom 4639  (class class class)co 5946   1oc1o 6497   2oc2o 6498    +o coa 6501   [cec 6620   N.cnpi 7387    <N clti 7390    ~Q ceq 7394   Q.cnq 7395    +Q cplq 7397    .Q cmq 7398   ~Q0 ceq0 7401   +Q0 cplq0 7404   ·Q0 cmq0 7405   P.cnp 7406
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4160  ax-sep 4163  ax-nul 4171  ax-pow 4219  ax-pr 4254  ax-un 4481  ax-setind 4586  ax-iinf 4637
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4046  df-opab 4107  df-mpt 4108  df-tr 4144  df-eprel 4337  df-id 4341  df-iord 4414  df-on 4416  df-suc 4419  df-iom 4640  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-rn 4687  df-res 4688  df-ima 4689  df-iota 5233  df-fun 5274  df-fn 5275  df-f 5276  df-f1 5277  df-fo 5278  df-f1o 5279  df-fv 5280  df-ov 5949  df-oprab 5950  df-mpo 5951  df-1st 6228  df-2nd 6229  df-recs 6393  df-irdg 6458  df-1o 6504  df-2o 6505  df-oadd 6508  df-omul 6509  df-er 6622  df-ec 6624  df-qs 6628  df-ni 7419  df-pli 7420  df-mi 7421  df-lti 7422  df-plpq 7459  df-mpq 7460  df-enq 7462  df-nqqs 7463  df-plqqs 7464  df-mqqs 7465  df-ltnqqs 7468  df-enq0 7539  df-nq0 7540  df-0nq0 7541  df-plq0 7542  df-mq0 7543  df-inp 7581
This theorem is referenced by:  prarloc  7618
  Copyright terms: Public domain W3C validator