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

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

Proof of Theorem rescom
StepHypRef Expression
1 incom 4155 . . 3 (𝐵 ∩ 𝐶) = (𝐶 ∩ 𝐵)
21reseq2i 5967 . 2 (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ↾ (𝐶 ∩ 𝐵))
3 resres 5983 . 2 ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ (𝐵 ∩ 𝐶))
4 resres 5983 . 2 ((𝐴 ↾ 𝐶) ↾ 𝐵) = (𝐴 ↾ (𝐶 ∩ 𝐵))
52, 3, 43eqtr4i 2794 1 ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ↾ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∩ cin 3898   ↾ cres 5653
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5657  df-rel 5658  df-res 5663
This theorem is used by:  resabs2  6000  setscom  17351  dvres3a  26227  cpnres  26250  dvmptres3  26269  limsupresuz  46682  liminfresuz  46763  tposresg  49955
  Copyright terms: Public domain W3C validator