Theorem disjssun 3587

Description: Subset relation for disjoint classes. (Contributed by NM, 25-Oct-2005.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
disjssun	|- ( ( A i^i B ) = (/) -> ( A C_ ( B u. C ) <-> A C_ C ) )

Proof of Theorem disjssun

Step	Hyp	Ref	Expression
1		indi 3478	. . . . 5 |- ( A i^i ( B u. C ) ) = ( ( A i^i B ) u. ( A i^i C ) )
2	1	equncomi 3375	. . . 4 |- ( A i^i ( B u. C ) ) = ( ( A i^i C ) u. ( A i^i B ) )
3		uneq2 3377	. . . . 5 |- ( ( A i^i B ) = (/) -> ( ( A i^i C ) u. ( A i^i B ) ) = ( ( A i^i C ) u. (/) ) )
4		un0 3556	. . . . 5 |- ( ( A i^i C ) u. (/) ) = ( A i^i C )
5	3, 4	eqtrdi 2287	. . . 4 |- ( ( A i^i B ) = (/) -> ( ( A i^i C ) u. ( A i^i B ) ) = ( A i^i C ) )
6	2, 5	eqtrid 2283	. . 3 |- ( ( A i^i B ) = (/) -> ( A i^i ( B u. C ) ) = ( A i^i C ) )
7	6	eqeq1d 2247	. 2 |- ( ( A i^i B ) = (/) -> ( ( A i^i ( B u. C ) ) = A <-> ( A i^i C ) = A ) )
8		df-ss 3233	. 2 |- ( A C_ ( B u. C ) <-> ( A i^i ( B u. C ) ) = A )
9		df-ss 3233	. 2 |- ( A C_ C <-> ( A i^i C ) = A )
10	7, 8, 9	3bitr4g 223	1 |- ( ( A i^i B ) = (/) -> ( A C_ ( B u. C ) <-> A C_ C ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1402   u. cun 3218   i^i cin 3219   C_ wss 3220   (/)c0 3520

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521

This theorem is referenced by:  hashfibclem  11260