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

Theorem sbthlem1 7153
Description: Lemma for sbth 7163. (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 3987 . 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 2494 . . . 4  |-  ( x  e.  D  <->  ( x  C_  A  /\  ( g
" ( B  \ 
( f " x
) ) )  C_  ( A  \  x
) ) )
4 difss2 3419 . . . . . . 7  |-  ( ( g " ( B 
\  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  (
g " ( B 
\  ( f "
x ) ) ) 
C_  A )
5 ssconb 3423 . . . . . . . 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 606 . . . . . . 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 30 . . . . . 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 46 . . . . 5  |-  ( x 
C_  A  ->  (
( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) ) )
98imp 419 . . . 4  |-  ( ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) )  ->  x  C_  ( A  \ 
( g " ( B  \  ( f "
x ) ) ) ) )
103, 9sylbi 188 . . 3  |-  ( x  e.  D  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) )
11 elssuni 3985 . . . . 5  |-  ( x  e.  D  ->  x  C_ 
U. D )
12 imass2 5180 . . . . 5  |-  ( x 
C_  U. D  ->  (
f " x ) 
C_  ( f " U. D ) )
13 sscon 3424 . . . . 5  |-  ( ( f " x ) 
C_  ( f " U. D )  ->  ( B  \  ( f " U. D ) )  C_  ( B  \  (
f " x ) ) )
1411, 12, 133syl 19 . . . 4  |-  ( x  e.  D  ->  ( B  \  ( f " U. D ) )  C_  ( B  \  (
f " x ) ) )
15 imass2 5180 . . . 4  |-  ( ( B  \  ( f
" U. D ) )  C_  ( B  \  ( f " x
) )  ->  (
g " ( B 
\  ( f " U. D ) ) ) 
C_  ( g "
( B  \  (
f " x ) ) ) )
16 sscon 3424 . . . 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 19 . . 3  |-  ( x  e.  D  ->  ( A  \  ( g "
( B  \  (
f " x ) ) ) )  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )
1810, 17sstrd 3301 . 2  |-  ( x  e.  D  ->  x  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )
191, 18mprgbir 2719 1  |-  U. D  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649    e. wcel 1717   {cab 2373   _Vcvv 2899    \ cdif 3260    C_ wss 3263   U.cuni 3957   "cima 4821
This theorem is referenced by:  sbthlem2  7154  sbthlem3  7155  sbthlem5  7157
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2368
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2374  df-cleq 2380  df-clel 2383  df-nfc 2512  df-ral 2654  df-rab 2658  df-v 2901  df-dif 3266  df-un 3268  df-in 3270  df-ss 3277  df-nul 3572  df-if 3683  df-sn 3763  df-pr 3764  df-op 3766  df-uni 3958  df-br 4154  df-opab 4208  df-xp 4824  df-cnv 4826  df-dm 4828  df-rn 4829  df-res 4830  df-ima 4831
  Copyright terms: Public domain W3C validator