MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbthlem1 Structured version   Unicode version

Theorem sbthlem1 7646
Description: Lemma for sbth 7656. (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
StepHypRef Expression
1 unissb 4283 . 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 ) ) }
32abeq2i 2584 . . . 4  |-  ( x  e.  D  <->  ( x  C_  A  /\  ( g
" ( B  \ 
( f " x
) ) )  C_  ( A  \  x
) ) )
4 difss2 3629 . . . . . . 7  |-  ( ( g " ( B 
\  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  (
g " ( B 
\  ( f "
x ) ) ) 
C_  A )
5 ssconb 3633 . . . . . . . 8  |-  ( ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  A )  -> 
( x  C_  ( A  \  ( g "
( B  \  (
f " x ) ) ) )  <->  ( g " ( B  \ 
( f " x
) ) )  C_  ( A  \  x
) ) )
65exbiri 622 . . . . . . 7  |-  ( x 
C_  A  ->  (
( g " ( B  \  ( f "
x ) ) ) 
C_  A  ->  (
( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) ) ) )
74, 6syl5 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 ) ) ) ) ) ) )
87pm2.43d 48 . . . . 5  |-  ( x 
C_  A  ->  (
( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) ) )
98imp 429 . . . 4  |-  ( ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) )  ->  x  C_  ( A  \ 
( g " ( B  \  ( f "
x ) ) ) ) )
103, 9sylbi 195 . . 3  |-  ( x  e.  D  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) )
11 elssuni 4281 . . . . 5  |-  ( x  e.  D  ->  x  C_ 
U. D )
12 imass2 5382 . . . . 5  |-  ( x 
C_  U. D  ->  (
f " x ) 
C_  ( f " U. D ) )
13 sscon 3634 . . . . 5  |-  ( ( f " x ) 
C_  ( f " U. D )  ->  ( B  \  ( f " U. D ) )  C_  ( B  \  (
f " x ) ) )
1411, 12, 133syl 20 . . . 4  |-  ( x  e.  D  ->  ( B  \  ( f " U. D ) )  C_  ( B  \  (
f " x ) ) )
15 imass2 5382 . . . 4  |-  ( ( B  \  ( f
" U. D ) )  C_  ( B  \  ( f " x
) )  ->  (
g " ( B 
\  ( f " U. D ) ) ) 
C_  ( g "
( B  \  (
f " x ) ) ) )
16 sscon 3634 . . . 4  |-  ( ( g " ( B 
\  ( f " U. D ) ) ) 
C_  ( g "
( B  \  (
f " x ) ) )  ->  ( A  \  ( g "
( B  \  (
f " x ) ) ) )  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )
1714, 15, 163syl 20 . . 3  |-  ( x  e.  D  ->  ( A  \  ( g "
( B  \  (
f " x ) ) ) )  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )
1810, 17sstrd 3509 . 2  |-  ( x  e.  D  ->  x  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )
191, 18mprgbir 2821 1  |-  U. D  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1395    e. wcel 1819   {cab 2442   _Vcvv 3109    \ cdif 3468    C_ wss 3471   U.cuni 4251   "cima 5011
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ral 2812  df-rab 2816  df-v 3111  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-opab 4516  df-xp 5014  df-cnv 5016  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021
This theorem is referenced by:  sbthlem2  7647  sbthlem3  7648  sbthlem5  7650
  Copyright terms: Public domain W3C validator