Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > pwpr | Structured version Visualization version GIF version |
Description: The power set of an unordered pair. (Contributed by NM, 1-May-2009.) |
Ref | Expression |
---|---|
pwpr | ⊢ 𝒫 {𝐴, 𝐵} = ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sspr 4763 | . . . 4 ⊢ (𝑥 ⊆ {𝐴, 𝐵} ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))) | |
2 | vex 3426 | . . . . . 6 ⊢ 𝑥 ∈ V | |
3 | 2 | elpr 4581 | . . . . 5 ⊢ (𝑥 ∈ {∅, {𝐴}} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴})) |
4 | 2 | elpr 4581 | . . . . 5 ⊢ (𝑥 ∈ {{𝐵}, {𝐴, 𝐵}} ↔ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) |
5 | 3, 4 | orbi12i 911 | . . . 4 ⊢ ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))) |
6 | 1, 5 | bitr4i 277 | . . 3 ⊢ (𝑥 ⊆ {𝐴, 𝐵} ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}})) |
7 | velpw 4535 | . . 3 ⊢ (𝑥 ∈ 𝒫 {𝐴, 𝐵} ↔ 𝑥 ⊆ {𝐴, 𝐵}) | |
8 | elun 4079 | . . 3 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}})) | |
9 | 6, 7, 8 | 3bitr4i 302 | . 2 ⊢ (𝑥 ∈ 𝒫 {𝐴, 𝐵} ↔ 𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}})) |
10 | 9 | eqriv 2735 | 1 ⊢ 𝒫 {𝐴, 𝐵} = ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) |
Colors of variables: wff setvar class |
Syntax hints: ∨ wo 843 = wceq 1539 ∈ wcel 2108 ∪ cun 3881 ⊆ wss 3883 ∅c0 4253 𝒫 cpw 4530 {csn 4558 {cpr 4560 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-pw 4532 df-sn 4559 df-pr 4561 |
This theorem is referenced by: pwpwpw0 4832 ord3ex 5305 hash2pwpr 14118 pr2pwpr 14121 prsiga 31999 prsal 43749 |
Copyright terms: Public domain | W3C validator |