Theorem unssad 3396

Description: If ( A u. B ) is contained in C, so is A. One-way deduction form of unss 3393. Partial converse of unssd 3395. (Contributed by David Moews, 1-May-2017.)

Hypothesis

Ref	Expression
unssad.1	|- ( ph -> ( A u. B ) C_ C )

Assertion

Ref	Expression
unssad	|- ( ph -> A C_ C )

Proof of Theorem unssad

Step	Hyp	Ref	Expression
1		unssad.1	. . 3 |- ( ph -> ( A u. B ) C_ C )
2		unss 3393	. . 3 |- ( ( A C_ C /\ B C_ C ) <-> ( A u. B ) C_ C )
3	1, 2	sylibr 134	. 2 |- ( ph -> ( A C_ C /\ B C_ C ) )
4	3	simpld 112	1 |- ( ph -> A C_ C )

Syntax hints:   -> wi 4   /\ wa 104   u. cun 3209   C_ wss 3211

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-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-ext 2214

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-un 3215  df-in 3217  df-ss 3224

This theorem is referenced by:  ersym  6779  findcard2d  7148  findcard2sd  7149  diffifi  7151  sumsplitdc  12118  fsumabs  12151  fsumiun  12163