ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sbthlemi3 Unicode version

Theorem sbthlemi3 7126
Description: Lemma for isbth 7134. (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
sbthlemi3  |-  ( (EXMID  /\ 
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 sbthlemi3
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 sbthlem.1 . . . . . . 7  |-  A  e. 
_V
2 sbthlem.2 . . . . . . 7  |-  D  =  { x  |  ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) ) }
31, 2sbthlem2 7125 . . . . . 6  |-  ( ran  g  C_  A  ->  ( A  \  ( g
" ( B  \ 
( f " U. D ) ) ) )  C_  U. D )
41, 2sbthlem1 7124 . . . . . 6  |-  U. D  C_  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) )
53, 4jctil 312 . . . . 5  |-  ( ran  g  C_  A  ->  ( U. D  C_  ( A  \  ( g "
( B  \  (
f " U. D
) ) ) )  /\  ( A  \ 
( g " ( B  \  ( f " U. D ) ) ) )  C_  U. D ) )
6 eqss 3239 . . . . 5  |-  ( 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 134 . . . 4  |-  ( ran  g  C_  A  ->  U. D  =  ( A 
\  ( g "
( B  \  (
f " U. D
) ) ) ) )
87difeq2d 3322 . . 3  |-  ( ran  g  C_  A  ->  ( A  \  U. D
)  =  ( A 
\  ( A  \ 
( g " ( B  \  ( f " U. D ) ) ) ) ) )
98adantl 277 . 2  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( A  \ 
U. D )  =  ( A  \  ( A  \  ( g "
( B  \  (
f " U. D
) ) ) ) ) )
10 imassrn 5079 . . . . 5  |-  ( g
" ( B  \ 
( f " U. D ) ) ) 
C_  ran  g
11 sstr2 3231 . . . . 5  |-  ( ( g " ( B 
\  ( f " U. D ) ) ) 
C_  ran  g  ->  ( ran  g  C_  A  ->  ( g " ( B  \  ( f " U. D ) ) ) 
C_  A ) )
1210, 11ax-mp 5 . . . 4  |-  ( ran  g  C_  A  ->  ( g " ( B 
\  ( f " U. D ) ) ) 
C_  A )
13 exmidexmid 4280 . . . . . . 7  |-  (EXMID  -> DECID  y  e.  (
g " ( B 
\  ( f " U. D ) ) ) )
14 dcstab 849 . . . . . . 7  |-  (DECID  y  e.  ( g " ( B  \  ( f " U. D ) ) )  -> STAB  y  e.  ( g
" ( B  \ 
( f " U. D ) ) ) )
1513, 14syl 14 . . . . . 6  |-  (EXMID  -> STAB  y  e.  ( g " ( B  \  ( f " U. D ) ) ) )
1615alrimiv 1920 . . . . 5  |-  (EXMID  ->  A. ySTAB  y  e.  ( g " ( B  \  ( f " U. D ) ) ) )
17 dfss4st 3437 . . . . 5  |-  ( A. ySTAB  y  e.  ( g " ( B  \ 
( f " U. D ) ) )  ->  ( ( g
" ( B  \ 
( f " U. D ) ) ) 
C_  A  <->  ( A  \  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )  =  ( g " ( B 
\  ( f " U. D ) ) ) ) )
1816, 17syl 14 . . . 4  |-  (EXMID  ->  (
( g " ( B  \  ( f " U. D ) ) ) 
C_  A  <->  ( A  \  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )  =  ( g " ( B 
\  ( f " U. D ) ) ) ) )
1912, 18imbitrid 154 . . 3  |-  (EXMID  ->  ( ran  g  C_  A  -> 
( A  \  ( A  \  ( g "
( B  \  (
f " U. D
) ) ) ) )  =  ( g
" ( B  \ 
( f " U. D ) ) ) ) )
2019imp 124 . 2  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( A  \  ( A  \  (
g " ( B 
\  ( f " U. D ) ) ) ) )  =  ( g " ( B 
\  ( f " U. D ) ) ) )
219, 20eqtr2d 2263 1  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( g " ( B  \ 
( f " U. D ) ) )  =  ( A  \  U. D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105  STAB wstab 835  DECID wdc 839   A.wal 1393    = wceq 1395    e. wcel 2200   {cab 2215   _Vcvv 2799    \ cdif 3194    C_ wss 3197   U.cuni 3888  EXMIDwem 4278   ran crn 4720   "cima 4722
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293
This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-exmid 4279  df-xp 4725  df-cnv 4727  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732
This theorem is referenced by:  sbthlemi4  7127  sbthlemi5  7128
  Copyright terms: Public domain W3C validator