Theorem pwtpss 3930

Description: The power set of an unordered triple. (Contributed by Jim Kingdon, 13-Aug-2018.)

Assertion

Ref	Expression
pwtpss	⊢ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ⊆ 𝒫 {𝐴, 𝐵, 𝐶}

Proof of Theorem pwtpss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sstpr 3880	. . 3 ⊢ ((((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))) → 𝑥 ⊆ {𝐴, 𝐵, 𝐶})
2		elun 3370	. . . 4 ⊢ (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∨ 𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})))
3		elun 3370	. . . . . 6 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}))
4		vex 2824	. . . . . . . 8 ⊢ 𝑥 ∈ V
5	4	elpr 3729	. . . . . . 7 ⊢ (𝑥 ∈ {∅, {𝐴}} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
6	4	elpr 3729	. . . . . . 7 ⊢ (𝑥 ∈ {{𝐵}, {𝐴, 𝐵}} ↔ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))
7	5, 6	orbi12i 776	. . . . . 6 ⊢ ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
8	3, 7	bitri 184	. . . . 5 ⊢ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
9		elun 3370	. . . . . 6 ⊢ (𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ (𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ∨ 𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}))
10	4	elpr 3729	. . . . . . 7 ⊢ (𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ↔ (𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}))
11	4	elpr 3729	. . . . . . 7 ⊢ (𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}} ↔ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))
12	10, 11	orbi12i 776	. . . . . 6 ⊢ ((𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ∨ 𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶})))
13	9, 12	bitri 184	. . . . 5 ⊢ (𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶})))
14	8, 13	orbi12i 776	. . . 4 ⊢ ((𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∨ 𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))))
15	2, 14	bitri 184	. . 3 ⊢ (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))))
16	4	elpw 3694	. . 3 ⊢ (𝑥 ∈ 𝒫 {𝐴, 𝐵, 𝐶} ↔ 𝑥 ⊆ {𝐴, 𝐵, 𝐶})
17	1, 15, 16	3imtr4i 201	. 2 ⊢ (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) → 𝑥 ∈ 𝒫 {𝐴, 𝐵, 𝐶})
18	17	ssriv 3252	1 ⊢ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ⊆ 𝒫 {𝐴, 𝐵, 𝐶}

Syntax hints:   ∨ wo 720   = wceq 1402   ∈ wcel 2209   ∪ cun 3218   ⊆ wss 3220  ∅c0 3520  𝒫 cpw 3688  {csn 3708  {cpr 3709  {ctp 3710

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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-3or 1010  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-tp 3716

This theorem is referenced by: (None)