Theorem ssundif 4415

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.

Step	Hyp	Ref	Expression
1		pm5.6 998	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶)))
2		eldif 3893	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
3	2	imbi1i 349	. . . 4 ⊢ ((𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐶) ↔ ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐶))
4		elun 4079	. . . . 5 ⊢ (𝑥 ∈ (𝐵 ∪ 𝐶) ↔ (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶))
5	4	imbi2i 335	. . . 4 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∪ 𝐶)) ↔ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐵 ∨ 𝑥 ∈ 𝐶)))
6	1, 3, 5	3bitr4ri 303	. . 3 ⊢ ((𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∪ 𝐶)) ↔ (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐶))
7	6	albii 1823	. 2 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∪ 𝐶)) ↔ ∀𝑥(𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐶))
8		dfss2 3903	. 2 ⊢ (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ (𝐵 ∪ 𝐶)))
9		dfss2 3903	. 2 ⊢ ((𝐴 ∖ 𝐵) ⊆ 𝐶 ↔ ∀𝑥(𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐶))
10	7, 8, 9	3bitr4i 302	1 ⊢ (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ∖ 𝐵) ⊆ 𝐶)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843  ∀wal 1537   ∈ wcel 2108   ∖ cdif 3880   ∪ cun 3881   ⊆ wss 3883

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-tru 1542  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900

This theorem is referenced by:  difcom  4416  uneqdifeq  4420  ssunsn2  4757  elpwun  7597  soex  7742  ressuppssdif  7972  ssfi  8918  frfi  8989  cantnfp1lem3  9368  dfacfin7  10086  zornn0g  10192  fpwwe2lem12  10329  hashbclem  14092  incexclem  15476  ramub1lem1  16655  lpcls  22423  cmpcld  22461  alexsubALTlem3  23108  restmetu  23632  uniiccdif  24647  abelthlem2  25496  abelthlem3  25497  pmtrcnelor  31262  imadifss  35679  frege124d  41258