MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sstp Structured version   Visualization version   GIF version

Theorem sstp 4510
Description: The subsets of a triple. (Contributed by Mario Carneiro, 2-Jul-2016.)
Assertion
Ref Expression
sstp (𝐴 ⊆ {𝐵, 𝐶, 𝐷} ↔ (((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ∨ (𝐴 = {𝐶} ∨ 𝐴 = {𝐵, 𝐶})) ∨ ((𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}) ∨ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷}))))

Proof of Theorem sstp
StepHypRef Expression
1 df-tp 4324 . . 3 {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷})
21sseq2i 3769 . 2 (𝐴 ⊆ {𝐵, 𝐶, 𝐷} ↔ 𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷}))
3 0ss 4113 . . 3 ∅ ⊆ 𝐴
43biantrur 528 . 2 (𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷}) ↔ (∅ ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷})))
5 ssunsn2 4502 . . 3 ((∅ ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷})) ↔ ((∅ ⊆ 𝐴𝐴 ⊆ {𝐵, 𝐶}) ∨ ((∅ ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷}))))
63biantrur 528 . . . . 5 (𝐴 ⊆ {𝐵, 𝐶} ↔ (∅ ⊆ 𝐴𝐴 ⊆ {𝐵, 𝐶}))
7 sspr 4509 . . . . 5 (𝐴 ⊆ {𝐵, 𝐶} ↔ ((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ∨ (𝐴 = {𝐶} ∨ 𝐴 = {𝐵, 𝐶})))
86, 7bitr3i 266 . . . 4 ((∅ ⊆ 𝐴𝐴 ⊆ {𝐵, 𝐶}) ↔ ((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ∨ (𝐴 = {𝐶} ∨ 𝐴 = {𝐵, 𝐶})))
9 uncom 3898 . . . . . . . 8 (∅ ∪ {𝐷}) = ({𝐷} ∪ ∅)
10 un0 4108 . . . . . . . 8 ({𝐷} ∪ ∅) = {𝐷}
119, 10eqtri 2780 . . . . . . 7 (∅ ∪ {𝐷}) = {𝐷}
1211sseq1i 3768 . . . . . 6 ((∅ ∪ {𝐷}) ⊆ 𝐴 ↔ {𝐷} ⊆ 𝐴)
13 uncom 3898 . . . . . . 7 ({𝐵, 𝐶} ∪ {𝐷}) = ({𝐷} ∪ {𝐵, 𝐶})
1413sseq2i 3769 . . . . . 6 (𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷}) ↔ 𝐴 ⊆ ({𝐷} ∪ {𝐵, 𝐶}))
1512, 14anbi12i 735 . . . . 5 (((∅ ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷})) ↔ ({𝐷} ⊆ 𝐴𝐴 ⊆ ({𝐷} ∪ {𝐵, 𝐶})))
16 ssunpr 4508 . . . . 5 (({𝐷} ⊆ 𝐴𝐴 ⊆ ({𝐷} ∪ {𝐵, 𝐶})) ↔ ((𝐴 = {𝐷} ∨ 𝐴 = ({𝐷} ∪ {𝐵})) ∨ (𝐴 = ({𝐷} ∪ {𝐶}) ∨ 𝐴 = ({𝐷} ∪ {𝐵, 𝐶}))))
17 uncom 3898 . . . . . . . . 9 ({𝐷} ∪ {𝐵}) = ({𝐵} ∪ {𝐷})
18 df-pr 4322 . . . . . . . . 9 {𝐵, 𝐷} = ({𝐵} ∪ {𝐷})
1917, 18eqtr4i 2783 . . . . . . . 8 ({𝐷} ∪ {𝐵}) = {𝐵, 𝐷}
2019eqeq2i 2770 . . . . . . 7 (𝐴 = ({𝐷} ∪ {𝐵}) ↔ 𝐴 = {𝐵, 𝐷})
2120orbi2i 542 . . . . . 6 ((𝐴 = {𝐷} ∨ 𝐴 = ({𝐷} ∪ {𝐵})) ↔ (𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}))
22 uncom 3898 . . . . . . . . 9 ({𝐷} ∪ {𝐶}) = ({𝐶} ∪ {𝐷})
23 df-pr 4322 . . . . . . . . 9 {𝐶, 𝐷} = ({𝐶} ∪ {𝐷})
2422, 23eqtr4i 2783 . . . . . . . 8 ({𝐷} ∪ {𝐶}) = {𝐶, 𝐷}
2524eqeq2i 2770 . . . . . . 7 (𝐴 = ({𝐷} ∪ {𝐶}) ↔ 𝐴 = {𝐶, 𝐷})
261, 13eqtr2i 2781 . . . . . . . 8 ({𝐷} ∪ {𝐵, 𝐶}) = {𝐵, 𝐶, 𝐷}
2726eqeq2i 2770 . . . . . . 7 (𝐴 = ({𝐷} ∪ {𝐵, 𝐶}) ↔ 𝐴 = {𝐵, 𝐶, 𝐷})
2825, 27orbi12i 544 . . . . . 6 ((𝐴 = ({𝐷} ∪ {𝐶}) ∨ 𝐴 = ({𝐷} ∪ {𝐵, 𝐶})) ↔ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷}))
2921, 28orbi12i 544 . . . . 5 (((𝐴 = {𝐷} ∨ 𝐴 = ({𝐷} ∪ {𝐵})) ∨ (𝐴 = ({𝐷} ∪ {𝐶}) ∨ 𝐴 = ({𝐷} ∪ {𝐵, 𝐶}))) ↔ ((𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}) ∨ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷})))
3015, 16, 293bitri 286 . . . 4 (((∅ ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷})) ↔ ((𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}) ∨ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷})))
318, 30orbi12i 544 . . 3 (((∅ ⊆ 𝐴𝐴 ⊆ {𝐵, 𝐶}) ∨ ((∅ ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷}))) ↔ (((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ∨ (𝐴 = {𝐶} ∨ 𝐴 = {𝐵, 𝐶})) ∨ ((𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}) ∨ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷}))))
325, 31bitri 264 . 2 ((∅ ⊆ 𝐴𝐴 ⊆ ({𝐵, 𝐶} ∪ {𝐷})) ↔ (((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ∨ (𝐴 = {𝐶} ∨ 𝐴 = {𝐵, 𝐶})) ∨ ((𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}) ∨ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷}))))
332, 4, 323bitri 286 1 (𝐴 ⊆ {𝐵, 𝐶, 𝐷} ↔ (((𝐴 = ∅ ∨ 𝐴 = {𝐵}) ∨ (𝐴 = {𝐶} ∨ 𝐴 = {𝐵, 𝐶})) ∨ ((𝐴 = {𝐷} ∨ 𝐴 = {𝐵, 𝐷}) ∨ (𝐴 = {𝐶, 𝐷} ∨ 𝐴 = {𝐵, 𝐶, 𝐷}))))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wo 382  wa 383   = wceq 1630  cun 3711  wss 3713  c0 4056  {csn 4319  {cpr 4321  {ctp 4323
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1986  ax-6 2052  ax-7 2088  ax-9 2146  ax-10 2166  ax-11 2181  ax-12 2194  ax-13 2389  ax-ext 2738
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2045  df-clab 2745  df-cleq 2751  df-clel 2754  df-nfc 2889  df-ral 3053  df-v 3340  df-dif 3716  df-un 3718  df-in 3720  df-ss 3727  df-nul 4057  df-sn 4320  df-pr 4322  df-tp 4324
This theorem is referenced by:  pwtp  4581
  Copyright terms: Public domain W3C validator