MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  snsspr2 Structured version   Visualization version   GIF version

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

Proof of Theorem snsspr2
StepHypRef Expression
1 ssun2 4126 . 2 {𝐵} ⊆ ({𝐴} ∪ {𝐵})
2 df-pr 4576 . 2 {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
31, 2sseqtrri 3981 1 {𝐵} ⊆ {𝐴, 𝐵}
Colors of variables: wff setvar class
Syntax hints:  cun 3897  wss 3899  {csn 4573  {cpr 4575
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-v 3435  df-un 3904  df-ss 3916  df-pr 4576
This theorem is referenced by:  snsstp2  4766  ord3ex  5322  ltrelxr  11164  2strop  17127  phlip  17242  prdsco  17359  ipotset  18426  gsumpr  19821  lsppratlem4  21041  ex-res  30372  subfacp1lem2a  35170  dvh3dim3N  41445  algvsca  43168  corclrcl  43697  mnuprdlem4  44265
  Copyright terms: Public domain W3C validator