![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > pwprss | GIF version |
Description: The power set of an unordered pair. (Contributed by Jim Kingdon, 13-Aug-2018.) |
Ref | Expression |
---|---|
pwprss | ⊢ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ⊆ 𝒫 {𝐴, 𝐵} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vex 2740 | . . . . . 6 ⊢ 𝑥 ∈ V | |
2 | 1 | elpr 3612 | . . . . 5 ⊢ (𝑥 ∈ {∅, {𝐴}} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴})) |
3 | 1 | elpr 3612 | . . . . 5 ⊢ (𝑥 ∈ {{𝐵}, {𝐴, 𝐵}} ↔ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) |
4 | 2, 3 | orbi12i 764 | . . . 4 ⊢ ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))) |
5 | ssprr 3754 | . . . 4 ⊢ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) → 𝑥 ⊆ {𝐴, 𝐵}) | |
6 | 4, 5 | sylbi 121 | . . 3 ⊢ ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) → 𝑥 ⊆ {𝐴, 𝐵}) |
7 | elun 3276 | . . 3 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}})) | |
8 | 1 | elpw 3580 | . . 3 ⊢ (𝑥 ∈ 𝒫 {𝐴, 𝐵} ↔ 𝑥 ⊆ {𝐴, 𝐵}) |
9 | 6, 7, 8 | 3imtr4i 201 | . 2 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) → 𝑥 ∈ 𝒫 {𝐴, 𝐵}) |
10 | 9 | ssriv 3159 | 1 ⊢ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ⊆ 𝒫 {𝐴, 𝐵} |
Colors of variables: wff set class |
Syntax hints: ∨ wo 708 = wceq 1353 ∈ wcel 2148 ∪ cun 3127 ⊆ wss 3129 ∅c0 3422 𝒫 cpw 3574 {csn 3591 {cpr 3592 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3576 df-sn 3597 df-pr 3598 |
This theorem is referenced by: pwpwpw0ss 3805 ord3ex 4187 |
Copyright terms: Public domain | W3C validator |