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

Theorem disjresdif 38566
Description: The difference between restrictions to disjoint is the first restriction. (Contributed by Peter Mazsa, 24-Jul-2024.)
Assertion
Ref Expression
disjresdif ((𝐴𝐵) = ∅ → ((𝑅𝐴) ∖ (𝑅𝐵)) = (𝑅𝐴))

Proof of Theorem disjresdif
StepHypRef Expression
1 disjresdisj 38565 . 2 ((𝐴𝐵) = ∅ → ((𝑅𝐴) ∩ (𝑅𝐵)) = ∅)
2 disjdif2 4420 . 2 (((𝑅𝐴) ∩ (𝑅𝐵)) = ∅ → ((𝑅𝐴) ∖ (𝑅𝐵)) = (𝑅𝐴))
31, 2syl 17 1 ((𝐴𝐵) = ∅ → ((𝑅𝐴) ∖ (𝑅𝐵)) = (𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  cdif 3886  cin 3888  c0 4273  cres 5633
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-opab 5148  df-xp 5637  df-rel 5638  df-res 5643
This theorem is referenced by:  disjresundif  38567
  Copyright terms: Public domain W3C validator