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

Theorem ssundif 4488
Description: A condition equivalent to inclusion in the union of two classes. (Contributed by NM, 26-Mar-2007.)
Assertion
Ref Expression
ssundif (𝐴 ⊆ (𝐵𝐶) ↔ (𝐴𝐵) ⊆ 𝐶)

Proof of Theorem ssundif
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 pm5.6 1004 . . . 4 (((𝑥𝐴 ∧ ¬ 𝑥𝐵) → 𝑥𝐶) ↔ (𝑥𝐴 → (𝑥𝐵𝑥𝐶)))
2 eldif 3961 . . . . 5 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥𝐵))
32imbi1i 349 . . . 4 ((𝑥 ∈ (𝐴𝐵) → 𝑥𝐶) ↔ ((𝑥𝐴 ∧ ¬ 𝑥𝐵) → 𝑥𝐶))
4 elun 4153 . . . . 5 (𝑥 ∈ (𝐵𝐶) ↔ (𝑥𝐵𝑥𝐶))
54imbi2i 336 . . . 4 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ (𝑥𝐴 → (𝑥𝐵𝑥𝐶)))
61, 3, 53bitr4ri 304 . . 3 ((𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ (𝑥 ∈ (𝐴𝐵) → 𝑥𝐶))
76albii 1819 . 2 (∀𝑥(𝑥𝐴𝑥 ∈ (𝐵𝐶)) ↔ ∀𝑥(𝑥 ∈ (𝐴𝐵) → 𝑥𝐶))
8 df-ss 3968 . 2 (𝐴 ⊆ (𝐵𝐶) ↔ ∀𝑥(𝑥𝐴𝑥 ∈ (𝐵𝐶)))
9 df-ss 3968 . 2 ((𝐴𝐵) ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ (𝐴𝐵) → 𝑥𝐶))
107, 8, 93bitr4i 303 1 (𝐴 ⊆ (𝐵𝐶) ↔ (𝐴𝐵) ⊆ 𝐶)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848  wal 1538  wcel 2108  cdif 3948  cun 3949  wss 3951
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1543  df-ex 1780  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-v 3482  df-dif 3954  df-un 3956  df-ss 3968
This theorem is referenced by:  difcom  4489  uneqdifeq  4493  ssunsn2  4827  f1imadifssran  6652  elpwun  7789  soex  7943  ressuppssdif  8210  ssfi  9213  frfi  9321  cantnfp1lem3  9720  dfacfin7  10439  zornn0g  10545  fpwwe2lem12  10682  hashbclem  14491  incexclem  15872  ramub1lem1  17064  lpcls  23372  cmpcld  23410  alexsubALTlem3  24057  restmetu  24583  uniiccdif  25613  abelthlem2  26476  abelthlem3  26477  pmtrcnelor  33111  imadifss  37602  frege124d  43774
  Copyright terms: Public domain W3C validator