Theorem snsspr2 4776

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

Step	Hyp	Ref	Expression
1		ssun2 4125	. 2 ⊢ {𝐵} ⊆ ({𝐴} ∪ {𝐵})
2		df-pr 4587	. 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵})
3	1, 2	sseqtrri 3980	1 ⊢ {𝐵} ⊆ {𝐴, 𝐵}

This proof depends on syntax axioms:   ∪ cun 3897   ⊆ wss 3899  {csn 4584  {cpr 4586

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-un 3904  df-ss 3916  df-pr 4587

This theorem is used by:  snsstp2  4778  ord3ex  5352  ltrelxr  11294  2strop  17321  phlip  17436  prdsco  17553  ipotset  18621  gsumpr  20082  lsppratlem4  21337  ex-res  30921  esplyind  34085  subfacp1lem2a  35759  dvh3dim3N  42322  algvsca  44019  corclrcl  44547  mnuprdlem4  45099