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

Theorem sbthlemi8 6957
Description: Lemma for isbth 6960. (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 5284 . . . 4  |-  ( Fun  `' f  ->  Fun  `' ( f  |`  U. D
) )
21ad2antlr 489 . . 3  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' ( f  |`  U. D ) )
3 funcnvcnv 5271 . . . . . 6  |-  ( Fun  g  ->  Fun  `' `' g )
4 funres11 5284 . . . . . 6  |-  ( Fun  `' `' g  ->  Fun  `' ( `' g  |`  ( A 
\  U. D ) ) )
53, 4syl 14 . . . . 5  |-  ( Fun  g  ->  Fun  `' ( `' g  |`  ( A 
\  U. D ) ) )
65ad2antrr 488 . . . 4  |-  ( ( ( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  ->  Fun  `' ( `' g  |`  ( A  \  U. D
) ) )
76ad2antrl 490 . . 3  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' ( `' g  |`  ( A  \  U. D ) ) )
8 simpll 527 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  -> EXMID )
9 simprll 537 . . . . 5  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  -> 
( Fun  g  /\  dom  g  =  B
) )
109simprd 114 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  dom  g  =  B
)
11 simprlr 538 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  ran  g  C_  A )
12 simprr 531 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' g )
13 df-ima 4636 . . . . . . 7  |-  ( f
" U. D )  =  ran  ( f  |`  U. D )
14 df-rn 4634 . . . . . . 7  |-  ran  (
f  |`  U. D )  =  dom  `' ( f  |`  U. D )
1513, 14eqtr2i 2199 . . . . . 6  |-  dom  `' ( f  |`  U. D
)  =  ( f
" U. D )
16 df-ima 4636 . . . . . . . 8  |-  ( `' g " ( A 
\  U. D ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) )
17 df-rn 4634 . . . . . . . 8  |-  ran  ( `' g  |`  ( A 
\  U. D ) )  =  dom  `' ( `' g  |`  ( A 
\  U. D ) )
1816, 17eqtri 2198 . . . . . . 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 6953 . . . . . . 7  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( `' g " ( A  \  U. D ) )  =  ( B 
\  ( f " U. D ) ) )
2218, 21eqtr3id 2224 . . . . . 6  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  dom  `' ( `' g  |`  ( A  \  U. D
) )  =  ( B  \  ( f
" U. D ) ) )
23 ineq12 3331 . . . . . 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 414 . . . . 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 3495 . . . . 5  |-  ( ( f " U. D
)  i^i  ( B  \  ( f " U. D ) ) )  =  (/)
2624, 25eqtrdi 2226 . . . 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 1243 . . 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 5256 . . 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 1237 . 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 4798 . . . 4  |-  `' H  =  `' ( ( f  |`  U. D )  u.  ( `' g  |`  ( A  \  U. D
) ) )
32 cnvun 5030 . . . 4  |-  `' ( ( f  |`  U. D
)  u.  ( `' g  |`  ( A  \ 
U. D ) ) )  =  ( `' ( f  |`  U. D
)  u.  `' ( `' g  |`  ( A 
\  U. D ) ) )
3331, 32eqtri 2198 . . 3  |-  `' H  =  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A  \ 
U. D ) ) )
3433funeqi 5233 . 2  |-  ( Fun  `' H  <->  Fun  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A  \ 
U. D ) ) ) )
3529, 34sylibr 134 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 104    /\ w3a 978    = wceq 1353    e. wcel 2148   {cab 2163   _Vcvv 2737    \ cdif 3126    u. cun 3127    i^i cin 3128    C_ wss 3129   (/)c0 3422   U.cuni 3807  EXMIDwem 4191   `'ccnv 4622   dom cdm 4623   ran crn 4624    |` cres 4625   "cima 4626   Fun wfun 5206
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206
This theorem depends on definitions:  df-bi 117  df-stab 831  df-dc 835  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2739  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-exmid 4192  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-fun 5214
This theorem is referenced by:  sbthlemi9  6958
  Copyright terms: Public domain W3C validator