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

Theorem ssunpr 4839
Description: Possible values for a set sandwiched between another set and it plus a singleton. (Contributed by Mario Carneiro, 2-Jul-2016.)
Assertion
Ref Expression
ssunpr ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷})) ↔ ((𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})) ∨ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))))

Proof of Theorem ssunpr
StepHypRef Expression
1 df-pr 4634 . . . . . 6 {𝐶, 𝐷} = ({𝐶} ∪ {𝐷})
21uneq2i 4175 . . . . 5 (𝐵 ∪ {𝐶, 𝐷}) = (𝐵 ∪ ({𝐶} ∪ {𝐷}))
3 unass 4182 . . . . 5 ((𝐵 ∪ {𝐶}) ∪ {𝐷}) = (𝐵 ∪ ({𝐶} ∪ {𝐷}))
42, 3eqtr4i 2766 . . . 4 (𝐵 ∪ {𝐶, 𝐷}) = ((𝐵 ∪ {𝐶}) ∪ {𝐷})
54sseq2i 4025 . . 3 (𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷}) ↔ 𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}))
65anbi2i 623 . 2 ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷})) ↔ (𝐵𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})))
7 ssunsn2 4832 . 2 ((𝐵𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})) ↔ ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶})) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}))))
8 ssunsn 4833 . . 3 ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶})) ↔ (𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})))
9 un23 4184 . . . . . 6 ((𝐵 ∪ {𝐶}) ∪ {𝐷}) = ((𝐵 ∪ {𝐷}) ∪ {𝐶})
109sseq2i 4025 . . . . 5 (𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}) ↔ 𝐴 ⊆ ((𝐵 ∪ {𝐷}) ∪ {𝐶}))
1110anbi2i 623 . . . 4 (((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})) ↔ ((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐷}) ∪ {𝐶})))
12 ssunsn 4833 . . . 4 (((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐷}) ∪ {𝐶})) ↔ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = ((𝐵 ∪ {𝐷}) ∪ {𝐶})))
134, 9eqtr2i 2764 . . . . . 6 ((𝐵 ∪ {𝐷}) ∪ {𝐶}) = (𝐵 ∪ {𝐶, 𝐷})
1413eqeq2i 2748 . . . . 5 (𝐴 = ((𝐵 ∪ {𝐷}) ∪ {𝐶}) ↔ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))
1514orbi2i 912 . . . 4 ((𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = ((𝐵 ∪ {𝐷}) ∪ {𝐶})) ↔ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷})))
1611, 12, 153bitri 297 . . 3 (((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})) ↔ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷})))
178, 16orbi12i 914 . 2 (((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶})) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}))) ↔ ((𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})) ∨ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))))
186, 7, 173bitri 297 1 ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷})) ↔ ((𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})) ∨ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  wo 847   = wceq 1537  cun 3961  wss 3963  {csn 4631  {cpr 4633
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-sn 4632  df-pr 4634
This theorem is referenced by:  sspr  4840  sstp  4841
  Copyright terms: Public domain W3C validator