![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uniop | Structured version Visualization version GIF version |
Description: The union of an ordered pair. Theorem 65 of [Suppes] p. 39. (Contributed by NM, 17-Aug-2004.) (Revised by Mario Carneiro, 26-Apr-2015.) |
Ref | Expression |
---|---|
opthw.1 | ⊢ 𝐴 ∈ V |
opthw.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
uniop | ⊢ ∪ 〈𝐴, 𝐵〉 = {𝐴, 𝐵} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opthw.1 | . . . 4 ⊢ 𝐴 ∈ V | |
2 | opthw.2 | . . . 4 ⊢ 𝐵 ∈ V | |
3 | 1, 2 | dfop 4877 | . . 3 ⊢ 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}} |
4 | 3 | unieqi 4924 | . 2 ⊢ ∪ 〈𝐴, 𝐵〉 = ∪ {{𝐴}, {𝐴, 𝐵}} |
5 | snex 5442 | . . 3 ⊢ {𝐴} ∈ V | |
6 | prex 5443 | . . 3 ⊢ {𝐴, 𝐵} ∈ V | |
7 | 5, 6 | unipr 4929 | . 2 ⊢ ∪ {{𝐴}, {𝐴, 𝐵}} = ({𝐴} ∪ {𝐴, 𝐵}) |
8 | snsspr1 4819 | . . 3 ⊢ {𝐴} ⊆ {𝐴, 𝐵} | |
9 | ssequn1 4196 | . . 3 ⊢ ({𝐴} ⊆ {𝐴, 𝐵} ↔ ({𝐴} ∪ {𝐴, 𝐵}) = {𝐴, 𝐵}) | |
10 | 8, 9 | mpbi 230 | . 2 ⊢ ({𝐴} ∪ {𝐴, 𝐵}) = {𝐴, 𝐵} |
11 | 4, 7, 10 | 3eqtri 2767 | 1 ⊢ ∪ 〈𝐴, 𝐵〉 = {𝐴, 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2106 Vcvv 3478 ∪ cun 3961 ⊆ wss 3963 {csn 4631 {cpr 4633 〈cop 4637 ∪ cuni 4912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-v 3480 df-dif 3966 df-un 3968 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 |
This theorem is referenced by: uniopel 5526 elvvuni 5765 dmrnssfld 5987 dffv2 7004 rankxplim 9917 |
Copyright terms: Public domain | W3C validator |