![]() |
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 4871 | . . 3 ⊢ ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}} |
4 | 3 | unieqi 4920 | . 2 ⊢ ∪ ⟨𝐴, 𝐵⟩ = ∪ {{𝐴}, {𝐴, 𝐵}} |
5 | snex 5430 | . . 3 ⊢ {𝐴} ∈ V | |
6 | prex 5431 | . . 3 ⊢ {𝐴, 𝐵} ∈ V | |
7 | 5, 6 | unipr 4925 | . 2 ⊢ ∪ {{𝐴}, {𝐴, 𝐵}} = ({𝐴} ∪ {𝐴, 𝐵}) |
8 | snsspr1 4816 | . . 3 ⊢ {𝐴} ⊆ {𝐴, 𝐵} | |
9 | ssequn1 4179 | . . 3 ⊢ ({𝐴} ⊆ {𝐴, 𝐵} ↔ ({𝐴} ∪ {𝐴, 𝐵}) = {𝐴, 𝐵}) | |
10 | 8, 9 | mpbi 229 | . 2 ⊢ ({𝐴} ∪ {𝐴, 𝐵}) = {𝐴, 𝐵} |
11 | 4, 7, 10 | 3eqtri 2764 | 1 ⊢ ∪ ⟨𝐴, 𝐵⟩ = {𝐴, 𝐵} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∪ cun 3945 ⊆ wss 3947 {csn 4627 {cpr 4629 ⟨cop 4633 ∪ cuni 4907 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-v 3476 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 |
This theorem is referenced by: uniopel 5515 elvvuni 5750 dmrnssfld 5967 dffv2 6983 rankxplim 9870 |
Copyright terms: Public domain | W3C validator |