| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > inres2 | Structured version Visualization version GIF version | ||
| Description: Two ways of expressing the restriction of an intersection. (Contributed by Peter Mazsa, 5-Jun-2021.) |
| Ref | Expression |
|---|---|
| inres2 | ⊢ ((𝑅 ↾ 𝐴) ∩ 𝑆) = ((𝑅 ∩ 𝑆) ↾ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | inres 5983 | . . 3 ⊢ (𝑆 ∩ (𝑅 ↾ 𝐴)) = ((𝑆 ∩ 𝑅) ↾ 𝐴) | |
| 2 | 1 | ineqcomi 4163 | . 2 ⊢ ((𝑅 ↾ 𝐴) ∩ 𝑆) = ((𝑆 ∩ 𝑅) ↾ 𝐴) |
| 3 | incom 4161 | . . 3 ⊢ (𝑅 ∩ 𝑆) = (𝑆 ∩ 𝑅) | |
| 4 | 3 | reseq1i 5961 | . 2 ⊢ ((𝑅 ∩ 𝑆) ↾ 𝐴) = ((𝑆 ∩ 𝑅) ↾ 𝐴) |
| 5 | 2, 4 | eqtr4i 2788 | 1 ⊢ ((𝑅 ↾ 𝐴) ∩ 𝑆) = ((𝑅 ∩ 𝑆) ↾ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1560 ∩ cin 3903 ↾ cres 5649 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1563 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3456 df-in 3911 df-res 5659 |
| This theorem is referenced by: xrnres 38924 |
| Copyright terms: Public domain | W3C validator |