Theorem resdisj 6158

Description: A double restriction to disjoint classes is the empty set. (Contributed by NM, 7-Oct-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
resdisj	⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ↾ 𝐴) ↾ 𝐵) = ∅)

Proof of Theorem resdisj

Step	Hyp	Ref	Expression
1		reseq2 5961	. 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐶 ↾ (𝐴 ∩ 𝐵)) = (𝐶 ↾ ∅))
2		resres 5979	. 2 ⊢ ((𝐶 ↾ 𝐴) ↾ 𝐵) = (𝐶 ↾ (𝐴 ∩ 𝐵))
3		res0 5970	. . 3 ⊢ (𝐶 ↾ ∅) = ∅
4	3	eqcomi 2744	. 2 ⊢ ∅ = (𝐶 ↾ ∅)
5	1, 2, 4	3eqtr4g 2795	1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ↾ 𝐴) ↾ 𝐵) = ∅)

Syntax hints:   → wi 4   = wceq 1540   ∩ cin 3925  ∅c0 4308   ↾ cres 5656

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 2007  ax-8 2110  ax-9 2118  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pr 5402

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 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-opab 5182  df-xp 5660  df-rel 5661  df-res 5666

This theorem is referenced by:  fvsnun1  7174