Theorem disjresin 39321

Description: The restriction to a disjoint is the empty class. (Contributed by Peter Mazsa, 24-Jul-2024.)

Assertion

Ref	Expression
disjresin	⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝑅 ↾ (𝐴 ∩ 𝐵)) = ∅)

Proof of Theorem disjresin

Step	Hyp	Ref	Expression
1		reseq2 5970	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝑅 ↾ (𝐴 ∩ 𝐵)) = (𝑅 ↾ ∅))
2		res0 5979	. 2 ⊢ (𝑅 ↾ ∅) = ∅
3	1, 2	eqtrdi 2814	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝑅 ↾ (𝐴 ∩ 𝐵)) = ∅)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∩ cin 4092  ∅c0 4281   ↾ cres 5657

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-dif 4050  df-in 4094  df-nul 4282  df-opab 5171  df-xp 5661  df-res 5667

This theorem is used by:  disjresdisj  39322