Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  disjresundif Structured version   Visualization version   GIF version

Theorem disjresundif 38231
Description: Lemma for ressucdifsn2 38232. (Contributed by Peter Mazsa, 24-Jul-2024.)
Assertion
Ref Expression
disjresundif ((𝐴𝐵) = ∅ → ((𝑅 ↾ (𝐴𝐵)) ∖ (𝑅𝐵)) = (𝑅𝐴))

Proof of Theorem disjresundif
StepHypRef Expression
1 resundi 5964 . . . 4 (𝑅 ↾ (𝐴𝐵)) = ((𝑅𝐴) ∪ (𝑅𝐵))
21difeq1i 4085 . . 3 ((𝑅 ↾ (𝐴𝐵)) ∖ (𝑅𝐵)) = (((𝑅𝐴) ∪ (𝑅𝐵)) ∖ (𝑅𝐵))
3 difun2 4444 . . 3 (((𝑅𝐴) ∪ (𝑅𝐵)) ∖ (𝑅𝐵)) = ((𝑅𝐴) ∖ (𝑅𝐵))
42, 3eqtri 2752 . 2 ((𝑅 ↾ (𝐴𝐵)) ∖ (𝑅𝐵)) = ((𝑅𝐴) ∖ (𝑅𝐵))
5 disjresdif 38230 . 2 ((𝐴𝐵) = ∅ → ((𝑅𝐴) ∖ (𝑅𝐵)) = (𝑅𝐴))
64, 5eqtrid 2776 1 ((𝐴𝐵) = ∅ → ((𝑅 ↾ (𝐴𝐵)) ∖ (𝑅𝐵)) = (𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  cdif 3911  cun 3912  cin 3913  c0 4296  cres 5640
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5170  df-xp 5644  df-rel 5645  df-res 5650
This theorem is referenced by:  ressucdifsn2  38232
  Copyright terms: Public domain W3C validator