Theorem resdisj 5039

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 4903	. 2 |- ( ( C |` A ) |` B ) = ( C |` ( A i^i B ) )
2		reseq2 4886	. . 3 |- ( ( A i^i B ) = (/) -> ( C |` ( A i^i B ) ) = ( C |` (/) ) )
3		res0 4895	. . 3 |- ( C |` (/) ) = (/)
4	2, 3	eqtrdi 2219	. 2 |- ( ( A i^i B ) = (/) -> ( C |` ( A i^i B ) ) = (/) )
5	1, 4	eqtrid 2215	1 |- ( ( A i^i B ) = (/) -> ( ( C |` A ) |` B ) = (/) )

Syntax hints:   -> wi 4   = wceq 1348   i^i cin 3120   (/)c0 3414   |` cres 4613

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-opab 4051  df-xp 4617  df-rel 4618  df-res 4623

This theorem is referenced by:  fvsnun1  5693