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

Theorem rescom 4738
Description: Commutative law for restriction. (Contributed by NM, 27-Mar-1998.)
Assertion
Ref Expression
rescom  |-  ( ( A  |`  B )  |`  C )  =  ( ( A  |`  C )  |`  B )

Proof of Theorem rescom
StepHypRef Expression
1 incom 3192 . . 3  |-  ( B  i^i  C )  =  ( C  i^i  B
)
21reseq2i 4710 . 2  |-  ( A  |`  ( B  i^i  C
) )  =  ( A  |`  ( C  i^i  B ) )
3 resres 4725 . 2  |-  ( ( A  |`  B )  |`  C )  =  ( A  |`  ( B  i^i  C ) )
4 resres 4725 . 2  |-  ( ( A  |`  C )  |`  B )  =  ( A  |`  ( C  i^i  B ) )
52, 3, 43eqtr4i 2118 1  |-  ( ( A  |`  B )  |`  C )  =  ( ( A  |`  C )  |`  B )
Colors of variables: wff set class
Syntax hints:    = wceq 1289    i^i cin 2998    |` cres 4440
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-sep 3957  ax-pow 4009  ax-pr 4036
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-nf 1395  df-sb 1693  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ral 2364  df-rex 2365  df-v 2621  df-un 3003  df-in 3005  df-ss 3012  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-opab 3900  df-xp 4444  df-rel 4445  df-res 4450
This theorem is referenced by:  resabs2  4743  setscom  11534
  Copyright terms: Public domain W3C validator