| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > snsspr2 | Structured version Visualization version GIF version | ||
| Description: A singleton is a subset of an unordered pair containing its member. (Contributed by NM, 2-May-2009.) |
| Ref | Expression |
|---|---|
| snsspr2 | ⊢ {𝐵} ⊆ {𝐴, 𝐵} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssun2 4140 | . 2 ⊢ {𝐵} ⊆ ({𝐴} ∪ {𝐵}) | |
| 2 | df-pr 4594 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 3 | 1, 2 | sseqtrri 3994 | 1 ⊢ {𝐵} ⊆ {𝐴, 𝐵} |
| Colors of variables: wff setvar class |
| Syntax hints: ∪ cun 3911 ⊆ wss 3913 {csn 4591 {cpr 4593 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-v 3465 df-un 3918 df-ss 3930 df-pr 4594 |
| This theorem is referenced by: snsstp2 4784 ord3ex 5356 ltrelxr 11266 2strop 17285 phlip 17400 prdsco 17517 ipotset 18585 gsumpr 20021 lsppratlem4 21248 ex-res 30729 esplyind 33906 subfacp1lem2a 35567 dvh3dim3N 42108 algvsca 43790 corclrcl 44318 mnuprdlem4 44870 |
| Copyright terms: Public domain | W3C validator |