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

Theorem prarloclem 7649
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 7648 . 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 7646 . . . 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 2178   E.wrex 2487   <.cop 3646   class class class wbr 4059   omcom 4656  (class class class)co 5967   1oc1o 6518   2oc2o 6519    +o coa 6522   [cec 6641   N.cnpi 7420    <N clti 7423    ~Q ceq 7427   Q.cnq 7428    +Q cplq 7430    .Q cmq 7431   ~Q0 ceq0 7434   +Q0 cplq0 7437   ·Q0 cmq0 7438   P.cnp 7439
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654
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 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-eprel 4354  df-id 4358  df-iord 4431  df-on 4433  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-irdg 6479  df-1o 6525  df-2o 6526  df-oadd 6529  df-omul 6530  df-er 6643  df-ec 6645  df-qs 6649  df-ni 7452  df-pli 7453  df-mi 7454  df-lti 7455  df-plpq 7492  df-mpq 7493  df-enq 7495  df-nqqs 7496  df-plqqs 7497  df-mqqs 7498  df-ltnqqs 7501  df-enq0 7572  df-nq0 7573  df-0nq0 7574  df-plq0 7575  df-mq0 7576  df-inp 7614
This theorem is referenced by:  prarloc  7651
  Copyright terms: Public domain W3C validator