ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  unss1 Unicode version

Theorem unss1 3350
Description: Subclass law for union of classes. (Contributed by NM, 14-Oct-1999.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Assertion
Ref Expression
unss1  |-  ( A 
C_  B  ->  ( A  u.  C )  C_  ( B  u.  C
) )

Proof of Theorem unss1
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 ssel 3195 . . . 4  |-  ( A 
C_  B  ->  (
x  e.  A  ->  x  e.  B )
)
21orim1d 789 . . 3  |-  ( A 
C_  B  ->  (
( x  e.  A  \/  x  e.  C
)  ->  ( x  e.  B  \/  x  e.  C ) ) )
3 elun 3322 . . 3  |-  ( x  e.  ( A  u.  C )  <->  ( x  e.  A  \/  x  e.  C ) )
4 elun 3322 . . 3  |-  ( x  e.  ( B  u.  C )  <->  ( x  e.  B  \/  x  e.  C ) )
52, 3, 43imtr4g 205 . 2  |-  ( A 
C_  B  ->  (
x  e.  ( A  u.  C )  ->  x  e.  ( B  u.  C ) ) )
65ssrdv 3207 1  |-  ( A 
C_  B  ->  ( A  u.  C )  C_  ( B  u.  C
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 710    e. wcel 2178    u. cun 3172    C_ wss 3174
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-v 2778  df-un 3178  df-in 3180  df-ss 3187
This theorem is referenced by:  unss2  3352  unss12  3353  undif1ss  3543  eldifpw  4542  tposss  6355  dftpos4  6372  plyss  15325
  Copyright terms: Public domain W3C validator