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

Theorem archrecpr 7889
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 7700 . . . 4  |-  ( A  e.  P.  ->  <. ( 1st `  A ) ,  ( 2nd `  A
) >.  e.  P. )
2 prml 7702 . . . 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 7888 . . . . 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 7709 . . . . . 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 2633 . . . 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 2654 . 2  |-  ( A  e.  P.  ->  E. j  e.  N.  ( *Q `  [ <. j ,  1o >. ]  ~Q  )  e.  ( 1st `  A
) )
13 nnnq 7647 . . . . . 6  |-  ( j  e.  N.  ->  [ <. j ,  1o >. ]  ~Q  e.  Q. )
14 recclnq 7617 . . . . . 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 7776 . . . 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 2528 . 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 2201   {cab 2216   E.wrex 2510   <.cop 3673   class class class wbr 4089   ` cfv 5328   1stc1st 6306   2ndc2nd 6307   1oc1o 6580   [cec 6705   N.cnpi 7497    ~Q ceq 7504   Q.cnq 7505   *Qcrq 7509    <Q cltq 7510   P.cnp 7516    <P cltp 7520
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 2203  ax-14 2204  ax-ext 2212  ax-coll 4205  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-iinf 4688
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 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-reu 2516  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-iun 3973  df-br 4090  df-opab 4152  df-mpt 4153  df-tr 4189  df-eprel 4388  df-id 4392  df-po 4395  df-iso 4396  df-iord 4465  df-on 4467  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-res 4739  df-ima 4740  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-f1 5333  df-fo 5334  df-f1o 5335  df-fv 5336  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1st 6308  df-2nd 6309  df-recs 6476  df-irdg 6541  df-1o 6587  df-oadd 6591  df-omul 6592  df-er 6707  df-ec 6709  df-qs 6713  df-ni 7529  df-pli 7530  df-mi 7531  df-lti 7532  df-plpq 7569  df-mpq 7570  df-enq 7572  df-nqqs 7573  df-plqqs 7574  df-mqqs 7575  df-1nqqs 7576  df-rq 7577  df-ltnqqs 7578  df-inp 7691  df-iltp 7695
This theorem is referenced by:  caucvgprprlemlim  7936
  Copyright terms: Public domain W3C validator