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

Theorem archrecpr 7884
Description: Archimedean principle for positive reals (reciprocal version). (Contributed by Jim Kingdon, 25-Nov-2020.)
Assertion
Ref Expression
archrecpr  |-  ( A  e.  P.  ->  E. j  e.  N.  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  A )
Distinct variable groups:    A, j    j,
l, u
Allowed substitution hints:    A( u, l)

Proof of Theorem archrecpr
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 prop 7695 . . . 4  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
2 prml 7697 . . . 4  |-  ( <.
( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  ->  E. x  e.  Q.  x  e.  ( 1st `  A ) )
31, 2syl 14 . . 3  |-  ( A  e.  P.  ->  E. x  e.  Q.  x  e.  ( 1st `  A ) )
4 archrecnq 7883 . . . . 5  |-  ( x  e.  Q.  ->  E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  x )
54ad2antrl 490 . . . 4  |-  ( ( A  e.  P.  /\  ( x  e.  Q.  /\  x  e.  ( 1st `  A ) ) )  ->  E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  x )
61ad2antrr 488 . . . . . 6  |-  ( ( ( A  e.  P.  /\  ( x  e.  Q.  /\  x  e.  ( 1st `  A ) ) )  /\  j  e.  N. )  ->  <. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P. )
7 simplrr 538 . . . . . 6  |-  ( ( ( A  e.  P.  /\  ( x  e.  Q.  /\  x  e.  ( 1st `  A ) ) )  /\  j  e.  N. )  ->  x  e.  ( 1st `  A ) )
8 prcdnql 7704 . . . . . 6  |-  ( (
<. ( 1st `  A
) ,  ( 2nd `  A ) >.  e.  P.  /\  x  e.  ( 1st `  A ) )  -> 
( ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  x  ->  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A
) ) )
96, 7, 8syl2anc 411 . . . . 5  |-  ( ( ( A  e.  P.  /\  ( x  e.  Q.  /\  x  e.  ( 1st `  A ) ) )  /\  j  e.  N. )  ->  ( ( *Q
`  [ <. j ,  1o >. ]  ~Q  )  <Q  x  ->  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A
) ) )
109reximdva 2634 . . . 4  |-  ( ( A  e.  P.  /\  ( x  e.  Q.  /\  x  e.  ( 1st `  A ) ) )  ->  ( E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  x  ->  E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A ) ) )
115, 10mpd 13 . . 3  |-  ( ( A  e.  P.  /\  ( x  e.  Q.  /\  x  e.  ( 1st `  A ) ) )  ->  E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A ) )
123, 11rexlimddv 2655 . 2  |-  ( A  e.  P.  ->  E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A
) )
13 nnnq 7642 . . . . . 6  |-  ( j  e.  N.  ->  [ <. j ,  1o >. ]  ~Q  e.  Q. )
14 recclnq 7612 . . . . . 6  |-  ( [
<. j ,  1o >. ]  ~Q  e.  Q.  ->  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  Q. )
1513, 14syl 14 . . . . 5  |-  ( j  e.  N.  ->  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  Q. )
1615adantl 277 . . . 4  |-  ( ( A  e.  P.  /\  j  e.  N. )  ->  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  Q. )
17 simpl 109 . . . 4  |-  ( ( A  e.  P.  /\  j  e.  N. )  ->  A  e.  P. )
18 nqprl 7771 . . . 4  |-  ( ( ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  Q.  /\  A  e.  P. )  ->  ( ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A
)  <->  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  A ) )
1916, 17, 18syl2anc 411 . . 3  |-  ( ( A  e.  P.  /\  j  e.  N. )  ->  ( ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A
)  <->  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  A ) )
2019rexbidva 2529 . 2  |-  ( A  e.  P.  ->  ( E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A )  <->  E. j  e.  N.  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  A ) )
2112, 20mpbid 147 1  |-  ( A  e.  P.  ->  E. j  e.  N.  <. { l  |  l  <Q  ( *Q `  [ <. j ,  1o >. ]  ~Q  ) } ,  { u  |  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  <Q  u } >.  <P  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2202   {cab 2217   E.wrex 2511   <.cop 3672   class class class wbr 4088   ` cfv 5326   1stc1st 6301   2ndc2nd 6302   1oc1o 6575   [cec 6700   N.cnpi 7492    ~Q ceq 7499   Q.cnq 7500   *Qcrq 7504    <Q cltq 7505   P.cnp 7511    <P cltp 7515
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-1o 6582  df-oadd 6586  df-omul 6587  df-er 6702  df-ec 6704  df-qs 6708  df-ni 7524  df-pli 7525  df-mi 7526  df-lti 7527  df-plpq 7564  df-mpq 7565  df-enq 7567  df-nqqs 7568  df-plqqs 7569  df-mqqs 7570  df-1nqqs 7571  df-rq 7572  df-ltnqqs 7573  df-inp 7686  df-iltp 7690
This theorem is referenced by:  caucvgprprlemlim  7931
  Copyright terms: Public domain W3C validator