Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  inres2 Structured version   Visualization version   GIF version

Theorem inres2 38785
Description: Two ways of expressing the restriction of an intersection. (Contributed by Peter Mazsa, 5-Jun-2021.)
Assertion
Ref Expression
inres2 ((𝑅𝐴) ∩ 𝑆) = ((𝑅𝑆) ↾ 𝐴)

Proof of Theorem inres2
StepHypRef Expression
1 inres 5997 . . 3 (𝑆 ∩ (𝑅𝐴)) = ((𝑆𝑅) ↾ 𝐴)
21ineqcomi 4172 . 2 ((𝑅𝐴) ∩ 𝑆) = ((𝑆𝑅) ↾ 𝐴)
3 incom 4170 . . 3 (𝑅𝑆) = (𝑆𝑅)
43reseq1i 5975 . 2 ((𝑅𝑆) ↾ 𝐴) = ((𝑆𝑅) ↾ 𝐴)
52, 4eqtr4i 2795 1 ((𝑅𝐴) ∩ 𝑆) = ((𝑅𝑆) ↾ 𝐴)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1567  cin 3912  cres 5664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-rab 3424  df-v 3465  df-in 3920  df-res 5674
This theorem is referenced by:  xrnres  38963
  Copyright terms: Public domain W3C validator