Theorem recexprlemlol 7774

Description: The lower cut of B is lower. Lemma for recexpr 7786. (Contributed by Jim Kingdon, 28-Dec-2019.)

Hypothesis

Ref	Expression
recexpr.1	|- B = <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >.

Assertion

Ref	Expression
recexprlemlol	|- ( ( A e. P. /\ q e. Q. ) -> ( E. r e. Q. ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) ) )

Distinct variable groups:   r, q, x, y, A   B, q, r, x, y

Proof of Theorem recexprlemlol

Step	Hyp	Ref	Expression
1		ltsonq 7546	. . . . . . . . 9 |- <Q Or Q.
2		ltrelnq 7513	. . . . . . . . 9 |- <Q C_ ( Q. X. Q. )
3	1, 2	sotri 5097	. . . . . . . 8 |- ( ( q <Q r /\ r <Q y ) -> q <Q y )
4	3	ex 115	. . . . . . 7 |- ( q <Q r -> ( r <Q y -> q <Q y ) )
5	4	anim1d 336	. . . . . 6 |- ( q <Q r -> ( ( r <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
6	5	eximdv 1904	. . . . 5 |- ( q <Q r -> ( E. y ( r <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> E. y ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) ) )
7		recexpr.1	. . . . . 6 |- B = <. { x | E. y ( x <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) } , { x | E. y ( y <Q x /\ ( *Q ` y ) e. ( 1st ` A ) ) } >.
8	7	recexprlemell 7770	. . . . 5 |- ( r e. ( 1st ` B ) <-> E. y ( r <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) )
9	7	recexprlemell 7770	. . . . 5 |- ( q e. ( 1st ` B ) <-> E. y ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) )
10	6, 8, 9	3imtr4g 205	. . . 4 |- ( q <Q r -> ( r e. ( 1st ` B ) -> q e. ( 1st ` B ) ) )
11	10	imp 124	. . 3 |- ( ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) )
12	11	rexlimivw 2621	. 2 |- ( E. r e. Q. ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) )
13	12	a1i 9	1 |- ( ( A e. P. /\ q e. Q. ) -> ( E. r e. Q. ( q <Q r /\ r e. ( 1st ` B ) ) -> q e. ( 1st ` B ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1373   E.wex 1516   e. wcel 2178   {cab 2193   E.wrex 2487   <.cop 3646   class class class wbr 4059   ` cfv 5290   1stc1st 6247   2ndc2nd 6248   Q.cnq 7428   *Qcrq 7432   <Q cltq 7433   P.cnp 7439

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654

This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-eprel 4354  df-id 4358  df-po 4361  df-iso 4362  df-iord 4431  df-on 4433  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-irdg 6479  df-oadd 6529  df-omul 6530  df-er 6643  df-ec 6645  df-qs 6649  df-ni 7452  df-mi 7454  df-lti 7455  df-enq 7495  df-nqqs 7496  df-ltnqqs 7501

This theorem is referenced by:  recexprlemrnd  7777