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

Theorem ssunpr 4305
 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 4128 . . . . . 6 {𝐶, 𝐷} = ({𝐶} ∪ {𝐷})
21uneq2i 3726 . . . . 5 (𝐵 ∪ {𝐶, 𝐷}) = (𝐵 ∪ ({𝐶} ∪ {𝐷}))
3 unass 3732 . . . . 5 ((𝐵 ∪ {𝐶}) ∪ {𝐷}) = (𝐵 ∪ ({𝐶} ∪ {𝐷}))
42, 3eqtr4i 2635 . . . 4 (𝐵 ∪ {𝐶, 𝐷}) = ((𝐵 ∪ {𝐶}) ∪ {𝐷})
54sseq2i 3593 . . 3 (𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷}) ↔ 𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}))
65anbi2i 726 . 2 ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷})) ↔ (𝐵𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})))
7 ssunsn2 4299 . 2 ((𝐵𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})) ↔ ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶})) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}))))
8 ssunsn 4300 . . 3 ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶})) ↔ (𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})))
9 un23 3734 . . . . . 6 ((𝐵 ∪ {𝐶}) ∪ {𝐷}) = ((𝐵 ∪ {𝐷}) ∪ {𝐶})
109sseq2i 3593 . . . . 5 (𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}) ↔ 𝐴 ⊆ ((𝐵 ∪ {𝐷}) ∪ {𝐶}))
1110anbi2i 726 . . . 4 (((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})) ↔ ((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐷}) ∪ {𝐶})))
12 ssunsn 4300 . . . 4 (((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐷}) ∪ {𝐶})) ↔ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = ((𝐵 ∪ {𝐷}) ∪ {𝐶})))
134, 9eqtr2i 2633 . . . . . 6 ((𝐵 ∪ {𝐷}) ∪ {𝐶}) = (𝐵 ∪ {𝐶, 𝐷})
1413eqeq2i 2622 . . . . 5 (𝐴 = ((𝐵 ∪ {𝐷}) ∪ {𝐶}) ↔ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))
1514orbi2i 540 . . . 4 ((𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = ((𝐵 ∪ {𝐷}) ∪ {𝐶})) ↔ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷})))
1611, 12, 153bitri 285 . . 3 (((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷})) ↔ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷})))
178, 16orbi12i 542 . 2 (((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶})) ∨ ((𝐵 ∪ {𝐷}) ⊆ 𝐴𝐴 ⊆ ((𝐵 ∪ {𝐶}) ∪ {𝐷}))) ↔ ((𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})) ∨ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))))
186, 7, 173bitri 285 1 ((𝐵𝐴𝐴 ⊆ (𝐵 ∪ {𝐶, 𝐷})) ↔ ((𝐴 = 𝐵𝐴 = (𝐵 ∪ {𝐶})) ∨ (𝐴 = (𝐵 ∪ {𝐷}) ∨ 𝐴 = (𝐵 ∪ {𝐶, 𝐷}))))
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   ∨ wo 382   ∧ wa 383   = wceq 1475   ∪ cun 3538   ⊆ wss 3540  {csn 4125  {cpr 4127 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-sn 4126  df-pr 4128 This theorem is referenced by:  sspr  4306  sstp  4307
 Copyright terms: Public domain W3C validator