| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resdifdi | Structured version Visualization version GIF version | ||
| Description: Distributive law for restriction over difference. (Contributed by BTernaryTau, 15-Aug-2024.) |
| Ref | Expression |
|---|---|
| resdifdi | ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 5673 | . . 3 ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = (𝐴 ∩ ((𝐵 ∖ 𝐶) × V)) | |
| 2 | difxp1 6162 | . . . 4 ⊢ ((𝐵 ∖ 𝐶) × V) = ((𝐵 × V) ∖ (𝐶 × V)) | |
| 3 | 2 | ineq2i 4170 | . . 3 ⊢ (𝐴 ∩ ((𝐵 ∖ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∖ (𝐶 × V))) |
| 4 | indifdi 4247 | . . 3 ⊢ (𝐴 ∩ ((𝐵 × V) ∖ (𝐶 × V))) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V))) | |
| 5 | 1, 3, 4 | 3eqtri 2790 | . 2 ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V))) |
| 6 | df-res 5673 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
| 7 | df-res 5673 | . . 3 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 8 | 6, 7 | difeq12i 4079 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V))) |
| 9 | 5, 8 | eqtr4i 2789 | 1 ⊢ (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 Vcvv 3455 ∖ cdif 3902 ∩ cin 3904 × cxp 5659 ↾ cres 5663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5174 df-xp 5667 df-rel 5668 df-res 5673 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |