Theorem caucvgprprlemdisj 8069

Description: Lemma for caucvgprpr 8079. The putative limit is disjoint. (Contributed by Jim Kingdon, 21-Dec-2020.)

Hypotheses

Ref	Expression
caucvgprpr.f	|- ( ph -> F : N. --> P. )
caucvgprpr.cau	|- ( 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 } >. ) ) ) )
caucvgprpr.bnd	|- ( ph -> A. m e. N. A <P ( F ` m ) )
caucvgprpr.lim	|- 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 } >. } >.

Assertion

Ref	Expression
caucvgprprlemdisj	|- ( ph -> A. s e. Q. -. ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) )

Distinct variable groups:   A, m   m, F   k, F, n, l   F, r, l   u, F, r   k, L   k, p, r, s   ph, r, s   k, q, r, s   p, l, s, q   u, p, s, q   u, n   n, l, k   u, k

Allowed substitution hints:   ph( u, k, m, n, q, p, l)   A( u, k, n, s, r, q, p, l)   F( s, q, p)   L( u, m, n, s, r, q, p, l)

Proof of Theorem caucvgprprlemdisj

Dummy variables a b are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		caucvgprpr.lim	. . . . . . . . 9 |- 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 } >. } >.
2	1	caucvgprprlemell 8052	. . . . . . . 8 |- ( s e. ( 1st ` L ) <-> ( s e. Q. /\ E. a e. N. <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) ) )
3	2	simprbi 275	. . . . . . 7 |- ( s e. ( 1st ` L ) -> E. a e. N. <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) )
4	1	caucvgprprlemelu 8053	. . . . . . . 8 |- ( s e. ( 2nd ` L ) <-> ( s 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 s } , { q | s <Q q } >. ) )
5	4	simprbi 275	. . . . . . 7 |- ( s e. ( 2nd ` L ) -> 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 s } , { q | s <Q q } >. )
6	3, 5	anim12i 338	. . . . . 6 |- ( ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) -> ( E. a e. N. <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ 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 s } , { q | s <Q q } >. ) )
7		reeanv 2721	. . . . . 6 |- ( E. a e. N. E. b e. N. ( <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) <-> ( E. a e. N. <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ 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 s } , { q | s <Q q } >. ) )
8	6, 7	sylibr 134	. . . . 5 |- ( ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) -> E. a e. N. E. b e. N. ( <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) )
9	8	adantl 277	. . . 4 |- ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) -> E. a e. N. E. b e. N. ( <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) )
10		caucvgprpr.f	. . . . . . . 8 |- ( ph -> F : N. --> P. )
11	10	ad2antrr 492	. . . . . . 7 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> F : N. --> P. )
12		caucvgprpr.cau	. . . . . . . 8 |- ( 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 } >. ) ) ) )
13	12	ad2antrr 492	. . . . . . 7 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> 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 } >. ) ) ) )
14		simprl 535	. . . . . . 7 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> a e. N. )
15		simprr 537	. . . . . . 7 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> b e. N. )
16	1	caucvgprprlemell 8052	. . . . . . . . . 10 |- ( s e. ( 1st ` L ) <-> ( s e. Q. /\ E. r e. N. <. { p | p <Q ( s +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. r , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` r ) ) )
17	16	simplbi 274	. . . . . . . . 9 |- ( s e. ( 1st ` L ) -> s e. Q. )
18	17	ad2antrl 494	. . . . . . . 8 |- ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) -> s e. Q. )
19	18	adantr 276	. . . . . . 7 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> s e. Q. )
20	11, 13, 14, 15, 19	caucvgprprlemnkj 8059	. . . . . 6 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> -. ( <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) )
21	20	pm2.21d 628	. . . . 5 |- ( ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) /\ ( a e. N. /\ b e. N. ) ) -> ( ( <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) -> F. ) )
22	21	rexlimdvva 2676	. . . 4 |- ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) -> ( E. a e. N. E. b e. N. ( <. { p | p <Q ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) } , { q | ( s +Q ( *Q ` [ <. a , 1o >. ] ~Q ) ) <Q q } >. <P ( F ` a ) /\ ( ( F ` b ) +P. <. { p | p <Q ( *Q ` [ <. b , 1o >. ] ~Q ) } , { q | ( *Q ` [ <. b , 1o >. ] ~Q ) <Q q } >. ) <P <. { p | p <Q s } , { q | s <Q q } >. ) -> F. ) )
23	9, 22	mpd 13	. . 3 |- ( ( ph /\ ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) ) -> F. )
24	23	inegd 1421	. 2 |- ( ph -> -. ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) )
25	24	ralrimivw 2624	1 |- ( ph -> A. s e. Q. -. ( s e. ( 1st ` L ) /\ s e. ( 2nd ` L ) ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   = wceq 1402   F. wfal 1407   e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   {crab 2532   <.cop 3712   class class class wbr 4130   -->wf 5373   ` cfv 5377  (class class class)co 6085   1stc1st 6372   2ndc2nd 6373   1oc1o 6680   [cec 6805   N.cnpi 7639   <N clti 7642   ~Q ceq 7646   Q.cnq 7647   +Q cplq 7649   *Qcrq 7651   <Q cltq 7652   P.cnp 7658   +P. cpp 7660   <P cltp 7662

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-2o 6688  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-plpq 7711  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720  df-enq0 7791  df-nq0 7792  df-0nq0 7793  df-plq0 7794  df-mq0 7795  df-inp 7833  df-iplp 7835  df-iltp 7837

This theorem is used by:  caucvgprprlemcl  8071