Theorem sbthlem1 6958

Description: Lemma for isbth 6968. (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 3841	. 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 2288	. . . 4 |- ( x e. D <-> ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) )
4		difss2 3265	. . . . . . 7 |- ( ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) -> ( g " ( B \ ( f " x ) ) ) C_ A )
5		ssconb 3270	. . . . . . . 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 382	. . . . . . 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 124	. . . 4 |- ( ( x C_ A /\ ( g " ( B \ ( f " x ) ) ) C_ ( A \ x ) ) -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) )
10	3, 9	sylbi 121	. . 3 |- ( x e. D -> x C_ ( A \ ( g " ( B \ ( f " x ) ) ) ) )
11		elssuni 3839	. . . . 5 |- ( x e. D -> x C_ U. D )
12		imass2 5006	. . . . 5 |- ( x C_ U. D -> ( f " x ) C_ ( f " U. D ) )
13		sscon 3271	. . . . 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 5006	. . . 4 |- ( ( B \ ( f " U. D ) ) C_ ( B \ ( f " x ) ) -> ( g " ( B \ ( f " U. D ) ) ) C_ ( g " ( B \ ( f " x ) ) ) )
16		sscon 3271	. . . 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 3167	. 2 |- ( x e. D -> x C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) ) )
19	1, 18	mprgbir 2535	1 |- U. D C_ ( A \ ( g " ( B \ ( f " U. D ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1353   e. wcel 2148   {cab 2163   _Vcvv 2739   \ cdif 3128   C_ wss 3131   U.cuni 3811   "cima 4631

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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2741  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-br 4006  df-opab 4067  df-xp 4634  df-cnv 4636  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641

This theorem is referenced by:  sbthlem2  6959  sbthlemi3  6960  sbthlemi5  6962