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

Theorem sbthlemi4 6937
Description: Lemma for isbth 6944. (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 4624 . 2  |-  ( `' g " ( A 
\  U. D ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) )
2 difss 3253 . . . . . . . 8  |-  ( B 
\  ( f " U. D ) )  C_  B
3 sseq2 3171 . . . . . . . 8  |-  ( dom  g  =  B  -> 
( ( B  \ 
( f " U. D ) )  C_  dom  g  <->  ( B  \ 
( f " U. D ) )  C_  B ) )
42, 3mpbiri 167 . . . . . . 7  |-  ( dom  g  =  B  -> 
( B  \  (
f " U. D
) )  C_  dom  g )
5 ssdmres 4913 . . . . . . 7  |-  ( ( B  \  ( f
" U. D ) )  C_  dom  g  <->  dom  ( g  |`  ( B  \  (
f " U. D
) ) )  =  ( B  \  (
f " U. D
) ) )
64, 5sylib 121 . . . . . 6  |-  ( dom  g  =  B  ->  dom  ( g  |`  ( B  \  ( f " U. D ) ) )  =  ( B  \ 
( f " U. D ) ) )
7 dfdm4 4803 . . . . . 6  |-  dom  (
g  |`  ( B  \ 
( f " U. D ) ) )  =  ran  `' ( g  |`  ( B  \  ( f " U. D ) ) )
86, 7eqtr3di 2218 . . . . 5  |-  ( dom  g  =  B  -> 
( B  \  (
f " U. D
) )  =  ran  `' ( g  |`  ( B  \  ( f " U. D ) ) ) )
98adantr 274 . . . 4  |-  ( ( dom  g  =  B  /\  ran  g  C_  A )  ->  ( B  \  ( f " U. D ) )  =  ran  `' ( g  |`  ( B  \  (
f " U. D
) ) ) )
1093ad2ant2 1014 . . 3  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( B  \  ( f " U. D ) )  =  ran  `' ( g  |`  ( B  \  (
f " U. D
) ) ) )
11 funcnvres 5271 . . . . . . 7  |-  ( Fun  `' g  ->  `' ( g  |`  ( B  \  ( f " U. D ) ) )  =  ( `' g  |`  ( g " ( B  \  ( f " U. D ) ) ) ) )
12113ad2ant3 1015 . . . . . 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 6936 . . . . . . . 8  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( g " ( B  \ 
( f " U. D ) ) )  =  ( A  \  U. D ) )
1615reseq2d 4891 . . . . . . 7  |-  ( (EXMID  /\ 
ran  g  C_  A
)  ->  ( `' g  |`  ( g "
( B  \  (
f " U. D
) ) ) )  =  ( `' g  |`  ( A  \  U. D ) ) )
17163adant3 1012 . . . . . 6  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  ( `' g  |`  ( g " ( B  \  ( f " U. D ) ) ) )  =  ( `' g  |`  ( A  \ 
U. D ) ) )
1812, 17eqtrd 2203 . . . . 5  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  `' ( g  |`  ( B  \  (
f " U. D
) ) )  =  ( `' g  |`  ( A  \  U. D
) ) )
1918rneqd 4840 . . . 4  |-  ( (EXMID  /\ 
ran  g  C_  A  /\  Fun  `' g )  ->  ran  `' (
g  |`  ( B  \ 
( f " U. D ) ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) ) )
20193adant2l 1227 . . 3  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ran  `' ( g  |`  ( B  \  ( f " U. D ) ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) ) )
2110, 20eqtrd 2203 . 2  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( B  \  ( f " U. D ) )  =  ran  ( `' g  |`  ( A  \  U. D ) ) )
221, 21eqtr4id 2222 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 103    /\ w3a 973    = wceq 1348    e. wcel 2141   {cab 2156   _Vcvv 2730    \ cdif 3118    C_ wss 3121   U.cuni 3796  EXMIDwem 4180   `'ccnv 4610   dom cdm 4611   ran crn 4612    |` cres 4613   "cima 4614   Fun wfun 5192
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-stab 826  df-dc 830  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-rab 2457  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-exmid 4181  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-fun 5200
This theorem is referenced by:  sbthlemi6  6939  sbthlemi8  6941
  Copyright terms: Public domain W3C validator