P. 77 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 7601-7700   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	cauappcvgprlem2 7601*	Lemma for cauappcvgpr 7603. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 23-Jun-2020.)
|- ( ph -> F : Q. --> Q. )   &    |- ( ph -> A. p e. Q. A. q e. Q. ( ( F ` p ) <Q ( ( F ` q ) +Q ( p +Q q ) ) /\ ( F ` q ) <Q ( ( F ` p ) +Q ( p +Q q ) ) ) )   &    |- ( ph -> A. p e. Q. A <Q ( F ` p ) )   &    |- L = <. { l e. Q. | E. q e. Q. ( l +Q q ) <Q ( F ` q ) } , { u e. Q. | E. q e. Q. ( ( F ` q ) +Q q ) <Q u } >.   &    |- ( ph -> Q e. Q. )   &    |- ( ph -> R e. Q. )   =>    |- ( ph -> L <P <. { l | l <Q ( ( F ` Q ) +Q ( Q +Q R ) ) } , { u | ( ( F ` Q ) +Q ( Q +Q R ) ) <Q u } >. )
Theorem	cauappcvgprlemlim 7602*	Lemma for cauappcvgpr 7603. The putative limit is a limit. (Contributed by Jim Kingdon, 20-Jun-2020.)
|- ( ph -> F : Q. --> Q. )   &    |- ( ph -> A. p e. Q. A. q e. Q. ( ( F ` p ) <Q ( ( F ` q ) +Q ( p +Q q ) ) /\ ( F ` q ) <Q ( ( F ` p ) +Q ( p +Q q ) ) ) )   &    |- ( ph -> A. p e. Q. A <Q ( F ` p ) )   &    |- L = <. { l e. Q. | E. q e. Q. ( l +Q q ) <Q ( F ` q ) } , { u e. Q. | E. q e. Q. ( ( F ` q ) +Q q ) <Q u } >.   =>    |- ( ph -> A. q e. Q. A. r e. Q. ( <. { l | l <Q ( F ` q ) } , { u | ( F ` q ) <Q u } >. <P ( L +P. <. { l | l <Q ( q +Q r ) } , { u | ( q +Q r ) <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` q ) +Q ( q +Q r ) ) } , { u | ( ( F ` q ) +Q ( q +Q r ) ) <Q u } >. ) )
Theorem	cauappcvgpr 7603*	A Cauchy approximation has a limit. A Cauchy approximation, here F, is similar to a Cauchy sequence but is indexed by the desired tolerance (that is, how close together terms needs to be) rather than by natural numbers. This is basically Theorem 11.2.12 of [HoTT], p. (varies) with a few differences such as that we are proving the existence of a limit without anything about how fast it converges (that is, mere existence instead of existence, in HoTT terms), and that the codomain of F is Q. rather than P.. We also specify that every term needs to be larger than a fraction A, to avoid the case where we have positive terms which "converge" to zero (which is not a positive real). This proof (including its lemmas) is similar to the proofs of caucvgpr 7623 and caucvgprpr 7653 but is somewhat simpler, so reading this one first may help understanding the other two. (Contributed by Jim Kingdon, 19-Jun-2020.)
|- ( ph -> F : Q. --> Q. )   &    |- ( ph -> A. p e. Q. A. q e. Q. ( ( F ` p ) <Q ( ( F ` q ) +Q ( p +Q q ) ) /\ ( F ` q ) <Q ( ( F ` p ) +Q ( p +Q q ) ) ) )   &    |- ( ph -> A. p e. Q. A <Q ( F ` p ) )   =>    |- ( ph -> E. y e. P. A. q e. Q. A. r e. Q. ( <. { l | l <Q ( F ` q ) } , { u | ( F ` q ) <Q u } >. <P ( y +P. <. { l | l <Q ( q +Q r ) } , { u | ( q +Q r ) <Q u } >. ) /\ y <P <. { l | l <Q ( ( F ` q ) +Q ( q +Q r ) ) } , { u | ( ( F ` q ) +Q ( q +Q r ) ) <Q u } >. ) )
Theorem	archrecnq 7604*	Archimedean principle for fractions (reciprocal version). (Contributed by Jim Kingdon, 27-Sep-2020.)
|- ( A e. Q. -> E. j e. N. ( *Q ` [ <. j , 1o >. ] ~Q ) <Q A )
Theorem	archrecpr 7605*	Archimedean principle for positive reals (reciprocal version). (Contributed by Jim Kingdon, 25-Nov-2020.)
|- ( A e. P. -> E. j e. N. <. { l | l <Q ( *Q ` [ <. j , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. j , 1o >. ] ~Q ) <Q u } >. <P A )
Theorem	caucvgprlemk 7606	Lemma for caucvgpr 7623. Reciprocals of positive integers decrease as the positive integers increase. (Contributed by Jim Kingdon, 9-Oct-2020.)
|- ( ph -> J <N K )   &    |- ( ph -> ( *Q ` [ <. J , 1o >. ] ~Q ) <Q Q )   =>    |- ( ph -> ( *Q ` [ <. K , 1o >. ] ~Q ) <Q Q )
Theorem	caucvgprlemnkj 7607*	Lemma for caucvgpr 7623. Part of disjointness. (Contributed by Jim Kingdon, 23-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> K e. N. )   &    |- ( ph -> J e. N. )   &    |- ( ph -> S e. Q. )   =>    |- ( ph -> -. ( ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) <Q ( F ` K ) /\ ( ( F ` J ) +Q ( *Q ` [ <. J , 1o >. ] ~Q ) ) <Q S ) )
Theorem	caucvgprlemnbj 7608*	Lemma for caucvgpr 7623. Non-existence of two elements of the sequence which are too far from each other. (Contributed by Jim Kingdon, 18-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> B e. N. )   &    |- ( ph -> J e. N. )   =>    |- ( ph -> -. ( ( ( F ` B ) +Q ( *Q ` [ <. B , 1o >. ] ~Q ) ) +Q ( *Q ` [ <. J , 1o >. ] ~Q ) ) <Q ( F ` J ) )
Theorem	caucvgprlemm 7609*	Lemma for caucvgpr 7623. The putative limit is inhabited. (Contributed by Jim Kingdon, 27-Sep-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ph -> ( E. s e. Q. s e. ( 1st ` L ) /\ E. r e. Q. r e. ( 2nd ` L ) ) )
Theorem	caucvgprlemopl 7610*	Lemma for caucvgpr 7623. The lower cut of the putative limit is open. (Contributed by Jim Kingdon, 20-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ( ph /\ s e. ( 1st ` L ) ) -> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) )
Theorem	caucvgprlemlol 7611*	Lemma for caucvgpr 7623. The lower cut of the putative limit is lower. (Contributed by Jim Kingdon, 20-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ( ph /\ s <Q r /\ r e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
Theorem	caucvgprlemopu 7612*	Lemma for caucvgpr 7623. The upper cut of the putative limit is open. (Contributed by Jim Kingdon, 20-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ( ph /\ r e. ( 2nd ` L ) ) -> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) )
Theorem	caucvgprlemupu 7613*	Lemma for caucvgpr 7623. The upper cut of the putative limit is upper. (Contributed by Jim Kingdon, 20-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ( ph /\ s <Q r /\ s e. ( 2nd ` L ) ) -> r e. ( 2nd ` L ) )
Theorem	caucvgprlemrnd 7614*	Lemma for caucvgpr 7623. The putative limit is rounded. (Contributed by Jim Kingdon, 27-Sep-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ph -> ( A. s e. Q. ( s e. ( 1st ` L ) <-> E. r e. Q. ( s <Q r /\ r e. ( 1st ` L ) ) ) /\ A. r e. Q. ( r e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q r /\ s e. ( 2nd ` L ) ) ) ) )
Theorem	caucvgprlemdisj 7615*	Lemma for caucvgpr 7623. The putative limit is disjoint. (Contributed by Jim Kingdon, 27-Sep-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ph -> A. s e. Q. -. ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) )
Theorem	caucvgprlemloc 7616*	Lemma for caucvgpr 7623. The putative limit is located. (Contributed by Jim Kingdon, 27-Sep-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ph -> A. s e. Q. A. r e. Q. ( s <Q r -> ( s e. ( 1st ` L ) \/ r e. ( 2nd ` L ) ) ) )
Theorem	caucvgprlemcl 7617*	Lemma for caucvgpr 7623. The putative limit is a positive real. (Contributed by Jim Kingdon, 26-Sep-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ph -> L e. P. )
Theorem	caucvgprlemladdfu 7618*	Lemma for caucvgpr 7623. Adding S after embedding in positive reals, or adding it as a rational. (Contributed by Jim Kingdon, 9-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   &    |- ( ph -> S e. Q. )   =>    |- ( ph -> ( 2nd ` ( L +P. <. { l | l <Q S } , { u | S <Q u } >. ) ) C_ { u e. Q. | E. j e. N. ( ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) +Q S ) <Q u } )
Theorem	caucvgprlemladdrl 7619*	Lemma for caucvgpr 7623. Adding S after embedding in positive reals, or adding it as a rational. (Contributed by Jim Kingdon, 8-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   &    |- ( ph -> S e. Q. )   =>    |- ( ph -> { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( ( F ` j ) +Q S ) } C_ ( 1st ` ( L +P. <. { l | l <Q S } , { u | S <Q u } >. ) ) )
Theorem	caucvgprlem1 7620*	Lemma for caucvgpr 7623. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 3-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   &    |- ( ph -> Q e. Q. )   &    |- ( ph -> J <N K )   &    |- ( ph -> ( *Q ` [ <. J , 1o >. ] ~Q ) <Q Q )   =>    |- ( ph -> <. { l | l <Q ( F ` K ) } , { u | ( F ` K ) <Q u } >. <P ( L +P. <. { l | l <Q Q } , { u | Q <Q u } >. ) )
Theorem	caucvgprlem2 7621*	Lemma for caucvgpr 7623. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 3-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   &    |- ( ph -> Q e. Q. )   &    |- ( ph -> J <N K )   &    |- ( ph -> ( *Q ` [ <. J , 1o >. ] ~Q ) <Q Q )   =>    |- ( ph -> L <P <. { l | l <Q ( ( F ` K ) +Q Q ) } , { u | ( ( F ` K ) +Q Q ) <Q u } >. )
Theorem	caucvgprlemlim 7622*	Lemma for caucvgpr 7623. The putative limit is a limit. (Contributed by Jim Kingdon, 1-Oct-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   &    |- L = <. { l e. Q. | E. j e. N. ( l +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q ( F ` j ) } , { u e. Q. | E. j e. N. ( ( F ` j ) +Q ( *Q ` [ <. j , 1o >. ] ~Q ) ) <Q u } >.   =>    |- ( ph -> A. x e. Q. E. j e. N. A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( L +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ L <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )
Theorem	caucvgpr 7623*	A Cauchy sequence of positive fractions with a modulus of convergence converges to a positive real. This is basically Corollary 11.2.13 of [HoTT], p. (varies) (one key difference being that this is for positive reals rather than signed reals). Also, the HoTT book theorem has a modulus of convergence (that is, a rate of convergence) specified by (11.2.9) in HoTT whereas this theorem fixes the rate of convergence to say that all terms after the nth term must be within 1 / n of the nth term (it should later be able to prove versions of this theorem with a different fixed rate or a modulus of convergence supplied as a hypothesis). We also specify that every term needs to be larger than a fraction A, to avoid the case where we have positive terms which "converge" to zero (which is not a positive real). This proof (including its lemmas) is similar to the proofs of cauappcvgpr 7603 and caucvgprpr 7653. Reading cauappcvgpr 7603 first (the simplest of the three) might help understanding the other two. (Contributed by Jim Kingdon, 18-Jun-2020.)
|- ( ph -> F : N. --> Q. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <Q ( ( F ` k ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) /\ ( F ` k ) <Q ( ( F ` n ) +Q ( *Q ` [ <. n , 1o >. ] ~Q ) ) ) ) )   &    |- ( ph -> A. j e. N. A <Q ( F ` j ) )   =>    |- ( ph -> E. y e. P. A. x e. Q. E. j e. N. A. k e. N. ( j <N k -> ( <. { l | l <Q ( F ` k ) } , { u | ( F ` k ) <Q u } >. <P ( y +P. <. { l | l <Q x } , { u | x <Q u } >. ) /\ y <P <. { l | l <Q ( ( F ` k ) +Q x ) } , { u | ( ( F ` k ) +Q x ) <Q u } >. ) ) )
Theorem	caucvgprprlemk 7624*	Lemma for caucvgprpr 7653. Reciprocals of positive integers decrease as the positive integers increase. (Contributed by Jim Kingdon, 28-Nov-2020.)
|- ( ph -> J <N K )   &    |- ( ph -> <. { l | l <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q u } >. <P Q )   =>    |- ( ph -> <. { l | l <Q ( *Q ` [ <. K , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. K , 1o >. ] ~Q ) <Q u } >. <P Q )
Theorem	caucvgprprlemloccalc 7625*	Lemma for caucvgprpr 7653. Rearranging some expressions for caucvgprprlemloc 7644. (Contributed by Jim Kingdon, 8-Feb-2021.)
|- ( ph -> S <Q T )   &    |- ( ph -> Y e. Q. )   &    |- ( ph -> ( S +Q Y ) = T )   &    |- ( ph -> X e. Q. )   &    |- ( ph -> ( X +Q X ) <Q Y )   &    |- ( ph -> M e. N. )   &    |- ( ph -> ( *Q ` [ <. M , 1o >. ] ~Q ) <Q X )   =>    |- ( ph -> ( <. { l | l <Q ( S +Q ( *Q ` [ <. M , 1o >. ] ~Q ) ) } , { u | ( S +Q ( *Q ` [ <. M , 1o >. ] ~Q ) ) <Q u } >. +P. <. { l | l <Q ( *Q ` [ <. M , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. M , 1o >. ] ~Q ) <Q u } >. ) <P <. { l | l <Q T } , { u | T <Q u } >. )
Theorem	caucvgprprlemell 7626*	Lemma for caucvgprpr 7653. Membership in the lower cut of the putative limit. (Contributed by Jim Kingdon, 21-Jan-2021.)
|- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( X e. ( 1st ` L ) <-> ( X e. Q. /\ E. b e. N. <. { p | p <Q ( X +Q ( *Q ` [ <. b , 1o >. ] ~Q ) ) } , { q | ( X +Q ( *Q ` [ <. b , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` b ) ) )
Theorem	caucvgprprlemelu 7627*	Lemma for caucvgprpr 7653. Membership in the upper cut of the putative limit. (Contributed by Jim Kingdon, 28-Jan-2021.)
|- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( X e. ( 2nd ` L ) <-> ( X e. Q. /\ E. b e. N. ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q X } , { q | X <Q q } >. ) )
Theorem	caucvgprprlemcbv 7628*	Lemma for caucvgprpr 7653. Change bound variables in Cauchy condition. (Contributed by Jim Kingdon, 12-Feb-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   =>    |- ( ph -> A. a e. N. A. b e. N. ( a <N b -> ( ( F ` a ) <P ( ( F ` b ) +P. <. { l | l <Q ( *Q ` [ <. a , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. a , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` b ) <P ( ( F ` a ) +P. <. { l | l <Q ( *Q ` [ <. a , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. a , 1o >. ] ~Q ) <Q u } >. ) ) ) )
Theorem	caucvgprprlemval 7629*	Lemma for caucvgprpr 7653. Cauchy condition expressed in terms of classes. (Contributed by Jim Kingdon, 3-Mar-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   =>    |- ( ( ph /\ A <N B ) -> ( ( F ` A ) <P ( ( F ` B ) +P. <. { p | p <Q ( *Q ` [ <. A , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. A , 1o >. ] ~Q ) <Q q } >. ) /\ ( F ` B ) <P ( ( F ` A ) +P. <. { p | p <Q ( *Q ` [ <. A , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. A , 1o >. ] ~Q ) <Q q } >. ) ) )
Theorem	caucvgprprlemnkltj 7630*	Lemma for caucvgprpr 7653. Part of disjointness. (Contributed by Jim Kingdon, 12-Feb-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> K e. N. )   &    |- ( ph -> J e. N. )   &    |- ( ph -> S e. Q. )   =>    |- ( ( ph /\ K <N J ) -> -. ( <. { p | p <Q ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) } , { q | ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` K ) /\ ( ( F ` J ) +P. <. { p | p <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q S } , { q | S <Q q } >. ) )
Theorem	caucvgprprlemnkeqj 7631*	Lemma for caucvgprpr 7653. Part of disjointness. (Contributed by Jim Kingdon, 12-Feb-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> K e. N. )   &    |- ( ph -> J e. N. )   &    |- ( ph -> S e. Q. )   =>    |- ( ( ph /\ K = J ) -> -. ( <. { p | p <Q ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) } , { q | ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` K ) /\ ( ( F ` J ) +P. <. { p | p <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q S } , { q | S <Q q } >. ) )
Theorem	caucvgprprlemnjltk 7632*	Lemma for caucvgprpr 7653. Part of disjointness. (Contributed by Jim Kingdon, 12-Feb-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> K e. N. )   &    |- ( ph -> J e. N. )   &    |- ( ph -> S e. Q. )   =>    |- ( ( ph /\ J <N K ) -> -. ( <. { p | p <Q ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) } , { q | ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` K ) /\ ( ( F ` J ) +P. <. { p | p <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q S } , { q | S <Q q } >. ) )
Theorem	caucvgprprlemnkj 7633*	Lemma for caucvgprpr 7653. Part of disjointness. (Contributed by Jim Kingdon, 20-Jan-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> K e. N. )   &    |- ( ph -> J e. N. )   &    |- ( ph -> S e. Q. )   =>    |- ( ph -> -. ( <. { p | p <Q ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) } , { q | ( S +Q ( *Q ` [ <. K , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` K ) /\ ( ( F ` J ) +P. <. { p | p <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q S } , { q | S <Q q } >. ) )
Theorem	caucvgprprlemnbj 7634*	Lemma for caucvgprpr 7653. Non-existence of two elements of the sequence which are too far from each other. (Contributed by Jim Kingdon, 17-Jun-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> B e. N. )   &    |- ( ph -> J e. N. )   =>    |- ( ph -> -. ( ( ( F ` B ) +P. <. { l | l <Q ( *Q ` [ <. B , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. B , 1o >. ] ~Q ) <Q u } >. ) +P. <. { l | l <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q u } >. ) <P ( F ` J ) )
Theorem	caucvgprprlemml 7635*	Lemma for caucvgprpr 7653. The lower cut of the putative limit is inhabited. (Contributed by Jim Kingdon, 29-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> E. s e. Q. s e. ( 1st ` L ) )
Theorem	caucvgprprlemmu 7636*	Lemma for caucvgprpr 7653. The upper cut of the putative limit is inhabited. (Contributed by Jim Kingdon, 29-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> E. t e. Q. t e. ( 2nd ` L ) )
Theorem	caucvgprprlemm 7637*	Lemma for caucvgprpr 7653. The putative limit is inhabited. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> ( E. s e. Q. s e. ( 1st ` L ) /\ E. t e. Q. t e. ( 2nd ` L ) ) )
Theorem	caucvgprprlemopl 7638*	Lemma for caucvgprpr 7653. The lower cut of the putative limit is open. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ( ph /\ s e. ( 1st ` L ) ) -> E. t e. Q. ( s <Q t /\ t e. ( 1st ` L ) ) )
Theorem	caucvgprprlemlol 7639*	Lemma for caucvgprpr 7653. The lower cut of the putative limit is lower. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ( ph /\ s <Q t /\ t e. ( 1st ` L ) ) -> s e. ( 1st ` L ) )
Theorem	caucvgprprlemopu 7640*	Lemma for caucvgprpr 7653. The upper cut of the putative limit is open. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ( ph /\ t e. ( 2nd ` L ) ) -> E. s e. Q. ( s <Q t /\ s e. ( 2nd ` L ) ) )
Theorem	caucvgprprlemupu 7641*	Lemma for caucvgprpr 7653. The upper cut of the putative limit is upper. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ( ph /\ s <Q t /\ s e. ( 2nd ` L ) ) -> t e. ( 2nd ` L ) )
Theorem	caucvgprprlemrnd 7642*	Lemma for caucvgprpr 7653. The putative limit is rounded. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> ( A. s e. Q. ( s e. ( 1st ` L ) <-> E. t e. Q. ( s <Q t /\ t e. ( 1st ` L ) ) ) /\ A. t e. Q. ( t e. ( 2nd ` L ) <-> E. s e. Q. ( s <Q t /\ s e. ( 2nd ` L ) ) ) ) )
Theorem	caucvgprprlemdisj 7643*	Lemma for caucvgprpr 7653. The putative limit is disjoint. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> A. s e. Q. -. ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) )
Theorem	caucvgprprlemloc 7644*	Lemma for caucvgprpr 7653. The putative limit is located. (Contributed by Jim Kingdon, 21-Dec-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> A. s e. Q. A. t e. Q. ( s <Q t -> ( s e. ( 1st ` L ) \/ t e. ( 2nd ` L ) ) ) )
Theorem	caucvgprprlemcl 7645*	Lemma for caucvgprpr 7653. The putative limit is a positive real. (Contributed by Jim Kingdon, 21-Nov-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> L e. P. )
Theorem	caucvgprprlemclphr 7646*	Lemma for caucvgprpr 7653. The putative limit is a positive real. Like caucvgprprlemcl 7645 but without a disjoint variable condition between ph and r. (Contributed by Jim Kingdon, 19-Jun-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> L e. P. )
Theorem	caucvgprprlemexbt 7647*	Lemma for caucvgprpr 7653. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 16-Jun-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   &    |- ( ph -> Q e. Q. )   &    |- ( ph -> T e. P. )   &    |- ( ph -> ( L +P. <. { p | p <Q Q } , { q | Q <Q q } >. ) <P T )   =>    |- ( ph -> E. b e. N. ( ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) +P. <. { p | p <Q Q } , { q | Q <Q q } >. ) <P T )
Theorem	caucvgprprlemexb 7648*	Lemma for caucvgprpr 7653. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 15-Jun-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   &    |- ( ph -> Q e. P. )   &    |- ( ph -> R e. N. )   =>    |- ( ph -> ( ( ( L +P. Q ) +P. <. { p | p <Q ( *Q ` [ <. R , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. R , 1o >. ] ~Q ) <Q q } >. ) <P ( ( F ` R ) +P. Q ) -> E. b e. N. ( ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) +P. ( Q +P. <. { p | p <Q ( *Q ` [ <. R , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. R , 1o >. ] ~Q ) <Q q } >. ) ) <P ( ( F ` R ) +P. Q ) ) )
Theorem	caucvgprprlemaddq 7649*	Lemma for caucvgprpr 7653. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 5-Jun-2021.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   &    |- ( ph -> X e. P. )   &    |- ( ph -> Q e. P. )   &    |- ( ph -> E. r e. N. ( X +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P ( ( F ` r ) +P. Q ) )   =>    |- ( ph -> X <P ( L +P. Q ) )
Theorem	caucvgprprlem1 7650*	Lemma for caucvgprpr 7653. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 25-Nov-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   &    |- ( ph -> Q e. P. )   &    |- ( ph -> J <N K )   &    |- ( ph -> <. { l | l <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q u } >. <P Q )   =>    |- ( ph -> ( F ` K ) <P ( L +P. Q ) )
Theorem	caucvgprprlem2 7651*	Lemma for caucvgprpr 7653. Part of showing the putative limit to be a limit. (Contributed by Jim Kingdon, 25-Nov-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   &    |- ( ph -> Q e. P. )   &    |- ( ph -> J <N K )   &    |- ( ph -> <. { l | l <Q ( *Q ` [ <. J , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. J , 1o >. ] ~Q ) <Q u } >. <P Q )   =>    |- ( ph -> L <P ( ( F ` K ) +P. Q ) )
Theorem	caucvgprprlemlim 7652*	Lemma for caucvgprpr 7653. The putative limit is a limit. (Contributed by Jim Kingdon, 21-Nov-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   &    |- L = <. { l e. Q. | E. r e. N. <. { p | p <Q ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( l +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) } , { u e. Q. | E. r e. N. ( ( F ` r ) +P. <. { p | p <Q ( *Q ` [ <. r , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. r , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q u } , { q | u <Q q } >. } >.   =>    |- ( ph -> A. x e. P. E. j e. N. A. k e. N. ( j <N k -> ( ( F ` k ) <P ( L +P. x ) /\ L <P ( ( F ` k ) +P. x ) ) ) )
Theorem	caucvgprpr 7653*	A Cauchy sequence of positive reals with a modulus of convergence converges to a positive real. This is basically Corollary 11.2.13 of [HoTT], p. (varies) (one key difference being that this is for positive reals rather than signed reals). Also, the HoTT book theorem has a modulus of convergence (that is, a rate of convergence) specified by (11.2.9) in HoTT whereas this theorem fixes the rate of convergence to say that all terms after the nth term must be within 1 / n of the nth term (it should later be able to prove versions of this theorem with a different fixed rate or a modulus of convergence supplied as a hypothesis). We also specify that every term needs to be larger than a given value A, to avoid the case where we have positive terms which "converge" to zero (which is not a positive real). This is similar to caucvgpr 7623 except that values of the sequence are positive reals rather than positive fractions. Reading that proof first (or cauappcvgpr 7603) might help in understanding this one, as they are slightly simpler but similarly structured. (Contributed by Jim Kingdon, 14-Nov-2020.)
|- ( ph -> F : N. --> P. )   &    |- ( ph -> A. n e. N. A. k e. N. ( n <N k -> ( ( F ` n ) <P ( ( F ` k ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) /\ ( F ` k ) <P ( ( F ` n ) +P. <. { l | l <Q ( *Q ` [ <. n , 1o >. ] ~Q ) } , { u | ( *Q ` [ <. n , 1o >. ] ~Q ) <Q u } >. ) ) ) )   &    |- ( ph -> A. m e. N. A <P ( F ` m ) )   =>    |- ( ph -> E. y e. P. A. x e. P. E. j e. N. A. k e. N. ( j <N k -> ( ( F ` k ) <P ( y +P. x ) /\ y <P ( ( F ` k ) +P. x ) ) ) )
Theorem	suplocexprlemell 7654*	Lemma for suplocexpr 7666. Membership in the lower cut of the putative supremum. (Contributed by Jim Kingdon, 9-Jan-2024.)
|- ( B e. U. ( 1st " A ) <-> E. x e. A B e. ( 1st ` x ) )
Theorem	suplocexprlem2b 7655	Lemma for suplocexpr 7666. Expression for the lower cut of the putative supremum. (Contributed by Jim Kingdon, 9-Jan-2024.)
|- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( A C_ P. -> ( 2nd ` B ) = { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } )
Theorem	suplocexprlemss 7656*	Lemma for suplocexpr 7666. A is a set of positive reals. (Contributed by Jim Kingdon, 7-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   =>    |- ( ph -> A C_ P. )
Theorem	suplocexprlemml 7657*	Lemma for suplocexpr 7666. The lower cut of the putative supremum is inhabited. (Contributed by Jim Kingdon, 7-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   =>    |- ( ph -> E. s e. Q. s e. U. ( 1st " A ) )
Theorem	suplocexprlemrl 7658*	Lemma for suplocexpr 7666. The lower cut of the putative supremum is rounded. (Contributed by Jim Kingdon, 9-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   =>    |- ( ph -> A. q e. Q. ( q e. U. ( 1st " A ) <-> E. r e. Q. ( q <Q r /\ r e. U. ( 1st " A ) ) ) )
Theorem	suplocexprlemmu 7659*	Lemma for suplocexpr 7666. The upper cut of the putative supremum is inhabited. (Contributed by Jim Kingdon, 7-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> E. s e. Q. s e. ( 2nd ` B ) )
Theorem	suplocexprlemru 7660*	Lemma for suplocexpr 7666. The upper cut of the putative supremum is rounded. (Contributed by Jim Kingdon, 9-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> A. r e. Q. ( r e. ( 2nd ` B ) <-> E. q e. Q. ( q <Q r /\ q e. ( 2nd ` B ) ) ) )
Theorem	suplocexprlemdisj 7661*	Lemma for suplocexpr 7666. The putative supremum is disjoint. (Contributed by Jim Kingdon, 9-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> A. q e. Q. -. ( q e. U. ( 1st " A ) /\ q e. ( 2nd ` B ) ) )
Theorem	suplocexprlemloc 7662*	Lemma for suplocexpr 7666. The putative supremum is located. (Contributed by Jim Kingdon, 9-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> A. q e. Q. A. r e. Q. ( q <Q r -> ( q e. U. ( 1st " A ) \/ r e. ( 2nd ` B ) ) ) )
Theorem	suplocexprlemex 7663*	Lemma for suplocexpr 7666. The putative supremum is a positive real. (Contributed by Jim Kingdon, 7-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> B e. P. )
Theorem	suplocexprlemub 7664*	Lemma for suplocexpr 7666. The putative supremum is an upper bound. (Contributed by Jim Kingdon, 14-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> A. y e. A -. B <P y )
Theorem	suplocexprlemlub 7665*	Lemma for suplocexpr 7666. The putative supremum is a least upper bound. (Contributed by Jim Kingdon, 14-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   &    |- B = <. U. ( 1st " A ) , { u e. Q. | E. w e. |^| ( 2nd " A ) w <Q u } >.   =>    |- ( ph -> ( y <P B -> E. z e. A y <P z ) )
Theorem	suplocexpr 7666*	An inhabited, bounded-above, located set of positive reals has a supremum. (Contributed by Jim Kingdon, 7-Jan-2024.)
|- ( ph -> E. x x e. A )   &    |- ( ph -> E. x e. P. A. y e. A y <P x )   &    |- ( ph -> A. x e. P. A. y e. P. ( x <P y -> ( E. z e. A x <P z \/ A. z e. A z <P y ) ) )   =>    |- ( ph -> E. x e. P. ( A. y e. A -. x <P y /\ A. y e. P. ( y <P x -> E. z e. A y <P z ) ) )
Definition	df-enr 7667*	Define equivalence relation for signed reals. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.1 of [Gleason] p. 126. (Contributed by NM, 25-Jul-1995.)
|- ~R = { <. x , y >. | ( ( x e. ( P. X. P. ) /\ y e. ( P. X. P. ) ) /\ E. z E. w E. v E. u ( ( x = <. z , w >. /\ y = <. v , u >. ) /\ ( z +P. u ) = ( w +P. v ) ) ) }
Definition	df-nr 7668	Define class of signed reals. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.2 of [Gleason] p. 126. (Contributed by NM, 25-Jul-1995.)
|- R. = ( ( P. X. P. ) /. ~R )
Definition	df-plr 7669*	Define addition on signed reals. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.3 of [Gleason] p. 126. (Contributed by NM, 25-Aug-1995.)
|- +R = { <. <. x , y >. , z >. | ( ( x e. R. /\ y e. R. ) /\ E. w E. v E. u E. f ( ( x = [ <. w , v >. ] ~R /\ y = [ <. u , f >. ] ~R ) /\ z = [ <. ( w +P. u ) , ( v +P. f ) >. ] ~R ) ) }
Definition	df-mr 7670*	Define multiplication on signed reals. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.3 of [Gleason] p. 126. (Contributed by NM, 25-Aug-1995.)
|- .R = { <. <. x , y >. , z >. | ( ( x e. R. /\ y e. R. ) /\ E. w E. v E. u E. f ( ( x = [ <. w , v >. ] ~R /\ y = [ <. u , f >. ] ~R ) /\ z = [ <. ( ( w .P. u ) +P. ( v .P. f ) ) , ( ( w .P. f ) +P. ( v .P. u ) ) >. ] ~R ) ) }
Definition	df-ltr 7671*	Define ordering relation on signed reals. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.4 of [Gleason] p. 127. (Contributed by NM, 14-Feb-1996.)
|- <R = { <. x , y >. | ( ( x e. R. /\ y e. R. ) /\ E. z E. w E. v E. u ( ( x = [ <. z , w >. ] ~R /\ y = [ <. v , u >. ] ~R ) /\ ( z +P. u ) <P ( w +P. v ) ) ) }
Definition	df-0r 7672	Define signed real constant 0. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.2 of [Gleason] p. 126. (Contributed by NM, 9-Aug-1995.)
|- 0R = [ <. 1P , 1P >. ] ~R
Definition	df-1r 7673	Define signed real constant 1. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. From Proposition 9-4.2 of [Gleason] p. 126. (Contributed by NM, 9-Aug-1995.)
|- 1R = [ <. ( 1P +P. 1P ) , 1P >. ] ~R
Definition	df-m1r 7674	Define signed real constant -1. This is a "temporary" set used in the construction of complex numbers, and is intended to be used only by the construction. (Contributed by NM, 9-Aug-1995.)
|- -1R = [ <. 1P , ( 1P +P. 1P ) >. ] ~R
Theorem	enrbreq 7675	Equivalence relation for signed reals in terms of positive reals. (Contributed by NM, 3-Sep-1995.)
|- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( <. A , B >. ~R <. C , D >. <-> ( A +P. D ) = ( B +P. C ) ) )
Theorem	enrer 7676	The equivalence relation for signed reals is an equivalence relation. Proposition 9-4.1 of [Gleason] p. 126. (Contributed by NM, 3-Sep-1995.) (Revised by Mario Carneiro, 6-Jul-2015.)
|- ~R Er ( P. X. P. )
Theorem	enreceq 7677	Equivalence class equality of positive fractions in terms of positive integers. (Contributed by NM, 29-Nov-1995.)
|- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( [ <. A , B >. ] ~R = [ <. C , D >. ] ~R <-> ( A +P. D ) = ( B +P. C ) ) )
Theorem	enrex 7678	The equivalence relation for signed reals exists. (Contributed by NM, 25-Jul-1995.)
|- ~R e. _V
Theorem	ltrelsr 7679	Signed real 'less than' is a relation on signed reals. (Contributed by NM, 14-Feb-1996.)
|- <R C_ ( R. X. R. )
Theorem	addcmpblnr 7680	Lemma showing compatibility of addition. (Contributed by NM, 3-Sep-1995.)
|- ( ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) /\ ( ( F e. P. /\ G e. P. ) /\ ( R e. P. /\ S e. P. ) ) ) -> ( ( ( A +P. D ) = ( B +P. C ) /\ ( F +P. S ) = ( G +P. R ) ) -> <. ( A +P. F ) , ( B +P. G ) >. ~R <. ( C +P. R ) , ( D +P. S ) >. ) )
Theorem	mulcmpblnrlemg 7681	Lemma used in lemma showing compatibility of multiplication. (Contributed by Jim Kingdon, 1-Jan-2020.)
|- ( ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) /\ ( ( F e. P. /\ G e. P. ) /\ ( R e. P. /\ S e. P. ) ) ) -> ( ( ( A +P. D ) = ( B +P. C ) /\ ( F +P. S ) = ( G +P. R ) ) -> ( ( D .P. F ) +P. ( ( ( A .P. F ) +P. ( B .P. G ) ) +P. ( ( C .P. S ) +P. ( D .P. R ) ) ) ) = ( ( D .P. F ) +P. ( ( ( A .P. G ) +P. ( B .P. F ) ) +P. ( ( C .P. R ) +P. ( D .P. S ) ) ) ) ) )
Theorem	mulcmpblnr 7682	Lemma showing compatibility of multiplication. (Contributed by NM, 5-Sep-1995.)
|- ( ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) /\ ( ( F e. P. /\ G e. P. ) /\ ( R e. P. /\ S e. P. ) ) ) -> ( ( ( A +P. D ) = ( B +P. C ) /\ ( F +P. S ) = ( G +P. R ) ) -> <. ( ( A .P. F ) +P. ( B .P. G ) ) , ( ( A .P. G ) +P. ( B .P. F ) ) >. ~R <. ( ( C .P. R ) +P. ( D .P. S ) ) , ( ( C .P. S ) +P. ( D .P. R ) ) >. ) )
Theorem	prsrlem1 7683*	Decomposing signed reals into positive reals. Lemma for addsrpr 7686 and mulsrpr 7687. (Contributed by Jim Kingdon, 30-Dec-2019.)
|- ( ( ( A e. ( ( P. X. P. ) /. ~R ) /\ B e. ( ( P. X. P. ) /. ~R ) ) /\ ( ( A = [ <. w , v >. ] ~R /\ B = [ <. u , t >. ] ~R ) /\ ( A = [ <. s , f >. ] ~R /\ B = [ <. g , h >. ] ~R ) ) ) -> ( ( ( ( w e. P. /\ v e. P. ) /\ ( s e. P. /\ f e. P. ) ) /\ ( ( u e. P. /\ t e. P. ) /\ ( g e. P. /\ h e. P. ) ) ) /\ ( ( w +P. f ) = ( v +P. s ) /\ ( u +P. h ) = ( t +P. g ) ) ) )
Theorem	addsrmo 7684*	There is at most one result from adding signed reals. (Contributed by Jim Kingdon, 30-Dec-2019.)
|- ( ( A e. ( ( P. X. P. ) /. ~R ) /\ B e. ( ( P. X. P. ) /. ~R ) ) -> E* z E. w E. v E. u E. t ( ( A = [ <. w , v >. ] ~R /\ B = [ <. u , t >. ] ~R ) /\ z = [ <. ( w +P. u ) , ( v +P. t ) >. ] ~R ) )
Theorem	mulsrmo 7685*	There is at most one result from multiplying signed reals. (Contributed by Jim Kingdon, 30-Dec-2019.)
|- ( ( A e. ( ( P. X. P. ) /. ~R ) /\ B e. ( ( P. X. P. ) /. ~R ) ) -> E* z E. w E. v E. u E. t ( ( A = [ <. w , v >. ] ~R /\ B = [ <. u , t >. ] ~R ) /\ z = [ <. ( ( w .P. u ) +P. ( v .P. t ) ) , ( ( w .P. t ) +P. ( v .P. u ) ) >. ] ~R ) )
Theorem	addsrpr 7686	Addition of signed reals in terms of positive reals. (Contributed by NM, 3-Sep-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
|- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( [ <. A , B >. ] ~R +R [ <. C , D >. ] ~R ) = [ <. ( A +P. C ) , ( B +P. D ) >. ] ~R )
Theorem	mulsrpr 7687	Multiplication of signed reals in terms of positive reals. (Contributed by NM, 3-Sep-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
|- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( [ <. A , B >. ] ~R .R [ <. C , D >. ] ~R ) = [ <. ( ( A .P. C ) +P. ( B .P. D ) ) , ( ( A .P. D ) +P. ( B .P. C ) ) >. ] ~R )
Theorem	ltsrprg 7688	Ordering of signed reals in terms of positive reals. (Contributed by Jim Kingdon, 2-Jan-2019.)
|- ( ( ( A e. P. /\ B e. P. ) /\ ( C e. P. /\ D e. P. ) ) -> ( [ <. A , B >. ] ~R <R [ <. C , D >. ] ~R <-> ( A +P. D ) <P ( B +P. C ) ) )
Theorem	gt0srpr 7689	Greater than zero in terms of positive reals. (Contributed by NM, 13-May-1996.)
|- ( 0R <R [ <. A , B >. ] ~R <-> B <P A )
Theorem	0nsr 7690	The empty set is not a signed real. (Contributed by NM, 25-Aug-1995.) (Revised by Mario Carneiro, 10-Jul-2014.)
|- -. (/) e. R.
Theorem	0r 7691	The constant 0R is a signed real. (Contributed by NM, 9-Aug-1995.)
|- 0R e. R.
Theorem	1sr 7692	The constant 1R is a signed real. (Contributed by NM, 9-Aug-1995.)
|- 1R e. R.
Theorem	m1r 7693	The constant -1R is a signed real. (Contributed by NM, 9-Aug-1995.)
|- -1R e. R.
Theorem	addclsr 7694	Closure of addition on signed reals. (Contributed by NM, 25-Jul-1995.)
|- ( ( A e. R. /\ B e. R. ) -> ( A +R B ) e. R. )
Theorem	mulclsr 7695	Closure of multiplication on signed reals. (Contributed by NM, 10-Aug-1995.)
|- ( ( A e. R. /\ B e. R. ) -> ( A .R B ) e. R. )
Theorem	addcomsrg 7696	Addition of signed reals is commutative. (Contributed by Jim Kingdon, 3-Jan-2020.)
|- ( ( A e. R. /\ B e. R. ) -> ( A +R B ) = ( B +R A ) )
Theorem	addasssrg 7697	Addition of signed reals is associative. (Contributed by Jim Kingdon, 3-Jan-2020.)
|- ( ( A e. R. /\ B e. R. /\ C e. R. ) -> ( ( A +R B ) +R C ) = ( A +R ( B +R C ) ) )
Theorem	mulcomsrg 7698	Multiplication of signed reals is commutative. (Contributed by Jim Kingdon, 3-Jan-2020.)
|- ( ( A e. R. /\ B e. R. ) -> ( A .R B ) = ( B .R A ) )
Theorem	mulasssrg 7699	Multiplication of signed reals is associative. (Contributed by Jim Kingdon, 3-Jan-2020.)
|- ( ( A e. R. /\ B e. R. /\ C e. R. ) -> ( ( A .R B ) .R C ) = ( A .R ( B .R C ) ) )
Theorem	distrsrg 7700	Multiplication of signed reals is distributive. (Contributed by Jim Kingdon, 4-Jan-2020.)
|- ( ( A e. R. /\ B e. R. /\ C e. R. ) -> ( A .R ( B +R C ) ) = ( ( A .R B ) +R ( A .R C ) ) )