ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  pwtpss GIF version

Theorem pwtpss 3656
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.
StepHypRef Expression
1 sstpr 3607 . . 3 ((((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))) → 𝑥 ⊆ {𝐴, 𝐵, 𝐶})
2 elun 3142 . . . 4 (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∨ 𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})))
3 elun 3142 . . . . . 6 (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ (𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}))
4 vex 2623 . . . . . . . 8 𝑥 ∈ V
54elpr 3471 . . . . . . 7 (𝑥 ∈ {∅, {𝐴}} ↔ (𝑥 = ∅ ∨ 𝑥 = {𝐴}))
64elpr 3471 . . . . . . 7 (𝑥 ∈ {{𝐵}, {𝐴, 𝐵}} ↔ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵}))
75, 6orbi12i 717 . . . . . 6 ((𝑥 ∈ {∅, {𝐴}} ∨ 𝑥 ∈ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
83, 7bitri 183 . . . . 5 (𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ↔ ((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})))
9 elun 3142 . . . . . 6 (𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ (𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ∨ 𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}))
104elpr 3471 . . . . . . 7 (𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ↔ (𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}))
114elpr 3471 . . . . . . 7 (𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}} ↔ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))
1210, 11orbi12i 717 . . . . . 6 ((𝑥 ∈ {{𝐶}, {𝐴, 𝐶}} ∨ 𝑥 ∈ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶})))
139, 12bitri 183 . . . . 5 (𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}}) ↔ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶})))
148, 13orbi12i 717 . . . 4 ((𝑥 ∈ ({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∨ 𝑥 ∈ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))))
152, 14bitri 183 . . 3 (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ↔ (((𝑥 = ∅ ∨ 𝑥 = {𝐴}) ∨ (𝑥 = {𝐵} ∨ 𝑥 = {𝐴, 𝐵})) ∨ ((𝑥 = {𝐶} ∨ 𝑥 = {𝐴, 𝐶}) ∨ (𝑥 = {𝐵, 𝐶} ∨ 𝑥 = {𝐴, 𝐵, 𝐶}))))
164elpw 3439 . . 3 (𝑥 ∈ 𝒫 {𝐴, 𝐵, 𝐶} ↔ 𝑥 ⊆ {𝐴, 𝐵, 𝐶})
171, 15, 163imtr4i 200 . 2 (𝑥 ∈ (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) → 𝑥 ∈ 𝒫 {𝐴, 𝐵, 𝐶})
1817ssriv 3030 1 (({∅, {𝐴}} ∪ {{𝐵}, {𝐴, 𝐵}}) ∪ ({{𝐶}, {𝐴, 𝐶}} ∪ {{𝐵, 𝐶}, {𝐴, 𝐵, 𝐶}})) ⊆ 𝒫 {𝐴, 𝐵, 𝐶}
Colors of variables: wff set class
Syntax hints:  wo 665   = wceq 1290  wcel 1439  cun 2998  wss 3000  c0 3287  𝒫 cpw 3433  {csn 3450  {cpr 3451  {ctp 3452
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 580  ax-in2 581  ax-io 666  ax-5 1382  ax-7 1383  ax-gen 1384  ax-ie1 1428  ax-ie2 1429  ax-8 1441  ax-10 1442  ax-11 1443  ax-i12 1444  ax-bndl 1445  ax-4 1446  ax-17 1465  ax-i9 1469  ax-ial 1473  ax-i5r 1474  ax-ext 2071
This theorem depends on definitions:  df-bi 116  df-3or 926  df-tru 1293  df-nf 1396  df-sb 1694  df-clab 2076  df-cleq 2082  df-clel 2085  df-nfc 2218  df-v 2622  df-dif 3002  df-un 3004  df-in 3006  df-ss 3013  df-nul 3288  df-pw 3435  df-sn 3456  df-pr 3457  df-tp 3458
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator