Theorem recexprlemss1l 7436

Description: The lower cut of A .P. B is a subset of the lower cut of one. Lemma for recexpr 7439. (Contributed by Jim Kingdon, 27-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
recexprlemss1l	|- ( A e. P. -> ( 1st ` ( A .P. B ) ) C_ ( 1st ` 1P ) )

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

Proof of Theorem recexprlemss1l

Dummy variables q z w u f g are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		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 ) ) } >.
2	1	recexprlempr 7433	. . . . 5 |- ( A e. P. -> B e. P. )
3		df-imp 7270	. . . . . 6 |- .P. = ( y e. P. , w e. P. |-> <. { u e. Q. | E. f e. Q. E. g e. Q. ( f e. ( 1st ` y ) /\ g e. ( 1st ` w ) /\ u = ( f .Q g ) ) } , { u e. Q. | E. f e. Q. E. g e. Q. ( f e. ( 2nd ` y ) /\ g e. ( 2nd ` w ) /\ u = ( f .Q g ) ) } >. )
4		mulclnq 7177	. . . . . 6 |- ( ( f e. Q. /\ g e. Q. ) -> ( f .Q g ) e. Q. )
5	3, 4	genpelvl 7313	. . . . 5 |- ( ( A e. P. /\ B e. P. ) -> ( w e. ( 1st ` ( A .P. B ) ) <-> E. z e. ( 1st ` A ) E. q e. ( 1st ` B ) w = ( z .Q q ) ) )
6	2, 5	mpdan 417	. . . 4 |- ( A e. P. -> ( w e. ( 1st ` ( A .P. B ) ) <-> E. z e. ( 1st ` A ) E. q e. ( 1st ` B ) w = ( z .Q q ) ) )
7	1	recexprlemell 7423	. . . . . . . 8 |- ( q e. ( 1st ` B ) <-> E. y ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) )
8		ltrelnq 7166	. . . . . . . . . . . . . 14 |- <Q C_ ( Q. X. Q. )
9	8	brel 4586	. . . . . . . . . . . . 13 |- ( q <Q y -> ( q e. Q. /\ y e. Q. ) )
10	9	simprd 113	. . . . . . . . . . . 12 |- ( q <Q y -> y e. Q. )
11		prop 7276	. . . . . . . . . . . . . . . . . 18 |- ( A e. P. -> <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. )
12		elprnql 7282	. . . . . . . . . . . . . . . . . 18 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ z e. ( 1st ` A ) ) -> z e. Q. )
13	11, 12	sylan 281	. . . . . . . . . . . . . . . . 17 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> z e. Q. )
14		ltmnqi 7204	. . . . . . . . . . . . . . . . . 18 |- ( ( q <Q y /\ z e. Q. ) -> ( z .Q q ) <Q ( z .Q y ) )
15	14	expcom 115	. . . . . . . . . . . . . . . . 17 |- ( z e. Q. -> ( q <Q y -> ( z .Q q ) <Q ( z .Q y ) ) )
16	13, 15	syl 14	. . . . . . . . . . . . . . . 16 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( q <Q y -> ( z .Q q ) <Q ( z .Q y ) ) )
17	16	adantr 274	. . . . . . . . . . . . . . 15 |- ( ( ( A e. P. /\ z e. ( 1st ` A ) ) /\ y e. Q. ) -> ( q <Q y -> ( z .Q q ) <Q ( z .Q y ) ) )
18		prltlu 7288	. . . . . . . . . . . . . . . . . . 19 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ z e. ( 1st ` A ) /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> z <Q ( *Q ` y ) )
19	11, 18	syl3an1 1249	. . . . . . . . . . . . . . . . . 18 |- ( ( A e. P. /\ z e. ( 1st ` A ) /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> z <Q ( *Q ` y ) )
20	19	3expia 1183	. . . . . . . . . . . . . . . . 17 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( ( *Q ` y ) e. ( 2nd ` A ) -> z <Q ( *Q ` y ) ) )
21	20	adantr 274	. . . . . . . . . . . . . . . 16 |- ( ( ( A e. P. /\ z e. ( 1st ` A ) ) /\ y e. Q. ) -> ( ( *Q ` y ) e. ( 2nd ` A ) -> z <Q ( *Q ` y ) ) )
22		ltmnqi 7204	. . . . . . . . . . . . . . . . . . . . 21 |- ( ( z <Q ( *Q ` y ) /\ y e. Q. ) -> ( y .Q z ) <Q ( y .Q ( *Q ` y ) ) )
23	22	expcom 115	. . . . . . . . . . . . . . . . . . . 20 |- ( y e. Q. -> ( z <Q ( *Q ` y ) -> ( y .Q z ) <Q ( y .Q ( *Q ` y ) ) ) )
24	23	adantr 274	. . . . . . . . . . . . . . . . . . 19 |- ( ( y e. Q. /\ z e. Q. ) -> ( z <Q ( *Q ` y ) -> ( y .Q z ) <Q ( y .Q ( *Q ` y ) ) ) )
25		mulcomnqg 7184	. . . . . . . . . . . . . . . . . . . 20 |- ( ( y e. Q. /\ z e. Q. ) -> ( y .Q z ) = ( z .Q y ) )
26		recidnq 7194	. . . . . . . . . . . . . . . . . . . . 21 |- ( y e. Q. -> ( y .Q ( *Q ` y ) ) = 1Q )
27	26	adantr 274	. . . . . . . . . . . . . . . . . . . 20 |- ( ( y e. Q. /\ z e. Q. ) -> ( y .Q ( *Q ` y ) ) = 1Q )
28	25, 27	breq12d 3937	. . . . . . . . . . . . . . . . . . 19 |- ( ( y e. Q. /\ z e. Q. ) -> ( ( y .Q z ) <Q ( y .Q ( *Q ` y ) ) <-> ( z .Q y ) <Q 1Q ) )
29	24, 28	sylibd 148	. . . . . . . . . . . . . . . . . 18 |- ( ( y e. Q. /\ z e. Q. ) -> ( z <Q ( *Q ` y ) -> ( z .Q y ) <Q 1Q ) )
30	29	ancoms 266	. . . . . . . . . . . . . . . . 17 |- ( ( z e. Q. /\ y e. Q. ) -> ( z <Q ( *Q ` y ) -> ( z .Q y ) <Q 1Q ) )
31	13, 30	sylan 281	. . . . . . . . . . . . . . . 16 |- ( ( ( A e. P. /\ z e. ( 1st ` A ) ) /\ y e. Q. ) -> ( z <Q ( *Q ` y ) -> ( z .Q y ) <Q 1Q ) )
32	21, 31	syld 45	. . . . . . . . . . . . . . 15 |- ( ( ( A e. P. /\ z e. ( 1st ` A ) ) /\ y e. Q. ) -> ( ( *Q ` y ) e. ( 2nd ` A ) -> ( z .Q y ) <Q 1Q ) )
33	17, 32	anim12d 333	. . . . . . . . . . . . . 14 |- ( ( ( A e. P. /\ z e. ( 1st ` A ) ) /\ y e. Q. ) -> ( ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> ( ( z .Q q ) <Q ( z .Q y ) /\ ( z .Q y ) <Q 1Q ) ) )
34		ltsonq 7199	. . . . . . . . . . . . . . 15 |- <Q Or Q.
35	34, 8	sotri 4929	. . . . . . . . . . . . . 14 |- ( ( ( z .Q q ) <Q ( z .Q y ) /\ ( z .Q y ) <Q 1Q ) -> ( z .Q q ) <Q 1Q )
36	33, 35	syl6 33	. . . . . . . . . . . . 13 |- ( ( ( A e. P. /\ z e. ( 1st ` A ) ) /\ y e. Q. ) -> ( ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> ( z .Q q ) <Q 1Q ) )
37	36	exp4b 364	. . . . . . . . . . . 12 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( y e. Q. -> ( q <Q y -> ( ( *Q ` y ) e. ( 2nd ` A ) -> ( z .Q q ) <Q 1Q ) ) ) )
38	10, 37	syl5 32	. . . . . . . . . . 11 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( q <Q y -> ( q <Q y -> ( ( *Q ` y ) e. ( 2nd ` A ) -> ( z .Q q ) <Q 1Q ) ) ) )
39	38	pm2.43d 50	. . . . . . . . . 10 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( q <Q y -> ( ( *Q ` y ) e. ( 2nd ` A ) -> ( z .Q q ) <Q 1Q ) ) )
40	39	impd 252	. . . . . . . . 9 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> ( z .Q q ) <Q 1Q ) )
41	40	exlimdv 1791	. . . . . . . 8 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( E. y ( q <Q y /\ ( *Q ` y ) e. ( 2nd ` A ) ) -> ( z .Q q ) <Q 1Q ) )
42	7, 41	syl5bi 151	. . . . . . 7 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( q e. ( 1st ` B ) -> ( z .Q q ) <Q 1Q ) )
43		breq1 3927	. . . . . . . 8 |- ( w = ( z .Q q ) -> ( w <Q 1Q <-> ( z .Q q ) <Q 1Q ) )
44	43	biimprcd 159	. . . . . . 7 |- ( ( z .Q q ) <Q 1Q -> ( w = ( z .Q q ) -> w <Q 1Q ) )
45	42, 44	syl6 33	. . . . . 6 |- ( ( A e. P. /\ z e. ( 1st ` A ) ) -> ( q e. ( 1st ` B ) -> ( w = ( z .Q q ) -> w <Q 1Q ) ) )
46	45	expimpd 360	. . . . 5 |- ( A e. P. -> ( ( z e. ( 1st ` A ) /\ q e. ( 1st ` B ) ) -> ( w = ( z .Q q ) -> w <Q 1Q ) ) )
47	46	rexlimdvv 2554	. . . 4 |- ( A e. P. -> ( E. z e. ( 1st ` A ) E. q e. ( 1st ` B ) w = ( z .Q q ) -> w <Q 1Q ) )
48	6, 47	sylbid 149	. . 3 |- ( A e. P. -> ( w e. ( 1st ` ( A .P. B ) ) -> w <Q 1Q ) )
49		1prl 7356	. . . 4 |- ( 1st ` 1P ) = { w | w <Q 1Q }
50	49	abeq2i 2248	. . 3 |- ( w e. ( 1st ` 1P ) <-> w <Q 1Q )
51	48, 50	syl6ibr 161	. 2 |- ( A e. P. -> ( w e. ( 1st ` ( A .P. B ) ) -> w e. ( 1st ` 1P ) ) )
52	51	ssrdv 3098	1 |- ( A e. P. -> ( 1st ` ( A .P. B ) ) C_ ( 1st ` 1P ) )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1331   E.wex 1468   e. wcel 1480   {cab 2123   E.wrex 2415   C_ wss 3066   <.cop 3525   class class class wbr 3924   ` cfv 5118  (class class class)co 5767   1stc1st 6029   2ndc2nd 6030   Q.cnq 7081   1Qc1q 7082   .Q cmq 7084   *Qcrq 7085   <Q cltq 7086   P.cnp 7092   1Pc1p 7093   .P. cmp 7095

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-eprel 4206  df-id 4210  df-po 4213  df-iso 4214  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-1o 6306  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-pli 7106  df-mi 7107  df-lti 7108  df-plpq 7145  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-plqqs 7150  df-mqqs 7151  df-1nqqs 7152  df-rq 7153  df-ltnqqs 7154  df-inp 7267  df-i1p 7268  df-imp 7270

This theorem is referenced by:  recexprlemex  7438