Theorem nqprl 7383

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 7307	. . . . . 6 |- ( B e. P. -> <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. )
2		prnmaxl 7320	. . . . . 6 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ A e. ( 1st ` B ) ) -> E. x e. ( 1st ` B ) A <Q x )
3	1, 2	sylan 281	. . . . 5 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> E. x e. ( 1st ` B ) A <Q x )
4		elprnql 7313	. . . . . . . . . 10 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ x e. ( 1st ` B ) ) -> x e. Q. )
5	1, 4	sylan 281	. . . . . . . . 9 |- ( ( B e. P. /\ x e. ( 1st ` B ) ) -> x e. Q. )
6	5	ad2ant2r 501	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> x e. Q. )
7		vex 2692	. . . . . . . . . . . 12 |- x e. _V
8		breq2 3941	. . . . . . . . . . . 12 |- ( u = x -> ( A <Q u <-> A <Q x ) )
9	7, 8	elab 2832	. . . . . . . . . . 11 |- ( x e. { u | A <Q u } <-> A <Q x )
10	9	biimpri 132	. . . . . . . . . 10 |- ( A <Q x -> x e. { u | A <Q u } )
11		ltnqex 7381	. . . . . . . . . . . 12 |- { l | l <Q A } e. _V
12		gtnqex 7382	. . . . . . . . . . . 12 |- { u | A <Q u } e. _V
13	11, 12	op2nd 6053	. . . . . . . . . . 11 |- ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) = { u | A <Q u }
14	13	eleq2i 2207	. . . . . . . . . 10 |- ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) <-> x e. { u | A <Q u } )
15	10, 14	sylibr 133	. . . . . . . . 9 |- ( A <Q x -> x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) )
16	15	ad2antll 483	. . . . . . . 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 521	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 1st ` B ) ) /\ ( x e. ( 1st ` B ) /\ A <Q x ) ) -> x e. ( 1st ` B ) )
18		19.8a 1570	. . . . . . . 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 1215	. . . . . . 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 2423	. . . . . . 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 133	. . . . . 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 7313	. . . . . . . . 9 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ A e. ( 1st ` B ) ) -> A e. Q. )
23	1, 22	sylan 281	. . . . . . . 8 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> A e. Q. )
24		simpl 108	. . . . . . . 8 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> B e. P. )
25		nqprlu 7379	. . . . . . . . 9 |- ( A e. Q. -> <. { l | l <Q A } , { u | A <Q u } >. e. P. )
26		ltdfpr 7338	. . . . . . . . 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 281	. . . . . . . 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 409	. . . . . . 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 274	. . . . . 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 166	. . . . 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 2557	. . . 4 |- ( ( B e. P. /\ A e. ( 1st ` B ) ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B )
32	31	ex 114	. . 3 |- ( B e. P. -> ( A e. ( 1st ` B ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )
33	32	adantl 275	. 2 |- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 1st ` B ) -> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )
34	27	biimpa 294	. . . 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 183	. . . . . . . 8 |- ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) <-> A <Q x )
36	35	biimpi 119	. . . . . . 7 |- ( x e. ( 2nd ` <. { l | l <Q A } , { u | A <Q u } >. ) -> A <Q x )
37	36	ad2antrl 482	. . . . . 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 275	. . . . 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 524	. . . . . 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 530	. . . . . 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 7316	. . . . . . 7 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ x e. ( 1st ` B ) ) -> ( A <Q x -> A e. ( 1st ` B ) ) )
42	1, 41	sylan 281	. . . . . 6 |- ( ( B e. P. /\ x e. ( 1st ` B ) ) -> ( A <Q x -> A e. ( 1st ` B ) ) )
43	39, 40, 42	syl2anc 409	. . . . 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 2557	. . 3 |- ( ( ( A e. Q. /\ B e. P. ) /\ <. { l | l <Q A } , { u | A <Q u } >. <P B ) -> A e. ( 1st ` B ) )
46	45	ex 114	. 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 128	1 |- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 1st ` B ) <-> <. { l | l <Q A } , { u | A <Q u } >. <P B ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   E.wex 1469   e. wcel 1481   {cab 2126   E.wrex 2418   <.cop 3535   class class class wbr 3937   ` cfv 5131   1stc1st 6044   2ndc2nd 6045   Q.cnq 7112   <Q cltq 7117   P.cnp 7123   <P cltp 7127

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-coll 4051  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-iinf 4510

This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-ral 2422  df-rex 2423  df-reu 2424  df-rab 2426  df-v 2691  df-sbc 2914  df-csb 3008  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-int 3780  df-iun 3823  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-eprel 4219  df-id 4223  df-po 4226  df-iso 4227  df-iord 4296  df-on 4298  df-suc 4301  df-iom 4513  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-ov 5785  df-oprab 5786  df-mpo 5787  df-1st 6046  df-2nd 6047  df-recs 6210  df-irdg 6275  df-1o 6321  df-oadd 6325  df-omul 6326  df-er 6437  df-ec 6439  df-qs 6443  df-ni 7136  df-pli 7137  df-mi 7138  df-lti 7139  df-plpq 7176  df-mpq 7177  df-enq 7179  df-nqqs 7180  df-plqqs 7181  df-mqqs 7182  df-1nqqs 7183  df-rq 7184  df-ltnqqs 7185  df-inp 7298  df-iltp 7302

This theorem is referenced by:  caucvgprlemcanl  7476  cauappcvgprlem1  7491  archrecpr  7496  caucvgprlem1  7511  caucvgprprlemml  7526  caucvgprprlemopl  7529