Theorem resdisj 5172

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	|- ( ( A i^i B ) = (/) -> ( ( C |` A ) |` B ) = (/) )

Proof of Theorem resdisj

Step	Hyp	Ref	Expression
1		resres 5031	. 2 |- ( ( C |` A ) |` B ) = ( C |` ( A i^i B ) )
2		reseq2 5014	. . 3 |- ( ( A i^i B ) = (/) -> ( C |` ( A i^i B ) ) = ( C |` (/) ) )
3		res0 5023	. . 3 |- ( C |` (/) ) = (/)
4	2, 3	eqtrdi 2280	. 2 |- ( ( A i^i B ) = (/) -> ( C |` ( A i^i B ) ) = (/) )
5	1, 4	eqtrid 2276	1 |- ( ( A i^i B ) = (/) -> ( ( C |` A ) |` B ) = (/) )

Syntax hints:   -> wi 4   = wceq 1398   i^i cin 3200   (/)c0 3496   |` cres 4733

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-opab 4156  df-xp 4737  df-rel 4738  df-res 4743

This theorem is referenced by:  fvsnun1  5859