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

Theorem dmcosseq 5054
Description: Domain of a composition. (Contributed by NM, 28-May-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
dmcosseq  |-  ( ran 
B  C_  dom  A  ->  dom  ( A  o.  B
)  =  dom  B
)

Proof of Theorem dmcosseq
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dmcoss 5052 . . 3  |-  dom  ( A  o.  B )  C_ 
dom  B
21a1i 9 . 2  |-  ( ran 
B  C_  dom  A  ->  dom  ( A  o.  B
)  C_  dom  B )
3 ssel 3242 . . . . . . . 8  |-  ( ran 
B  C_  dom  A  -> 
( y  e.  ran  B  ->  y  e.  dom  A ) )
4 vex 2824 . . . . . . . . . . 11  |-  y  e. 
_V
54elrn 5025 . . . . . . . . . 10  |-  ( y  e.  ran  B  <->  E. x  x B y )
64eldm 4978 . . . . . . . . . 10  |-  ( y  e.  dom  A  <->  E. z 
y A z )
75, 6imbi12i 239 . . . . . . . . 9  |-  ( ( y  e.  ran  B  ->  y  e.  dom  A
)  <->  ( E. x  x B y  ->  E. z 
y A z ) )
8 19.8a 1643 . . . . . . . . . . 11  |-  ( x B y  ->  E. x  x B y )
98imim1i 60 . . . . . . . . . 10  |-  ( ( E. x  x B y  ->  E. z 
y A z )  ->  ( x B y  ->  E. z 
y A z ) )
10 pm3.2 139 . . . . . . . . . . 11  |-  ( x B y  ->  (
y A z  -> 
( x B y  /\  y A z ) ) )
1110eximdv 1933 . . . . . . . . . 10  |-  ( x B y  ->  ( E. z  y A
z  ->  E. z
( x B y  /\  y A z ) ) )
129, 11sylcom 28 . . . . . . . . 9  |-  ( ( E. x  x B y  ->  E. z 
y A z )  ->  ( x B y  ->  E. z
( x B y  /\  y A z ) ) )
137, 12sylbi 121 . . . . . . . 8  |-  ( ( y  e.  ran  B  ->  y  e.  dom  A
)  ->  ( x B y  ->  E. z
( x B y  /\  y A z ) ) )
143, 13syl 14 . . . . . . 7  |-  ( ran 
B  C_  dom  A  -> 
( x B y  ->  E. z ( x B y  /\  y A z ) ) )
1514eximdv 1933 . . . . . 6  |-  ( ran 
B  C_  dom  A  -> 
( E. y  x B y  ->  E. y E. z ( x B y  /\  y A z ) ) )
16 excom 1716 . . . . . 6  |-  ( E. z E. y ( x B y  /\  y A z )  <->  E. y E. z ( x B y  /\  y A z ) )
1715, 16imbitrrdi 162 . . . . 5  |-  ( ran 
B  C_  dom  A  -> 
( E. y  x B y  ->  E. z E. y ( x B y  /\  y A z ) ) )
18 vex 2824 . . . . . . 7  |-  x  e. 
_V
19 vex 2824 . . . . . . 7  |-  z  e. 
_V
2018, 19opelco 4952 . . . . . 6  |-  ( <.
x ,  z >.  e.  ( A  o.  B
)  <->  E. y ( x B y  /\  y A z ) )
2120exbii 1658 . . . . 5  |-  ( E. z <. x ,  z
>.  e.  ( A  o.  B )  <->  E. z E. y ( x B y  /\  y A z ) )
2217, 21imbitrrdi 162 . . . 4  |-  ( ran 
B  C_  dom  A  -> 
( E. y  x B y  ->  E. z <. x ,  z >.  e.  ( A  o.  B
) ) )
2318eldm 4978 . . . 4  |-  ( x  e.  dom  B  <->  E. y  x B y )
2418eldm2 4979 . . . 4  |-  ( x  e.  dom  ( A  o.  B )  <->  E. z <. x ,  z >.  e.  ( A  o.  B
) )
2522, 23, 243imtr4g 205 . . 3  |-  ( ran 
B  C_  dom  A  -> 
( x  e.  dom  B  ->  x  e.  dom  ( A  o.  B
) ) )
2625ssrdv 3254 . 2  |-  ( ran 
B  C_  dom  A  ->  dom  B  C_  dom  ( A  o.  B ) )
272, 26eqssd 3265 1  |-  ( ran 
B  C_  dom  A  ->  dom  ( A  o.  B
)  =  dom  B
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402   E.wex 1545    e. wcel 2209    C_ wss 3220   <.cop 3712   class class class wbr 4130   dom cdm 4774   ran crn 4775    o. ccom 4778
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785
This theorem is used by:  dmcoeq  5055  fnco  5491
  Copyright terms: Public domain W3C validator