MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  resdifdi Structured version   Visualization version   GIF version

Theorem resdifdi 6256
Description: Distributive law for restriction over difference. (Contributed by BTernaryTau, 15-Aug-2024.)
Assertion
Ref Expression
resdifdi (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶))

Proof of Theorem resdifdi
StepHypRef Expression
1 df-res 5670 . . 3 (𝐴 ↾ (𝐵 ∖ 𝐶)) = (𝐴 ∩ ((𝐵 ∖ 𝐶) × V))
2 difxp1 6174 . . . 4 ((𝐵 ∖ 𝐶) × V) = ((𝐵 × V) ∖ (𝐶 × V))
32ineq2i 4117 . . 3 (𝐴 ∩ ((𝐵 ∖ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∖ (𝐶 × V)))
4 indifdi 4242 . . 3 (𝐴 ∩ ((𝐵 × V) ∖ (𝐶 × V))) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V)))
51, 3, 43eqtri 2790 . 2 (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V)))
6 df-res 5670 . . 3 (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V))
7 df-res 5670 . . 3 (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V))
86, 7difeq12i 4064 . 2 ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∖ (𝐴 ∩ (𝐶 × V)))
95, 8eqtr4i 2789 1 (𝐴 ↾ (𝐵 ∖ 𝐶)) = ((𝐴 ↾ 𝐵) ∖ (𝐴 ↾ 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3454   ∖ cdif 4048   ∩ cin 4092   × cxp 5656   ↾ cres 5660
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-opab 5174  df-xp 5664  df-rel 5665  df-res 5670
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator