Theorem difunieq 36558

Description: The difference of unions is a subset of the union of the difference. (Contributed by ML, 29-Mar-2021.)

Assertion

Ref	Expression
difunieq	⊢ (∪ 𝐴 ∖ ∪ 𝐵) ⊆ ∪ (𝐴 ∖ 𝐵)

Proof of Theorem difunieq

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluni 4910	. . . 4 ⊢ (𝑥 ∈ ∪ 𝐴 ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴))
2		eluni 4910	. . . . 5 ⊢ (𝑥 ∈ ∪ 𝐵 ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))
3	2	notbii 319	. . . 4 ⊢ (¬ 𝑥 ∈ ∪ 𝐵 ↔ ¬ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))
4		alinexa 1843	. . . . . 6 ⊢ (∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵) ↔ ¬ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))
5		nfa1 2146	. . . . . . 7 ⊢ Ⅎ𝑦∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵)
6		sp 2174	. . . . . . . . . 10 ⊢ (∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵) → (𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵))
7	6	adantrd 490	. . . . . . . . 9 ⊢ (∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → ¬ 𝑦 ∈ 𝐵))
8	7	ancld 549	. . . . . . . 8 ⊢ (∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∧ ¬ 𝑦 ∈ 𝐵)))
9		anass 467	. . . . . . . 8 ⊢ (((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∧ ¬ 𝑦 ∈ 𝐵) ↔ (𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
10	8, 9	imbitrdi 250	. . . . . . 7 ⊢ (∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))))
11	5, 10	eximd 2207	. . . . . 6 ⊢ (∀𝑦(𝑥 ∈ 𝑦 → ¬ 𝑦 ∈ 𝐵) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → ∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))))
12	4, 11	sylbir 234	. . . . 5 ⊢ (¬ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → ∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))))
13	12	impcom 406	. . . 4 ⊢ ((∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) ∧ ¬ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)) → ∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
14	1, 3, 13	syl2anb 596	. . 3 ⊢ ((𝑥 ∈ ∪ 𝐴 ∧ ¬ 𝑥 ∈ ∪ 𝐵) → ∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
15		eldif 3957	. . 3 ⊢ (𝑥 ∈ (∪ 𝐴 ∖ ∪ 𝐵) ↔ (𝑥 ∈ ∪ 𝐴 ∧ ¬ 𝑥 ∈ ∪ 𝐵))
16		eluni 4910	. . . 4 ⊢ (𝑥 ∈ ∪ (𝐴 ∖ 𝐵) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∖ 𝐵)))
17		eldif 3957	. . . . . 6 ⊢ (𝑦 ∈ (𝐴 ∖ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))
18	17	anbi2i 621	. . . . 5 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∖ 𝐵)) ↔ (𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
19	18	exbii 1848	. . . 4 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (𝐴 ∖ 𝐵)) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
20	16, 19	bitri 274	. . 3 ⊢ (𝑥 ∈ ∪ (𝐴 ∖ 𝐵) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)))
21	14, 15, 20	3imtr4i 291	. 2 ⊢ (𝑥 ∈ (∪ 𝐴 ∖ ∪ 𝐵) → 𝑥 ∈ ∪ (𝐴 ∖ 𝐵))
22	21	ssriv 3985	1 ⊢ (∪ 𝐴 ∖ ∪ 𝐵) ⊆ ∪ (𝐴 ∖ 𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394  ∀wal 1537  ∃wex 1779   ∈ wcel 2104   ∖ cdif 3944   ⊆ wss 3947  ∪ cuni 4907

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 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-12 2169  ax-ext 2701

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 844  df-tru 1542  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2708  df-cleq 2722  df-clel 2808  df-v 3474  df-dif 3950  df-in 3954  df-ss 3964  df-uni 4908

This theorem is referenced by:  inunissunidif  36559