Theorem nqprl 7924

Description: Comparing a fraction to a real can be done by whether it is an element of the lower cut, or by <P. (Contributed by Jim Kingdon, 8-Jul-2020.)

Assertion

Ref	Expression
nqprl	|- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 1st ` B ) <-> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )

Distinct variable group:   A, l, u

Allowed substitution hints:   B( u, l)

Proof of Theorem nqprl

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7848	. . . . . 6 |- ( B e. P. -> <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. )
2		prnmaxl 7861	. . . . . 6 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ A e. ( 1st ` B ) ) -> E. x e. ( 1st ` B ) A <Q x )
3	1, 2	sylan 283	. . . . 5 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> E. x e. ( 1st ` B ) A <Q x )
4		elprnql 7854	. . . . . . . . . 10 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ x e. ( 1st ` B ) ) -> x e. Q. )
5	1, 4	sylan 283	. . . . . . . . 9 |- ( ( B e. P. /\ x e. ( 1st ` B ) ) -> x e. Q. )
6	5	ad2ant2r 513	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> x e. Q. )
7		vex 2824	. . . . . . . . . . . 12 |- x e. _V
8		breq2 4135	. . . . . . . . . . . 12 |- ( u = x -> ( A <Q u <-> A <Q x ) )
9	7, 8	elab 2970	. . . . . . . . . . 11 |- ( x e. { u | A <Q u } <-> A <Q x )
10	9	biimpri 133	. . . . . . . . . 10 |- ( A <Q x -> x e. { u | A <Q u } )
11		ltnqex 7922	. . . . . . . . . . . 12 |- { l | l <Q A } e. _V
12		gtnqex 7923	. . . . . . . . . . . 12 |- { u | A <Q u } e. _V
13	11, 12	op2nd 6385	. . . . . . . . . . 11 |- ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) = { u | A <Q u }
14	13	eleq2i 2305	. . . . . . . . . 10 |- ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) <-> x e. { u | A <Q u } )
15	10, 14	sylibr 134	. . . . . . . . 9 |- ( A <Q x -> x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) )
16	15	ad2antll 495	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) )
17		simprl 535	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> x e. ( 1st ` B ) )
18		19.8a 1643	. . . . . . . 8 |- ( ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) -> E. x ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
19	6, 16, 17, 18	syl12anc 1276	. . . . . . 7 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> E. x ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
20		df-rex 2534	. . . . . . 7 |- ( E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) <-> E. x ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
21	19, 20	sylibr 134	. . . . . 6 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) )
22		elprnql 7854	. . . . . . . . 9 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ A e. ( 1st ` B ) ) -> A e. Q. )
23	1, 22	sylan 283	. . . . . . . 8 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> A e. Q. )
24		simpl 109	. . . . . . . 8 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> B e. P. )
25		nqprlu 7920	. . . . . . . . 9 |- ( A e. Q. -> <. { l | l <Q A } , { u | A <Q u } >. e. P. )
26		ltdfpr 7879	. . . . . . . . 9 |- ( ( <. { l | l <Q A } , { u | A <Q u } >. e. P. /\ B e. P. ) -> ( <. { l | l <Q A } , { u | A <Q u } >. <P B <-> E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
27	25, 26	sylan 283	. . . . . . . 8 |- ( ( A e. Q. /\ B e. P. ) -> ( <. { l | l <Q A } , { u | A <Q u } >. <P B <-> E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
28	23, 24, 27	syl2anc 415	. . . . . . 7 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> ( <. { l | l <Q A } , { u | A <Q u } >. <P B <-> E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
29	28	adantr 276	. . . . . 6 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> ( <. { l | l <Q A } , { u | A <Q u } >. <P B <-> E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) )
30	21, 29	mpbird 167	. . . . 5 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B )
31	3, 30	rexlimddv 2673	. . . 4 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B )
32	31	ex 115	. . 3 |- ( B e. P. -> ( A e. ( 1st ` B ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )
33	32	adantl 277	. 2 |- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 1st ` B ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )
34	27	biimpa 296	. . . 4 |- ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) -> E. x e. Q. ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) )
35	14, 9	bitri 184	. . . . . . . 8 |- ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) <-> A <Q x )
36	35	biimpi 120	. . . . . . 7 |- ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) -> A <Q x )
37	36	ad2antrl 494	. . . . . 6 |- ( ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) -> A <Q x )
38	37	adantl 277	. . . . 5 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) /\ ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) ) -> A <Q x )
39		simpllr 540	. . . . . 6 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) /\ ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) ) -> B e. P. )
40		simprrr 546	. . . . . 6 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) /\ ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) ) -> x e. ( 1st ` B ) )
41		prcdnql 7857	. . . . . . 7 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ x e. ( 1st ` B ) ) -> ( A <Q x -> A e. ( 1st ` B ) ) )
42	1, 41	sylan 283	. . . . . 6 |- ( ( B e. P. /\ x e. ( 1st ` B ) ) -> ( A <Q x -> A e. ( 1st ` B ) ) )
43	39, 40, 42	syl2anc 415	. . . . 5 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) /\ ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) ) -> ( A <Q x -> A e. ( 1st ` B ) ) )
44	38, 43	mpd 13	. . . 4 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) /\ ( x e. Q. /\ ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) /\ x e. ( 1st ` B ) ) ) ) -> A e. ( 1st ` B ) )
45	34, 44	rexlimddv 2673	. . 3 |- ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) -> A e. ( 1st ` B ) )
46	45	ex 115	. 2 |- ( ( A e. Q. /\ B e. P. ) -> ( <. { l | l <Q A } , { u | A <Q u } >. <P B -> A e. ( 1st ` B ) ) )
47	33, 46	impbid 129	1 |- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 1st ` B ) <-> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   E.wex 1545   e. wcel 2209   {cab 2224   E.wrex 2529   <.cop 3712   class class class wbr 4131   ` cfv 5380   1stc1st 6376   2ndc2nd 6377   Q.cnq 7653   <Q cltq 7658   P.cnp 7664   <P cltp 7668

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 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

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 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7677  df-pli 7678  df-mi 7679  df-lti 7680  df-plpq 7717  df-mpq 7718  df-enq 7720  df-nqqs 7721  df-plqqs 7722  df-mqqs 7723  df-1nqqs 7724  df-rq 7725  df-ltnqqs 7726  df-inp 7839  df-iltp 7843

This theorem is used by:  caucvgprlemcanl  8017  cauappcvgprlem1  8032  archrecpr  8037  caucvgprlem1  8052  caucvgprprlemml  8067  caucvgprprlemopl  8070