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 4248 | . 2 ⊢ ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶) | |
2 | df-res 5567 | . 2 ⊢ ((𝐴 ∖ 𝐶) ↾ 𝐵) = ((𝐴 ∖ 𝐶) ∩ (𝐵 × V)) | |
3 | df-res 5567 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
4 | 3 | difeq1i 4095 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∩ (𝐵 × V)) ∖ 𝐶) |
5 | 1, 2, 4 | 3eqtr4ri 2855 | 1 ⊢ ((𝐴 ↾ 𝐵) ∖ 𝐶) = ((𝐴 ∖ 𝐶) ↾ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 Vcvv 3494 ∖ cdif 3933 ∩ cin 3935 × cxp 5553 ↾ cres 5557 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-in 3943 df-res 5567 |
This theorem is referenced by: setsfun0 16519 cycpmrn 30785 tocyccntz 30786 |
Copyright terms: Public domain | W3C validator |