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 38443
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 5956 . . 3 (𝑆 ∩ (𝑅𝐴)) = ((𝑆𝑅) ↾ 𝐴)
21ineqcomi 4163 . 2 ((𝑅𝐴) ∩ 𝑆) = ((𝑆𝑅) ↾ 𝐴)
3 incom 4161 . . 3 (𝑅𝑆) = (𝑆𝑅)
43reseq1i 5934 . 2 ((𝑅𝑆) ↾ 𝐴) = ((𝑆𝑅) ↾ 𝐴)
52, 4eqtr4i 2762 1 ((𝑅𝐴) ∩ 𝑆) = ((𝑅𝑆) ↾ 𝐴)
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  cin 3900  cres 5626
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rab 3400  df-v 3442  df-in 3908  df-res 5636
This theorem is referenced by:  xrnres  38610
  Copyright terms: Public domain W3C validator