| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resdifdir | Structured version Visualization version GIF version | ||
| Description: Distributive law for restriction over difference. (Contributed by BTernaryTau, 15-Aug-2024.) |
| Ref | Expression |
|---|---|
| resdifdir | ⊢ ((𝐴 ∖ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∖ (𝐵 ↾ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | indifdir 4248 | . 2 ⊢ ((𝐴 ∖ 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ (𝐶 × V)) ∖ (𝐵 ∩ (𝐶 × V))) | |
| 2 | df-res 5675 | . 2 ⊢ ((𝐴 ∖ 𝐵) ↾ 𝐶) = ((𝐴 ∖ 𝐵) ∩ (𝐶 × V)) | |
| 3 | df-res 5675 | . . 3 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 4 | df-res 5675 | . . 3 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 5 | 3, 4 | difeq12i 4079 | . 2 ⊢ ((𝐴 ↾ 𝐶) ∖ (𝐵 ↾ 𝐶)) = ((𝐴 ∩ (𝐶 × V)) ∖ (𝐵 ∩ (𝐶 × V))) |
| 6 | 1, 2, 5 | 3eqtr4i 2798 | 1 ⊢ ((𝐴 ∖ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐶) ∖ (𝐵 ↾ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3457 ∖ cdif 3903 ∩ cin 3905 × cxp 5661 ↾ cres 5665 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-dif 3909 df-in 3913 df-res 5675 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |