Theorem recexprlemss1u 6826

Description: The upper cut of A .P. B is a subset of the upper cut of one. Lemma for recexpr 6828. (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
recexprlemss1u	|- ( A e. P. -> ( 2nd ` ( A .P. B ) ) C_ ( 2nd ` 1P ) )

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

Proof of Theorem recexprlemss1u

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 6822	. . . . 5 |- ( A e. P. -> B e. P. )
3		df-imp 6659	. . . . . 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 6566	. . . . . 6 |- ( ( f e. Q. /\ g e. Q. ) -> ( f .Q g ) e. Q. )
5	3, 4	genpelvu 6703	. . . . 5 |- ( ( A e. P. /\ B e. P. ) -> ( w e. ( 2nd ` ( A .P. B ) ) <-> E. z e. ( 2nd ` A ) E. q e. ( 2nd ` B ) w = ( z .Q q ) ) )
6	2, 5	mpdan 412	. . . 4 |- ( A e. P. -> ( w e. ( 2nd ` ( A .P. B ) ) <-> E. z e. ( 2nd ` A ) E. q e. ( 2nd ` B ) w = ( z .Q q ) ) )
7	1	recexprlemelu 6813	. . . . . . . 8 |- ( q e. ( 2nd ` B ) <-> E. y ( y <Q q /\ ( *Q ` y ) e. ( 1st ` A ) ) )
8		ltrelnq 6555	. . . . . . . . . . . . . 14 |- <Q C_ ( Q. X. Q. )
9	8	brel 4410	. . . . . . . . . . . . 13 |- ( y <Q q -> ( y e. Q. /\ q e. Q. ) )
10	9	simpld 110	. . . . . . . . . . . 12 |- ( y <Q q -> y e. Q. )
11		prop 6665	. . . . . . . . . . . . . . . . . 18 |- ( A e. P. -> <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. )
12		elprnqu 6672	. . . . . . . . . . . . . . . . . 18 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ z e. ( 2nd ` A ) ) -> z e. Q. )
13	11, 12	sylan 277	. . . . . . . . . . . . . . . . 17 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> z e. Q. )
14		ltmnqi 6593	. . . . . . . . . . . . . . . . . 18 |- ( ( y <Q q /\ z e. Q. ) -> ( z .Q y ) <Q ( z .Q q ) )
15	14	expcom 114	. . . . . . . . . . . . . . . . 17 |- ( z e. Q. -> ( y <Q q -> ( z .Q y ) <Q ( z .Q q ) ) )
16	13, 15	syl 14	. . . . . . . . . . . . . . . 16 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( y <Q q -> ( z .Q y ) <Q ( z .Q q ) ) )
17	16	adantr 270	. . . . . . . . . . . . . . 15 |- ( ( ( A e. P. /\ z e. ( 2nd ` A ) ) /\ y e. Q. ) -> ( y <Q q -> ( z .Q y ) <Q ( z .Q q ) ) )
18		prltlu 6677	. . . . . . . . . . . . . . . . . . . 20 |- ( ( <. ( 1st ` A ) , ( 2nd ` A ) >. e. P. /\ ( *Q ` y ) e. ( 1st ` A ) /\ z e. ( 2nd ` A ) ) -> ( *Q ` y ) <Q z )
19	11, 18	syl3an1 1202	. . . . . . . . . . . . . . . . . . 19 |- ( ( A e. P. /\ ( *Q ` y ) e. ( 1st ` A ) /\ z e. ( 2nd ` A ) ) -> ( *Q ` y ) <Q z )
20	19	3com23 1144	. . . . . . . . . . . . . . . . . 18 |- ( ( A e. P. /\ z e. ( 2nd ` A ) /\ ( *Q ` y ) e. ( 1st ` A ) ) -> ( *Q ` y ) <Q z )
21	20	3expia 1140	. . . . . . . . . . . . . . . . 17 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( ( *Q ` y ) e. ( 1st ` A ) -> ( *Q ` y ) <Q z ) )
22	21	adantr 270	. . . . . . . . . . . . . . . 16 |- ( ( ( A e. P. /\ z e. ( 2nd ` A ) ) /\ y e. Q. ) -> ( ( *Q ` y ) e. ( 1st ` A ) -> ( *Q ` y ) <Q z ) )
23		ltmnqi 6593	. . . . . . . . . . . . . . . . . . . . 21 |- ( ( ( *Q ` y ) <Q z /\ y e. Q. ) -> ( y .Q ( *Q ` y ) ) <Q ( y .Q z ) )
24	23	expcom 114	. . . . . . . . . . . . . . . . . . . 20 |- ( y e. Q. -> ( ( *Q ` y ) <Q z -> ( y .Q ( *Q ` y ) ) <Q ( y .Q z ) ) )
25	24	adantr 270	. . . . . . . . . . . . . . . . . . 19 |- ( ( y e. Q. /\ z e. Q. ) -> ( ( *Q ` y ) <Q z -> ( y .Q ( *Q ` y ) ) <Q ( y .Q z ) ) )
26		recidnq 6583	. . . . . . . . . . . . . . . . . . . . 21 |- ( y e. Q. -> ( y .Q ( *Q ` y ) ) = 1Q )
27	26	adantr 270	. . . . . . . . . . . . . . . . . . . 20 |- ( ( y e. Q. /\ z e. Q. ) -> ( y .Q ( *Q ` y ) ) = 1Q )
28		mulcomnqg 6573	. . . . . . . . . . . . . . . . . . . 20 |- ( ( y e. Q. /\ z e. Q. ) -> ( y .Q z ) = ( z .Q y ) )
29	27, 28	breq12d 3798	. . . . . . . . . . . . . . . . . . 19 |- ( ( y e. Q. /\ z e. Q. ) -> ( ( y .Q ( *Q ` y ) ) <Q ( y .Q z ) <-> 1Q <Q ( z .Q y ) ) )
30	25, 29	sylibd 147	. . . . . . . . . . . . . . . . . 18 |- ( ( y e. Q. /\ z e. Q. ) -> ( ( *Q ` y ) <Q z -> 1Q <Q ( z .Q y ) ) )
31	30	ancoms 264	. . . . . . . . . . . . . . . . 17 |- ( ( z e. Q. /\ y e. Q. ) -> ( ( *Q ` y ) <Q z -> 1Q <Q ( z .Q y ) ) )
32	13, 31	sylan 277	. . . . . . . . . . . . . . . 16 |- ( ( ( A e. P. /\ z e. ( 2nd ` A ) ) /\ y e. Q. ) -> ( ( *Q ` y ) <Q z -> 1Q <Q ( z .Q y ) ) )
33	22, 32	syld 44	. . . . . . . . . . . . . . 15 |- ( ( ( A e. P. /\ z e. ( 2nd ` A ) ) /\ y e. Q. ) -> ( ( *Q ` y ) e. ( 1st ` A ) -> 1Q <Q ( z .Q y ) ) )
34	17, 33	anim12d 328	. . . . . . . . . . . . . 14 |- ( ( ( A e. P. /\ z e. ( 2nd ` A ) ) /\ y e. Q. ) -> ( ( y <Q q /\ ( *Q ` y ) e. ( 1st ` A ) ) -> ( ( z .Q y ) <Q ( z .Q q ) /\ 1Q <Q ( z .Q y ) ) ) )
35		ltsonq 6588	. . . . . . . . . . . . . . . 16 |- <Q Or Q.
36	35, 8	sotri 4740	. . . . . . . . . . . . . . 15 |- ( ( 1Q <Q ( z .Q y ) /\ ( z .Q y ) <Q ( z .Q q ) ) -> 1Q <Q ( z .Q q ) )
37	36	ancoms 264	. . . . . . . . . . . . . 14 |- ( ( ( z .Q y ) <Q ( z .Q q ) /\ 1Q <Q ( z .Q y ) ) -> 1Q <Q ( z .Q q ) )
38	34, 37	syl6 33	. . . . . . . . . . . . 13 |- ( ( ( A e. P. /\ z e. ( 2nd ` A ) ) /\ y e. Q. ) -> ( ( y <Q q /\ ( *Q ` y ) e. ( 1st ` A ) ) -> 1Q <Q ( z .Q q ) ) )
39	38	exp4b 359	. . . . . . . . . . . 12 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( y e. Q. -> ( y <Q q -> ( ( *Q ` y ) e. ( 1st ` A ) -> 1Q <Q ( z .Q q ) ) ) ) )
40	10, 39	syl5 32	. . . . . . . . . . 11 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( y <Q q -> ( y <Q q -> ( ( *Q ` y ) e. ( 1st ` A ) -> 1Q <Q ( z .Q q ) ) ) ) )
41	40	pm2.43d 49	. . . . . . . . . 10 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( y <Q q -> ( ( *Q ` y ) e. ( 1st ` A ) -> 1Q <Q ( z .Q q ) ) ) )
42	41	impd 251	. . . . . . . . 9 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( ( y <Q q /\ ( *Q ` y ) e. ( 1st ` A ) ) -> 1Q <Q ( z .Q q ) ) )
43	42	exlimdv 1740	. . . . . . . 8 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( E. y ( y <Q q /\ ( *Q ` y ) e. ( 1st ` A ) ) -> 1Q <Q ( z .Q q ) ) )
44	7, 43	syl5bi 150	. . . . . . 7 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( q e. ( 2nd ` B ) -> 1Q <Q ( z .Q q ) ) )
45		breq2 3789	. . . . . . . 8 |- ( w = ( z .Q q ) -> ( 1Q <Q w <-> 1Q <Q ( z .Q q ) ) )
46	45	biimprcd 158	. . . . . . 7 |- ( 1Q <Q ( z .Q q ) -> ( w = ( z .Q q ) -> 1Q <Q w ) )
47	44, 46	syl6 33	. . . . . 6 |- ( ( A e. P. /\ z e. ( 2nd ` A ) ) -> ( q e. ( 2nd ` B ) -> ( w = ( z .Q q ) -> 1Q <Q w ) ) )
48	47	expimpd 355	. . . . 5 |- ( A e. P. -> ( ( z e. ( 2nd ` A ) /\ q e. ( 2nd ` B ) ) -> ( w = ( z .Q q ) -> 1Q <Q w ) ) )
49	48	rexlimdvv 2483	. . . 4 |- ( A e. P. -> ( E. z e. ( 2nd ` A ) E. q e. ( 2nd ` B ) w = ( z .Q q ) -> 1Q <Q w ) )
50	6, 49	sylbid 148	. . 3 |- ( A e. P. -> ( w e. ( 2nd ` ( A .P. B ) ) -> 1Q <Q w ) )
51		1pru 6746	. . . 4 |- ( 2nd ` 1P ) = { w | 1Q <Q w }
52	51	abeq2i 2189	. . 3 |- ( w e. ( 2nd ` 1P ) <-> 1Q <Q w )
53	50, 52	syl6ibr 160	. 2 |- ( A e. P. -> ( w e. ( 2nd ` ( A .P. B ) ) -> w e. ( 2nd ` 1P ) ) )
54	53	ssrdv 3005	1 |- ( A e. P. -> ( 2nd ` ( A .P. B ) ) C_ ( 2nd ` 1P ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   = wceq 1284   E.wex 1421   e. wcel 1433   {cab 2067   E.wrex 2349   C_ wss 2973   <.cop 3401   class class class wbr 3785   ` cfv 4922  (class class class)co 5532   1stc1st 5785   2ndc2nd 5786   Q.cnq 6470   1Qc1q 6471   .Q cmq 6473   *Qcrq 6474   <Q cltq 6475   P.cnp 6481   1Pc1p 6482   .P. cmp 6484

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329

This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-eprel 4044  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-irdg 5980  df-1o 6024  df-oadd 6028  df-omul 6029  df-er 6129  df-ec 6131  df-qs 6135  df-ni 6494  df-pli 6495  df-mi 6496  df-lti 6497  df-plpq 6534  df-mpq 6535  df-enq 6537  df-nqqs 6538  df-plqqs 6539  df-mqqs 6540  df-1nqqs 6541  df-rq 6542  df-ltnqqs 6543  df-inp 6656  df-i1p 6657  df-imp 6659

This theorem is referenced by:  recexprlemex  6827