Theorem bnj1143 35487

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Assertion

Ref	Expression
bnj1143	⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem bnj1143

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

Step	Hyp	Ref	Expression
1		df-iun 4956	. . . 4 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵}
2		notnotb 318	. . . . . . . 8 ⊢ (𝐴 = ∅ ↔ ¬ ¬ 𝐴 = ∅)
3		neq0 4302	. . . . . . . 8 ⊢ (¬ 𝐴 = ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴)
4	2, 3	xchbinx 337	. . . . . . 7 ⊢ (𝐴 = ∅ ↔ ¬ ∃𝑥 𝑥 ∈ 𝐴)
5		df-rex 3091	. . . . . . . . 9 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵))
6		exsimpl 1901	. . . . . . . . 9 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) → ∃𝑥 𝑥 ∈ 𝐴)
7	5, 6	sylbi 220	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐴)
8	7	con3i 155	. . . . . . 7 ⊢ (¬ ∃𝑥 𝑥 ∈ 𝐴 → ¬ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
9	4, 8	sylbi 220	. . . . . 6 ⊢ (𝐴 = ∅ → ¬ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
10	9	alrimiv 1962	. . . . 5 ⊢ (𝐴 = ∅ → ∀𝑧 ¬ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
11		notnotb 318	. . . . . . 7 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅ ↔ ¬ ¬ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅)
12		neq0 4302	. . . . . . . 8 ⊢ (¬ ∪ 𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ∃𝑧 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐵)
13	1	eqeq1i 2768	. . . . . . . . 9 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 = ∅ ↔ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅)
14	13	notbii 323	. . . . . . . 8 ⊢ (¬ ∪ 𝑥 ∈ 𝐴 𝐵 = ∅ ↔ ¬ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅)
15		df-iun 4956	. . . . . . . . . 10 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
16	15	eleq2i 2856	. . . . . . . . 9 ⊢ (𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵})
17	16	exbii 1881	. . . . . . . 8 ⊢ (∃𝑧 𝑧 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵})
18	12, 14, 17	3bitr3i 304	. . . . . . 7 ⊢ (¬ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅ ↔ ∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵})
19	11, 18	xchbinx 337	. . . . . 6 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅ ↔ ¬ ∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵})
20		alnex 1814	. . . . . 6 ⊢ (∀𝑧 ¬ 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} ↔ ¬ ∃𝑧 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵})
21		abid 2745	. . . . . . . 8 ⊢ (𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} ↔ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
22	21	notbii 323	. . . . . . 7 ⊢ (¬ 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} ↔ ¬ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
23	22	albii 1852	. . . . . 6 ⊢ (∀𝑧 ¬ 𝑧 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} ↔ ∀𝑧 ¬ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
24	19, 20, 23	3bitr2i 302	. . . . 5 ⊢ ({𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅ ↔ ∀𝑧 ¬ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
25	10, 24	sylibr 237	. . . 4 ⊢ (𝐴 = ∅ → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵} = ∅)
26	1, 25	eqtrid 2810	. . 3 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = ∅)
27		0ss 4353	. . 3 ⊢ ∅ ⊆ 𝐵
28	26, 27	eqsstrdi 3957	. 2 ⊢ (𝐴 = ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵)
29		iunconst 4964	. . 3 ⊢ (𝐴 ≠ ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = 𝐵)
30		eqimss 3971	. . 3 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵)
31	29, 30	syl 18	. 2 ⊢ (𝐴 ≠ ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵)
32	28, 31	pm2.61ine 3042	1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959  ∃wrex 3090   ⊆ wss 3900  ∅c0 4281  ∪ ciun 4954

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-dif 4050  df-nul 4282  df-iun 4956

This theorem is used by:  bnj1146  35488  bnj1145  35690  bnj1136  35694