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

Theorem sbthlemi8 7163
Description: Lemma for isbth 7166. (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 5402 . . . 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 5389 . . . . . 6  |-  ( Fun  g  ->  Fun  `' `' g )
4 funres11 5402 . . . . . 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 539 . . . . 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 540 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  ran  g  C_  A )
12 simprr 533 . . . 4  |-  ( ( (EXMID 
/\  Fun  `' f
)  /\  ( (
( Fun  g  /\  dom  g  =  B
)  /\  ran  g  C_  A )  /\  Fun  `' g ) )  ->  Fun  `' g )
13 df-ima 4738 . . . . . . 7  |-  ( f
" U. D )  =  ran  ( f  |`  U. D )
14 df-rn 4736 . . . . . . 7  |-  ran  (
f  |`  U. D )  =  dom  `' ( f  |`  U. D )
1513, 14eqtr2i 2253 . . . . . 6  |-  dom  `' ( f  |`  U. D
)  =  ( f
" U. D )
16 df-ima 4738 . . . . . . . 8  |-  ( `' g " ( A 
\  U. D ) )  =  ran  ( `' g  |`  ( A  \ 
U. D ) )
17 df-rn 4736 . . . . . . . 8  |-  ran  ( `' g  |`  ( A 
\  U. D ) )  =  dom  `' ( `' g  |`  ( A 
\  U. D ) )
1816, 17eqtri 2252 . . . . . . 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 7159 . . . . . . 7  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  ( `' g " ( A  \  U. D ) )  =  ( B 
\  ( f " U. D ) ) )
2218, 21eqtr3id 2278 . . . . . 6  |-  ( (EXMID  /\  ( dom  g  =  B  /\  ran  g  C_  A )  /\  Fun  `' g )  ->  dom  `' ( `' g  |`  ( A  \  U. D
) )  =  ( B  \  ( f
" U. D ) ) )
23 ineq12 3403 . . . . . 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 3567 . . . . 5  |-  ( ( f " U. D
)  i^i  ( B  \  ( f " U. D ) ) )  =  (/)
2624, 25eqtrdi 2280 . . . 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 1278 . . 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 5371 . . 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 1272 . 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 4905 . . . 4  |-  `' H  =  `' ( ( f  |`  U. D )  u.  ( `' g  |`  ( A  \  U. D
) ) )
32 cnvun 5142 . . . 4  |-  `' ( ( f  |`  U. D
)  u.  ( `' g  |`  ( A  \ 
U. D ) ) )  =  ( `' ( f  |`  U. D
)  u.  `' ( `' g  |`  ( A 
\  U. D ) ) )
3331, 32eqtri 2252 . . 3  |-  `' H  =  ( `' ( f  |`  U. D )  u.  `' ( `' g  |`  ( A  \ 
U. D ) ) )
3433funeqi 5347 . 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 1004    = wceq 1397    e. wcel 2202   {cab 2217   _Vcvv 2802    \ cdif 3197    u. cun 3198    i^i cin 3199    C_ wss 3200   (/)c0 3494   U.cuni 3893  EXMIDwem 4284   `'ccnv 4724   dom cdm 4725   ran crn 4726    |` cres 4727   "cima 4728   Fun wfun 5320
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-exmid 4285  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-fun 5328
This theorem is referenced by:  sbthlemi9  7164
  Copyright terms: Public domain W3C validator