Theorem sbthlem1 6845

Description: Lemma for isbth 6855. (Contributed by NM, 22-Mar-1998.)

Hypotheses

Ref	Expression
sbthlem.1	|- A e. _V
sbthlem.2	|- D = { x | ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) }

Assertion

Ref	Expression
sbthlem1	|- U. D C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) )

Distinct variable groups:   x, A   x, B   x, D   x, f   x, g

Allowed substitution hints:   A( f, g)   B( f, g)   D( f, g)

Proof of Theorem sbthlem1

Step	Hyp	Ref	Expression
1		unissb 3766	. 2 |- ( U. D C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) ) <-> A. x e. D x C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) ) )
2		sbthlem.2	. . . . 5 |- D = { x | ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) }
3	2	abeq2i 2250	. . . 4 |- ( x e. D <-> ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) )
4		difss2 3204	. . . . . . 7 |- ( ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) -> ( g " ( B \ ( f " x ) ) ) C_ A )
5		ssconb 3209	. . . . . . . 8 |- ( ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ A ) -> ( x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) <-> ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) )
6	5	exbiri 379	. . . . . . 7 |- ( x C_ A -> ( ( g " ( B \ ( f " x ) ) ) C_ A -> ( ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) ) ) )
7	4, 6	syl5 32	. . . . . 6 |- ( x C_ A -> ( ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) -> ( ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) ) ) )
8	7	pm2.43d 50	. . . . 5 |- ( x C_ A -> ( ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) ) )
9	8	imp 123	. . . 4 |- ( ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) )
10	3, 9	sylbi 120	. . 3 |- ( x e. D -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) )
11		elssuni 3764	. . . . 5 |- ( x e. D -> x C_ U. D )
12		imass2 4915	. . . . 5 |- ( x C_ U. D -> ( f " x ) C_ ( f " U. D ) )
13		sscon 3210	. . . . 5 |- ( ( f " x ) C_ ( f " U. D ) -> ( B \ ( f " U. D ) ) C_ ( B \ ( f " x ) ) )
14	11, 12, 13	3syl 17	. . . 4 |- ( x e. D -> ( B \ ( f " U. D ) ) C_ ( B \ ( f " x ) ) )
15		imass2 4915	. . . 4 |- ( ( B \ ( f " U. D ) ) C_ ( B \ ( f " x ) ) -> ( g " ( B \ ( f " U. D ) ) ) C_ ( g " ( B \ ( f " x ) ) ) )
16		sscon 3210	. . . 4 |- ( ( g " ( B \ ( f " U. D ) ) ) C_ ( g " ( B \ ( f " x ) ) ) -> ( A \ ( g " ( B \ ( f " x ) ) ) ) C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) ) )
17	14, 15, 16	3syl 17	. . 3 |- ( x e. D -> ( A \ ( g " ( B \ ( f " x ) ) ) ) C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) ) )
18	10, 17	sstrd 3107	. 2 |- ( x e. D -> x C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) ) )
19	1, 18	mprgbir 2490	1 |- U. D C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) )

Syntax hints:   -> wi 4   /\ wa 103   = wceq 1331   e. wcel 1480   {cab 2125   _Vcvv 2686   \ cdif 3068   C_ wss 3071   U.cuni 3736   "cima 4542

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-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-v 2688  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-xp 4545  df-cnv 4547  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552

This theorem is referenced by:  sbthlem2  6846  sbthlemi3  6847  sbthlemi5  6849