MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rescom Structured version   Visualization version   GIF version

Theorem rescom 6009
Description: Commutative law for restriction. (Contributed by NM, 27-Mar-1998.)
Assertion
Ref Expression
rescom ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵)

Proof of Theorem rescom
StepHypRef Expression
1 incom 4109 . . 3 (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
21reseq2i 5983 . 2 (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ↾ (𝐶 ∩ 𝐵))
3 resres 5999 . 2 ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ (𝐵 ∩ 𝐶))
4 resres 5999 . 2 ((𝐴 ↾ 𝐶) ↾ 𝐵) = (𝐴 ↾ (𝐶 ∩ 𝐵))
52, 3, 43eqtr4i 2796 1 ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∩ cin 4092   ↾ cres 5660
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-opab 5174  df-xp 5664  df-rel 5665  df-res 5670
This theorem is used by:  resabs2  6017  setscom  17402  dvres3a  26289  cpnres  26312  dvmptres3  26331  limsupresuz  46986  liminfresuz  47067  tposresg  50322
  Copyright terms: Public domain W3C validator