Theorem resdisj 5049

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 4912	. 2 |- ( ( C |` A ) |` B ) = ( C |` ( A i^i B ) )
2		reseq2 4895	. . 3 |- ( ( A i^i B ) = (/) -> ( C |` ( A i^i B ) ) = ( C |` (/) ) )
3		res0 4904	. . 3 |- ( C |` (/) ) = (/)
4	2, 3	eqtrdi 2224	. 2 |- ( ( A i^i B ) = (/) -> ( C |` ( A i^i B ) ) = (/) )
5	1, 4	eqtrid 2220	1 |- ( ( A i^i B ) = (/) -> ( ( C |` A ) |` B ) = (/) )

Syntax hints:   -> wi 4   = wceq 1353   i^i cin 3126   (/)c0 3420   |` cres 4622

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 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-14 2149  ax-ext 2157  ax-sep 4116  ax-pow 4169  ax-pr 4203

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ral 2458  df-rex 2459  df-v 2737  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-nul 3421  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-opab 4060  df-xp 4626  df-rel 4627  df-res 4632

This theorem is referenced by:  fvsnun1  5705