Theorem nqpru 7308

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

Assertion

Ref	Expression
nqpru	|- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 2nd ` B ) <-> B <P <. { l | l <Q A } , { u | A <Q u } >. ) )

Distinct variable group:   A, l, u

Allowed substitution hints:   B( u, l)

Proof of Theorem nqpru

Dummy variable x is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prop 7231	. . . . . 6 |- ( B e. P. -> <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. )
2		prnminu 7245	. . . . . 6 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ A e. ( 2nd ` B ) ) -> E. x e. ( 2nd ` B ) x <Q A )
3	1, 2	sylan 279	. . . . 5 |- ( ( B e. P. /\ A e. ( 2nd ` B ) ) -> E. x e. ( 2nd ` B ) x <Q A )
4		elprnqu 7238	. . . . . . . . . 10 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ x e. ( 2nd ` B ) ) -> x e. Q. )
5	1, 4	sylan 279	. . . . . . . . 9 |- ( ( B e. P. /\ x e. ( 2nd ` B ) ) -> x e. Q. )
6	5	ad2ant2r 498	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> x e. Q. )
7		simprl 503	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> x e. ( 2nd ` B ) )
8		vex 2660	. . . . . . . . . . . 12 |- x e. _V
9		breq1 3898	. . . . . . . . . . . 12 |- ( l = x -> ( l <Q A <-> x <Q A ) )
10	8, 9	elab 2798	. . . . . . . . . . 11 |- ( x e. { l | l <Q A } <-> x <Q A )
11	10	biimpri 132	. . . . . . . . . 10 |- ( x <Q A -> x e. { l | l <Q A } )
12		ltnqex 7305	. . . . . . . . . . . 12 |- { l | l <Q A } e. _V
13		gtnqex 7306	. . . . . . . . . . . 12 |- { u | A <Q u } e. _V
14	12, 13	op1st 5998	. . . . . . . . . . 11 |- ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) = { l | l <Q A }
15	14	eleq2i 2181	. . . . . . . . . 10 |- ( x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) <-> x e. { l | l <Q A } )
16	11, 15	sylibr 133	. . . . . . . . 9 |- ( x <Q A -> x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) )
17	16	ad2antll 480	. . . . . . . 8 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) )
18		19.8a 1552	. . . . . . . 8 |- ( ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) -> E. x ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
19	6, 7, 17, 18	syl12anc 1197	. . . . . . 7 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> E. x ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
20		df-rex 2396	. . . . . . 7 |- ( E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) <-> E. x ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
21	19, 20	sylibr 133	. . . . . 6 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) )
22		elprnqu 7238	. . . . . . . . 9 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ A e. ( 2nd ` B ) ) -> A e. Q. )
23	1, 22	sylan 279	. . . . . . . 8 |- ( ( B e. P. /\ A e. ( 2nd ` B ) ) -> A e. Q. )
24		nqprlu 7303	. . . . . . . . 9 |- ( A e. Q. -> <. { l | l <Q A } , { u | A <Q u } >. e. P. )
25		ltdfpr 7262	. . . . . . . . 9 |- ( ( B e. P. /\ <. { l | l <Q A } , { u | A <Q u } >. e. P. ) -> ( B <P <. { l | l <Q A } , { u | A <Q u } >. <-> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
26	24, 25	sylan2 282	. . . . . . . 8 |- ( ( B e. P. /\ A e. Q. ) -> ( B <P <. { l | l <Q A } , { u | A <Q u } >. <-> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
27	23, 26	syldan 278	. . . . . . 7 |- ( ( B e. P. /\ A e. ( 2nd ` B ) ) -> ( B <P <. { l | l <Q A } , { u | A <Q u } >. <-> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
28	27	adantr 272	. . . . . 6 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> ( B <P <. { l | l <Q A } , { u | A <Q u } >. <-> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
29	21, 28	mpbird 166	. . . . 5 |- ( ( ( B e. P. /\ A e. ( 2nd ` B ) ) /\ ( x e. ( 2nd ` B ) /\ x <Q A ) ) -> B <P <. { l | l <Q A } , { u | A <Q u } >. )
30	3, 29	rexlimddv 2528	. . . 4 |- ( ( B e. P. /\ A e. ( 2nd ` B ) ) -> B <P <. { l | l <Q A } , { u | A <Q u } >. )
31	30	ex 114	. . 3 |- ( B e. P. -> ( A e. ( 2nd ` B ) -> B <P <. { l | l <Q A } , { u | A <Q u } >. ) )
32	31	adantl 273	. 2 |- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 2nd ` B ) -> B <P <. { l | l <Q A } , { u | A <Q u } >. ) )
33	26	ancoms 266	. . . . 5 |- ( ( A e. Q. /\ B e. P. ) -> ( B <P <. { l | l <Q A } , { u | A <Q u } >. <-> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) )
34	33	biimpa 292	. . . 4 |- ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) -> E. x e. Q. ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) )
35	15, 10	bitri 183	. . . . . . . 8 |- ( x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) <-> x <Q A )
36	35	biimpi 119	. . . . . . 7 |- ( x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) -> x <Q A )
37	36	ad2antll 480	. . . . . 6 |- ( ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) -> x <Q A )
38	37	adantl 273	. . . . 5 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) /\ ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) ) -> x <Q A )
39		simpllr 506	. . . . . 6 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) /\ ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) ) -> B e. P. )
40		simprrl 511	. . . . . 6 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) /\ ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) ) -> x e. ( 2nd ` B ) )
41		prcunqu 7241	. . . . . . 7 |- ( ( <. ( 1st ` B ) , ( 2nd ` B ) >. e. P. /\ x e. ( 2nd ` B ) ) -> ( x <Q A -> A e. ( 2nd ` B ) ) )
42	1, 41	sylan 279	. . . . . 6 |- ( ( B e. P. /\ x e. ( 2nd ` B ) ) -> ( x <Q A -> A e. ( 2nd ` B ) ) )
43	39, 40, 42	syl2anc 406	. . . . 5 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) /\ ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) ) -> ( x <Q A -> A e. ( 2nd ` B ) ) )
44	38, 43	mpd 13	. . . 4 |- ( ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) /\ ( x e. Q. /\ ( x e. ( 2nd ` B ) /\ x e. ( 1st ` <. { l | l <Q A } , { u | A <Q u } >. ) ) ) ) -> A e. ( 2nd ` B ) )
45	34, 44	rexlimddv 2528	. . 3 |- ( ( ( A e. Q. /\ B e. P. ) /\ B <P <. { l | l <Q A } , { u | A <Q u } >. ) -> A e. ( 2nd ` B ) )
46	45	ex 114	. 2 |- ( ( A e. Q. /\ B e. P. ) -> ( B <P <. { l | l <Q A } , { u | A <Q u } >. -> A e. ( 2nd ` B ) ) )
47	32, 46	impbid 128	1 |- ( ( A e. Q. /\ B e. P. ) -> ( A e. ( 2nd ` B ) <-> B <P <. { l | l <Q A } , { u | A <Q u } >. ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   E.wex 1451   e. wcel 1463   {cab 2101   E.wrex 2391   <.cop 3496   class class class wbr 3895   ` cfv 5081   1stc1st 5990   2ndc2nd 5991   Q.cnq 7036   <Q cltq 7041   P.cnp 7047   <P cltp 7051

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4003  ax-sep 4006  ax-nul 4014  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412  ax-iinf 4462

This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-ral 2395  df-rex 2396  df-reu 2397  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-nul 3330  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-int 3738  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-tr 3987  df-eprel 4171  df-id 4175  df-po 4178  df-iso 4179  df-iord 4248  df-on 4250  df-suc 4253  df-iom 4465  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-f1 5086  df-fo 5087  df-f1o 5088  df-fv 5089  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-recs 6156  df-irdg 6221  df-1o 6267  df-oadd 6271  df-omul 6272  df-er 6383  df-ec 6385  df-qs 6389  df-ni 7060  df-pli 7061  df-mi 7062  df-lti 7063  df-plpq 7100  df-mpq 7101  df-enq 7103  df-nqqs 7104  df-plqqs 7105  df-mqqs 7106  df-1nqqs 7107  df-rq 7108  df-ltnqqs 7109  df-inp 7222  df-iltp 7226

This theorem is referenced by:  prplnqu  7376  caucvgprprlemmu  7451  caucvgprprlemopu  7455  caucvgprprlemexbt  7462  caucvgprprlem2  7466