| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resdifcom | Structured version Visualization version GIF version | ||
| Description: Commutative law for restriction and difference. (Contributed by AV, 7-Jun-2021.) |
| Ref | Expression |
|---|---|
| resdifcom | ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indif1 4229 | . 2 ⊢ ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶) | |
| 2 | df-res 5666 | . 2 ⊢ ((𝐴 ∖ 𝐶) ↾ 𝐵) = ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) | |
| 3 | df-res 5666 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
| 4 | 3 | difeq1i 4061 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶) |
| 5 | 1, 2, 4 | 3eqtr4ri 2797 | 1 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 Vcvv 3453 ∖ cdif 4047 ∩ cin 4091 × cxp 5652 ↾ cres 5656 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3455 df-dif 4049 df-in 4093 df-res 5666 |
| This theorem is used by: setsfun0 17362 cycpmrn 33757 tocyccntz 33758 |
| Copyright terms: Public domain | W3C validator |