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

Theorem sbthlem1 7219
Description: Lemma for sbth 7229. (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 4047 . 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 2545 . . . 4  |-  ( x  e.  D  <->  ( x  C_  A  /\  ( g
" ( B  \ 
( f " x
) ) )  C_  ( A  \  x
) ) )
4 difss2 3478 . . . . . . 7  |-  ( ( g " ( B 
\  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  (
g " ( B 
\  ( f "
x ) ) ) 
C_  A )
5 ssconb 3482 . . . . . . . 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 607 . . . . . . 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 31 . . . . . 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 47 . . . . 5  |-  ( x 
C_  A  ->  (
( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x )  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) ) )
98imp 420 . . . 4  |-  ( ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) )  ->  x  C_  ( A  \ 
( g " ( B  \  ( f "
x ) ) ) ) )
103, 9sylbi 189 . . 3  |-  ( x  e.  D  ->  x  C_  ( A  \  (
g " ( B 
\  ( f "
x ) ) ) ) )
11 elssuni 4045 . . . . 5  |-  ( x  e.  D  ->  x  C_ 
U. D )
12 imass2 5242 . . . . 5  |-  ( x 
C_  U. D  ->  (
f " x ) 
C_  ( f " U. D ) )
13 sscon 3483 . . . . 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 5242 . . . 4  |-  ( ( B  \  ( f
" U. D ) )  C_  ( B  \  ( f " x
) )  ->  (
g " ( B 
\  ( f " U. D ) ) ) 
C_  ( g "
( B  \  (
f " x ) ) ) )
16 sscon 3483 . . . 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 3360 . 2  |-  ( x  e.  D  ->  x  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )
191, 18mprgbir 2778 1  |-  U. D  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 360    = wceq 1653    e. wcel 1726   {cab 2424   _Vcvv 2958    \ cdif 3319    C_ wss 3322   U.cuni 4017   "cima 4883
This theorem is referenced by:  sbthlem2  7220  sbthlem3  7221  sbthlem5  7223
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ral 2712  df-rab 2716  df-v 2960  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-br 4215  df-opab 4269  df-xp 4886  df-cnv 4888  df-dm 4890  df-rn 4891  df-res 4892  df-ima 4893
  Copyright terms: Public domain W3C validator