HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem rescom 3390
Description: Commutative law for restriction.
Assertion
Ref Expression
rescom |- ((A |` B) |` C) = ((A |` C) |` B)

Proof of Theorem rescom
StepHypRef Expression
1 incom 2211 . . 3 |- (B i^i C) = (C i^i B)
2 reseq2 3375 . . 3 |- ((B i^i C) = (C i^i B) -> (A |` (B i^i C)) = (A |` (C i^i B)))
31, 2ax-mp 7 . 2 |- (A |` (B i^i C)) = (A |` (C i^i B))
4 resres 3383 . 2 |- ((A |` B) |` C) = (A |` (B i^i C))
5 resres 3383 . 2 |- ((A |` C) |` B) = (A |` (C i^i B))
63, 4, 53eqtr4 1508 1 |- ((A |` B) |` C) = ((A |` C) |` B)
Colors of variables: wff set class
Syntax hints:   = wceq 958   i^i cin 2049   |` cres 3178
This theorem is referenced by:  resabs2 3395
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-opab 2672  df-xp 3190  df-rel 3191  df-res 3196
Copyright terms: Public domain