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

Theorem sbthlemi8 6860
Description: Lemma for isbth 6863. (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 ) ) }
sbthlem.3  |-  H  =  ( ( f  |`  U. D )  u.  ( `' g  |`  ( A 
\  U. D ) ) )
Assertion
Ref Expression
sbthlemi8  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' H )
Distinct variable groups:    x, A    x, B    x, D    x, f    x, g    x, H
Allowed substitution hints:    A( f, g)    B( f, g)    D( f, g)    H( f, g)

Proof of Theorem sbthlemi8
StepHypRef Expression
1 funres11 5203 . . . 4  |-  ( Fun  `' f  ->  Fun  `' ( f  |`  U. D
) )
21ad2antlr 481 . . 3  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' ( f  |`  U. D ) )
3 funcnvcnv 5190 . . . . . 6  |-  ( Fun  g  ->  Fun  `' `' g )
4 funres11 5203 . . . . . 6  |-  ( Fun  `' `' g  ->  Fun  `' ( `' g  |`  ( A 
\  U. D ) ) )
53, 4syl 14 . . . . 5  |-  ( Fun  g  ->  Fun  `' ( `' g  |`  ( A 
\  U. D ) ) )
65ad2antrr 480 . . . 4  |-  ( ( ( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  ->  Fun  `' ( `' g  |`  ( A  \  U. D
) ) )
76ad2antrl 482 . . 3  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' ( `' g  |`  ( A  \  U. D ) ) )
8 simpll 519 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  -> EXMID )
9 simprll 527 . . . . 5  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  -> 
( Fun  g  /\  dom  g  =  B
) )
109simprd 113 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  dom  g  =  B
)
11 simprlr 528 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  ran  g  C_  A )
12 simprr 522 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' g )
13 df-ima 4560 . . . . . . 7  |-  ( f
" U. D )  =  ran  ( f  |`  U. D )
14 df-rn 4558 . . . . . . 7  |-  ran  (
f  |`  U. D )  =  dom  `' ( f  |`  U. D )
1513, 14eqtr2i 2162 . . . . . 6  |-  dom  `' ( f  |`  U. D
)  =  ( f
" U. D )
16 df-ima 4560 . . . . . . . 8  |-  ( `' g " ( A 
\  U. D ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) )
17 df-rn 4558 . . . . . . . 8  |-  ran  ( `' g  |`  ( A 
\  U. D ) )  =  dom  `' ( `' g  |`  ( A 
\  U. D ) )
1816, 17eqtri 2161 . . . . . . 7  |-  ( `' g " ( A 
\  U. D ) )  =  dom  `' ( `' g  |`  ( A 
\  U. D ) )
19 sbthlem.1 . . . . . . . 8  |-  A  e. 
_V
20 sbthlem.2 . . . . . . . 8  |-  D  =  { x  |  ( x  C_  A  /\  ( g " ( B  \  ( f "
x ) ) ) 
C_  ( A  \  x ) ) }
2119, 20sbthlemi4 6856 . . . . . . 7  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( `' g " ( A  \  U. D ) )  =  ( B 
\  ( f " U. D ) ) )
2218, 21syl5eqr 2187 . . . . . 6  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  dom  `' ( `' g  |`  ( A  \  U. D
) )  =  ( B  \  ( f
" U. D ) ) )
23 ineq12 3277 . . . . . 6  |-  ( ( dom  `' ( f  |`  U. D )  =  ( f " U. D )  /\  dom  `' ( `' g  |`  ( A  \  U. D
) )  =  ( B  \  ( f
" U. D ) ) )  ->  ( dom  `' ( f  |`  U. D )  i^i  dom  `' ( `' g  |`  ( A  \  U. D
) ) )  =  ( ( f " U. D )  i^i  ( B  \  ( f " U. D ) ) ) )
2415, 22, 23sylancr 411 . . . . 5  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( dom  `' ( f  |`  U. D )  i^i  dom  `' ( `' g  |`  ( A  \  U. D
) ) )  =  ( ( f " U. D )  i^i  ( B  \  ( f " U. D ) ) ) )
25 disjdif 3440 . . . . 5  |-  ( ( f " U. D
)  i^i  ( B  \  ( f " U. D ) ) )  =  (/)
2624, 25eqtrdi 2189 . . . 4  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( dom  `' ( f  |`  U. D )  i^i  dom  `' ( `' g  |`  ( A  \  U. D
) ) )  =  (/) )
278, 10, 11, 12, 26syl121anc 1222 . . 3  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  -> 
( dom  `' (
f  |`  U. D )  i^i  dom  `' ( `' g  |`  ( A 
\  U. D ) ) )  =  (/) )
28 funun 5175 . . 3  |-  ( ( ( Fun  `' ( f  |`  U. D )  /\  Fun  `' ( `' g  |`  ( A 
\  U. D ) ) )  /\  ( dom  `' ( f  |`  U. D )  i^i  dom  `' ( `' g  |`  ( A  \  U. D
) ) )  =  (/) )  ->  Fun  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A 
\  U. D ) ) ) )
292, 7, 27, 28syl21anc 1216 . 2  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A  \  U. D ) ) ) )
30 sbthlem.3 . . . . 5  |-  H  =  ( ( f  |`  U. D )  u.  ( `' g  |`  ( A 
\  U. D ) ) )
3130cnveqi 4722 . . . 4  |-  `' H  =  `' ( ( f  |`  U. D )  u.  ( `' g  |`  ( A  \  U. D
) ) )
32 cnvun 4952 . . . 4  |-  `' ( ( f  |`  U. D
)  u.  ( `' g  |`  ( A  \ 
U. D ) ) )  =  ( `' ( f  |`  U. D
)  u.  `' ( `' g  |`  ( A 
\  U. D ) ) )
3331, 32eqtri 2161 . . 3  |-  `' H  =  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A  \ 
U. D ) ) )
3433funeqi 5152 . 2  |-  ( Fun  `' H  <->  Fun  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A  \ 
U. D ) ) ) )
3529, 34sylibr 133 1  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' H )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    /\ w3a 963    = wceq 1332    e. wcel 1481   {cab 2126   _Vcvv 2689    \ cdif 3073    u. cun 3074    i^i cin 3075    C_ wss 3076   (/)c0 3368   U.cuni 3744  EXMIDwem 4126   `'ccnv 4546   dom cdm 4547   ran crn 4548    |` cres 4549   "cima 4550   Fun wfun 5125
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-stab 817  df-dc 821  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-exmid 4127  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-fun 5133
This theorem is referenced by:  sbthlemi9  6861
  Copyright terms: Public domain W3C validator