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

Theorem resco 5248
Description: Associative law for the restriction of a composition. (Contributed by NM, 12-Dec-2006.)
Assertion
Ref Expression
resco  |-  ( ( A  o.  B )  |`  C )  =  ( A  o.  ( B  |`  C ) )

Proof of Theorem resco
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 5047 . 2  |-  Rel  (
( A  o.  B
)  |`  C )
2 relco 5242 . 2  |-  Rel  ( A  o.  ( B  |`  C ) )
3 vex 2806 . . . . . 6  |-  x  e. 
_V
4 vex 2806 . . . . . 6  |-  y  e. 
_V
53, 4brco 4907 . . . . 5  |-  ( x ( A  o.  B
) y  <->  E. z
( x B z  /\  z A y ) )
65anbi1i 458 . . . 4  |-  ( ( x ( A  o.  B ) y  /\  x  e.  C )  <->  ( E. z ( x B z  /\  z A y )  /\  x  e.  C )
)
7 19.41v 1951 . . . 4  |-  ( E. z ( ( x B z  /\  z A y )  /\  x  e.  C )  <->  ( E. z ( x B z  /\  z A y )  /\  x  e.  C )
)
8 an32 564 . . . . . 6  |-  ( ( ( x B z  /\  z A y )  /\  x  e.  C )  <->  ( (
x B z  /\  x  e.  C )  /\  z A y ) )
9 vex 2806 . . . . . . . 8  |-  z  e. 
_V
109brres 5025 . . . . . . 7  |-  ( x ( B  |`  C ) z  <->  ( x B z  /\  x  e.  C ) )
1110anbi1i 458 . . . . . 6  |-  ( ( x ( B  |`  C ) z  /\  z A y )  <->  ( (
x B z  /\  x  e.  C )  /\  z A y ) )
128, 11bitr4i 187 . . . . 5  |-  ( ( ( x B z  /\  z A y )  /\  x  e.  C )  <->  ( x
( B  |`  C ) z  /\  z A y ) )
1312exbii 1654 . . . 4  |-  ( E. z ( ( x B z  /\  z A y )  /\  x  e.  C )  <->  E. z ( x ( B  |`  C )
z  /\  z A
y ) )
146, 7, 133bitr2i 208 . . 3  |-  ( ( x ( A  o.  B ) y  /\  x  e.  C )  <->  E. z ( x ( B  |`  C )
z  /\  z A
y ) )
154brres 5025 . . 3  |-  ( x ( ( A  o.  B )  |`  C ) y  <->  ( x ( A  o.  B ) y  /\  x  e.  C ) )
163, 4brco 4907 . . 3  |-  ( x ( A  o.  ( B  |`  C ) ) y  <->  E. z ( x ( B  |`  C ) z  /\  z A y ) )
1714, 15, 163bitr4i 212 . 2  |-  ( x ( ( A  o.  B )  |`  C ) y  <->  x ( A  o.  ( B  |`  C ) ) y )
181, 2, 17eqbrriv 4827 1  |-  ( ( A  o.  B )  |`  C )  =  ( A  o.  ( B  |`  C ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1398   E.wex 1541    e. wcel 2202   class class class wbr 4093    |` cres 4733    o. ccom 4735
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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-rel 4738  df-co 4740  df-res 4743
This theorem is referenced by:  cocnvcnv2  5255  coires1  5261  relcoi1  5275  dftpos2  6470  gfsump1  16798
  Copyright terms: Public domain W3C validator