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

Theorem snsspr2 3534
Description: A singleton is a subset of an unordered pair containing its member. (Contributed by NM, 2-May-2009.)
Assertion
Ref Expression
snsspr2  |-  { B }  C_  { A ,  B }

Proof of Theorem snsspr2
StepHypRef Expression
1 ssun2 3136 . 2  |-  { B }  C_  ( { A }  u.  { B } )
2 df-pr 3405 . 2  |-  { A ,  B }  =  ( { A }  u.  { B } )
31, 2sseqtr4i 3032 1  |-  { B }  C_  { A ,  B }
Colors of variables: wff set class
Syntax hints:    u. cun 2971    C_ wss 2973   {csn 3398   {cpr 3399
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pr 3405
This theorem is referenced by:  snsstp2  3536  ssprr  3548  ord3ex  3961  ltrelxr  7173
  Copyright terms: Public domain W3C validator