Theorem disjresdif 38784

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

Step	Hyp	Ref	Expression
1		disjresdisj 38783	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ 𝐴) ∩ (𝑅 ↾ 𝐵)) = ∅)
2		disjdif2 4446	. 2 ⊢ (((𝑅 ↾ 𝐴) ∩ (𝑅 ↾ 𝐵)) = ∅ → ((𝑅 ↾ 𝐴) ∖ (𝑅 ↾ 𝐵)) = (𝑅 ↾ 𝐴))
3	1, 2	syl 18	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝑅 ↾ 𝐴) ∖ (𝑅 ↾ 𝐵)) = (𝑅 ↾ 𝐴))

Syntax hints:   → wi 4   = wceq 1567   ∖ cdif 3910   ∩ cin 3912  ∅c0 4294   ↾ cres 5664

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5178  df-xp 5668  df-rel 5669  df-res 5674

This theorem is referenced by:  disjresundif  38785