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

Theorem sbthlem3 7211
Description: Lemma for sbth 7219. (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
sbthlem3  |-  ( ran  g  C_  A  ->  ( g " ( B 
\  ( f " U. D ) ) )  =  ( A  \  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 sbthlem3
StepHypRef Expression
1 sbthlem.1 . . . . . 6  |-  A  e. 
_V
2 sbthlem.2 . . . . . 6  |-  D  =  { x  |  ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) ) }
31, 2sbthlem2 7210 . . . . 5  |-  ( ran  g  C_  A  ->  ( A  \  ( g
" ( B  \ 
( f " U. D ) ) ) )  C_  U. D )
41, 2sbthlem1 7209 . . . . 5  |-  U. D  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) )
53, 4jctil 524 . . . 4  |-  ( ran  g  C_  A  ->  ( U. D  C_  ( A  \  ( g "
( B  \  (
f " U. D
) ) ) )  /\  ( A  \ 
( g " ( B  \  ( f " U. D ) ) ) )  C_  U. D ) )
6 eqss 3355 . . . 4  |-  ( U. D  =  ( A  \  ( g " ( B  \  ( f " U. D ) ) ) )  <->  ( U. D  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) )  /\  ( A 
\  ( g "
( B  \  (
f " U. D
) ) ) ) 
C_  U. D ) )
75, 6sylibr 204 . . 3  |-  ( ran  g  C_  A  ->  U. D  =  ( A 
\  ( g "
( B  \  (
f " U. D
) ) ) ) )
87difeq2d 3457 . 2  |-  ( ran  g  C_  A  ->  ( A  \  U. D
)  =  ( A 
\  ( A  \ 
( g " ( B  \  ( f " U. D ) ) ) ) ) )
9 imassrn 5208 . . . 4  |-  ( g
" ( B  \ 
( f " U. D ) ) ) 
C_  ran  g
10 sstr2 3347 . . . 4  |-  ( ( g " ( B 
\  ( f " U. D ) ) ) 
C_  ran  g  ->  ( ran  g  C_  A  ->  ( g " ( B  \  ( f " U. D ) ) ) 
C_  A ) )
119, 10ax-mp 8 . . 3  |-  ( ran  g  C_  A  ->  ( g " ( B 
\  ( f " U. D ) ) ) 
C_  A )
12 dfss4 3567 . . 3  |-  ( ( g " ( B 
\  ( f " U. D ) ) ) 
C_  A  <->  ( A  \  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )  =  ( g " ( B 
\  ( f " U. D ) ) ) )
1311, 12sylib 189 . 2  |-  ( ran  g  C_  A  ->  ( A  \  ( A 
\  ( g "
( B  \  (
f " U. D
) ) ) ) )  =  ( g
" ( B  \ 
( f " U. D ) ) ) )
148, 13eqtr2d 2468 1  |-  ( ran  g  C_  A  ->  ( g " ( B 
\  ( f " U. D ) ) )  =  ( A  \  U. D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1652    e. wcel 1725   {cab 2421   _Vcvv 2948    \ cdif 3309    C_ wss 3312   U.cuni 4007   ran crn 4871   "cima 4873
This theorem is referenced by:  sbthlem4  7212  sbthlem5  7213
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-opab 4259  df-xp 4876  df-cnv 4878  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883
  Copyright terms: Public domain W3C validator