Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj931 Unicode version

Theorem bnj931 29118
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj931.1  |-  A  =  ( B  u.  C
)
Assertion
Ref Expression
bnj931  |-  B  C_  A

Proof of Theorem bnj931
StepHypRef Expression
1 ssun1 3351 . 2  |-  B  C_  ( B  u.  C
)
2 bnj931.1 . 2  |-  A  =  ( B  u.  C
)
31, 2sseqtr4i 3224 1  |-  B  C_  A
Colors of variables: wff set class
Syntax hints:    = wceq 1632    u. cun 3163    C_ wss 3165
This theorem is referenced by:  bnj945  29121  bnj545  29243  bnj548  29245  bnj570  29253  bnj929  29284  bnj1136  29343  bnj1408  29382  bnj1442  29395
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-v 2803  df-un 3170  df-in 3172  df-ss 3179
  Copyright terms: Public domain W3C validator