| 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 4133 | . 2 ⊢ {𝐵} ⊆ ({𝐴} ∪ {𝐵}) | |
| 2 | df-pr 4593 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
| 3 | 1, 2 | sseqtrri 3987 | 1 ⊢ {𝐵} ⊆ {𝐴, 𝐵} |
| Colors of variables: wff setvar class |
| Syntax hints: ∪ cun 3904 ⊆ wss 3906 {csn 4590 {cpr 4592 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 df-un 3911 df-ss 3923 df-pr 4593 |
| This theorem is referenced by: snsstp2 4784 ord3ex 5360 ltrelxr 11271 2strop 17290 phlip 17405 prdsco 17522 ipotset 18590 gsumpr 20026 lsppratlem4 21255 ex-res 30773 esplyind 33946 subfacp1lem2a 35653 dvh3dim3N 42204 algvsca 43888 corclrcl 44416 mnuprdlem4 44968 |
| Copyright terms: Public domain | W3C validator |