Theorem archrecpr 7984

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.

Step	Hyp	Ref	Expression
1		prop 7795	. . . 4 |- ( A e. P. -> <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. )
2		prml 7797	. . . 4 |- ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. -> E. x e. Q. x e. ( 1st ` A ) )
3	1, 2	syl 14	. . 3 |- ( A e. P. -> E. x e. Q. x e. ( 1st ` A ) )
4		archrecnq 7983	. . . . 5 |- ( x e. Q. -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x )
5	4	ad2antrl 490	. . . 4 |- ( ( A e. P. /\ ( x e. Q. /\ x e. ( 1st ` A ) ) ) -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x )
6	1	ad2antrr 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 7804	. . . . . 6 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ x e. ( 1st ` A ) ) -> ( ( *Q ` [ <. j , 1o >. ] ~Q ) <Q x -> ( *Q ` [ <. j , 1o >. ] ~Q ) e. ( 1st ` A ) ) )
9	6, 7, 8	syl2anc 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 ) ) )
10	9	reximdva 2646	. . . 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 ) ) )
11	5, 10	mpd 13	. . 3 |- ( ( A e. P. /\ ( x e. Q. /\ x e. ( 1st ` A ) ) ) -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) e. ( 1st ` A ) )
12	3, 11	rexlimddv 2667	. 2 |- ( A e. P. -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) e. ( 1st ` A ) )
13		nnnq 7742	. . . . . 6 |- ( j e. N. -> [ <. j , 1o >. ] ~Q e. Q. )
14		recclnq 7712	. . . . . 6 |- ( [ <. j , 1o >. ] ~Q e. Q. -> ( *Q ` [ <. j , 1o >. ] ~Q ) e. Q. )
15	13, 14	syl 14	. . . . 5 |- ( j e. N. -> ( *Q ` [ <. j , 1o >. ] ~Q ) e. Q. )
16	15	adantl 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 7871	. . . 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 ) )
19	16, 17, 18	syl2anc 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 ) )
20	19	rexbidva 2541	. 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 ) )
21	12, 20	mpbid 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 )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   e. wcel 2205   {cab 2220   E.wrex 2523   <.cop 3694   class class class wbr 4111   ` cfv 5354   1stc1st 6334   2ndc2nd 6335   1oc1o 6642   [cec 6767   N.cnpi 7592   ~Q ceq 7599   Q.cnq 7600   *Qcrq 7604   <Q cltq 7605   P.cnp 7611   <P cltp 7615

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712

This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-eprel 4412  df-id 4416  df-po 4419  df-iso 4420  df-iord 4489  df-on 4491  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-1o 6649  df-oadd 6653  df-omul 6654  df-er 6769  df-ec 6771  df-qs 6775  df-ni 7624  df-pli 7625  df-mi 7626  df-lti 7627  df-plpq 7664  df-mpq 7665  df-enq 7667  df-nqqs 7668  df-plqqs 7669  df-mqqs 7670  df-1nqqs 7671  df-rq 7672  df-ltnqqs 7673  df-inp 7786  df-iltp 7790

This theorem is referenced by:  caucvgprprlemlim  8031