Theorem pwtp 4861

Description: The power set of an unordered triple. (Contributed by Mario Carneiro, 2-Jul-2016.)

Assertion

Ref	Expression
pwtp	⊢ 𝒫 {𝐴, 𝐵, 𝐶} = (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}))

Proof of Theorem pwtp

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		velpw 4561	. . 3 ⊢ (𝑥 ∈ 𝒫 {𝐴, 𝐵, 𝐶} ↔ 𝑥 ⊆ {𝐴, 𝐵, 𝐶})
2		elun 4099	. . . . . 6 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}))
3		vex 3454	. . . . . . . 8 ⊢ 𝑥 ∈ V
4	3	elpr 4608	. . . . . . 7 ⊢ (𝑥 ∈ {∅, {𝐴}} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
5	3	elpr 4608	. . . . . . 7 ⊢ (𝑥 ∈ {{𝐵}, {𝐴, 𝐵}} ↔ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))
6	4, 5	orbi12i 928	. . . . . 6 ⊢ ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
7	2, 6	bitri 278	. . . . 5 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
8		elun 4099	. . . . . 6 ⊢ (𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ (𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ∨ 𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}))
9	3	elpr 4608	. . . . . . 7 ⊢ (𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ↔ (𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}))
10	3	elpr 4608	. . . . . . 7 ⊢ (𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}} ↔ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))
11	9, 10	orbi12i 928	. . . . . 6 ⊢ ((𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ∨ 𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶})))
12	8, 11	bitri 278	. . . . 5 ⊢ (𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶})))
13	7, 12	orbi12i 928	. . . 4 ⊢ ((𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∨ 𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))))
14		elun 4099	. . . 4 ⊢ (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∨ 𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})))
15		sstp 4795	. . . 4 ⊢ (𝑥 ⊆ {𝐴, 𝐵, 𝐶} ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))))
16	13, 14, 15	3bitr4ri 307	. . 3 ⊢ (𝑥 ⊆ {𝐴, 𝐵, 𝐶} ↔ 𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})))
17	1, 16	bitri 278	. 2 ⊢ (𝑥 ∈ 𝒫 {𝐴, 𝐵, 𝐶} ↔ 𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})))
18	17	eqriv 2757	1 ⊢ 𝒫 {𝐴, 𝐵, 𝐶} = (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}))

This proof depends on syntax axioms:   ∨ wo 861   = wceq 1570   ∈ wcel 2145   ∪ cun 3896   ⊆ wss 3898  ∅c0 4278  𝒫 cpw 4556  {csn 4583  {cpr 4585  {ctp 4587

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-pw 4558  df-sn 4584  df-pr 4586  df-tp 4588

This theorem is used by:  ex-pw  30964