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

Theorem sbthlemi4 7243
Description: Lemma for isbth 7250. (Contributed by NM, 27-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
sbthlemi4  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( `' g " ( A  \  U. D ) )  =  ( 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 sbthlemi4
StepHypRef Expression
1 df-ima 4767 . 2  |-  ( `' g " ( A 
\  U. D ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) )
2 difss 3349 . . . . . . . 8  |-  ( B 
\  ( f " U. D ) )  C_  B
3 sseq2 3266 . . . . . . . 8  |-  ( dom  g  =  B  -> 
( ( B  \ 
( f " U. D ) )  C_  dom  g  <->  ( B  \ 
( f " U. D ) )  C_  B ) )
42, 3mpbiri 168 . . . . . . 7  |-  ( dom  g  =  B  -> 
( B  \  (
f " U. D
) )  C_  dom  g )
5 ssdmres 5065 . . . . . . 7  |-  ( ( B  \  ( f
" U. D ) )  C_  dom  g  <->  dom  ( g  |`  ( B  \  (
f " U. D
) ) )  =  ( B  \  (
f " U. D
) ) )
64, 5sylib 122 . . . . . 6  |-  ( dom  g  =  B  ->  dom  ( g  |`  ( B  \  ( f " U. D ) ) )  =  ( B  \ 
( f " U. D ) ) )
7 dfdm4 4953 . . . . . 6  |-  dom  (
g  |`  ( B  \ 
( f " U. D ) ) )  =  ran  `' ( g  |`  ( B  \  ( f " U. D ) ) )
86, 7eqtr3di 2282 . . . . 5  |-  ( dom  g  =  B  -> 
( B  \  (
f " U. D
) )  =  ran  `' ( g  |`  ( B  \  ( f " U. D ) ) ) )
98adantr 276 . . . 4  |-  ( ( dom  g  =  B  /\  ran  g  C_  A )  ->  ( B  \  ( f " U. D ) )  =  ran  `' ( g  |`  ( B  \  (
f " U. D
) ) ) )
1093ad2ant2 1046 . . 3  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( B  \  ( f " U. D ) )  =  ran  `' ( g  |`  ( B  \  (
f " U. D
) ) ) )
11 funcnvres 5434 . . . . . . 7  |-  ( Fun  `' g  ->  `' ( g  |`  ( B  \  ( f " U. D ) ) )  =  ( `' g  |`  ( g " ( B  \  ( f " U. D ) ) ) ) )
12113ad2ant3 1047 . . . . . 6  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  `' ( g  |`  ( B  \  (
f " U. D
) ) )  =  ( `' g  |`  ( g " ( B  \  ( f " U. D ) ) ) ) )
13 sbthlem.1 . . . . . . . . 9  |-  A  e. 
_V
14 sbthlem.2 . . . . . . . . 9  |-  D  =  { x  |  ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) ) }
1513, 14sbthlemi3 7242 . . . . . . . 8  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( g " ( B  \ 
( f " U. D ) ) )  =  ( A  \  U. D ) )
1615reseq2d 5043 . . . . . . 7  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( `' g  |`  ( g "
( B  \  (
f " U. D
) ) ) )  =  ( `' g  |`  ( A  \  U. D ) ) )
17163adant3 1044 . . . . . 6  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  ( `' g  |`  ( g " ( B  \  ( f " U. D ) ) ) )  =  ( `' g  |`  ( A  \ 
U. D ) ) )
1812, 17eqtrd 2267 . . . . 5  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  `' ( g  |`  ( B  \  (
f " U. D
) ) )  =  ( `' g  |`  ( A  \  U. D
) ) )
1918rneqd 4991 . . . 4  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  ran  `' (
g  |`  ( B  \ 
( f " U. D ) ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) ) )
20193adant2l 1259 . . 3  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ran  `' ( g  |`  ( B  \  ( f " U. D ) ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) ) )
2110, 20eqtrd 2267 . 2  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( B  \  ( f " U. D ) )  =  ran  ( `' g  |`  ( A  \  U. D ) ) )
221, 21eqtr4id 2286 1  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( `' g " ( A  \  U. D ) )  =  ( B 
\  ( f " U. D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   {cab 2220   _Vcvv 2815    \ cdif 3211    C_ wss 3214   U.cuni 3919  EXMIDwem 4312   `'ccnv 4753   dom cdm 4754   ran crn 4755    |` cres 4756   "cima 4757   Fun wfun 5351
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-exmid 4313  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-fun 5359
This theorem is referenced by:  sbthlemi6  7245  sbthlemi8  7247
  Copyright terms: Public domain W3C validator