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 38583
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 38582 . 2 ((𝐴𝐵) = ∅ → ((𝑅𝐴) ∩ (𝑅𝐵)) = ∅)
2 disjdif2 4421 . 2 (((𝑅𝐴) ∩ (𝑅𝐵)) = ∅ → ((𝑅𝐴) ∖ (𝑅𝐵)) = (𝑅𝐴))
31, 2syl 17 1 ((𝐴𝐵) = ∅ → ((𝑅𝐴) ∖ (𝑅𝐵)) = (𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  cdif 3887  cin 3889  c0 4274  cres 5627
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 2709  ax-sep 5232  ax-pr 5371
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 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-opab 5149  df-xp 5631  df-rel 5632  df-res 5637
This theorem is referenced by:  disjresundif  38584
  Copyright terms: Public domain W3C validator