Theorem bnj1146 32983

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

Hypothesis

Ref	Expression
bnj1146.1	⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)

Assertion

Ref	Expression
bnj1146	⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵

Distinct variable groups:   𝑦,𝐴   𝑥,𝐵,𝑦

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem bnj1146

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1916	. . . . . 6 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)
2		bnj1146.1	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
3	2	nf5i 2141	. . . . . . 7 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
4		nfv 1916	. . . . . . 7 ⊢ Ⅎ𝑥 𝑤 ∈ 𝐵
5	3, 4	nfan 1901	. . . . . 6 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)
6		eleq1w 2819	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
7	6	anbi1d 630	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)))
8	1, 5, 7	cbvexv1 2338	. . . . 5 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
9		df-rex 3071	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
10		df-rex 3071	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
11	8, 9, 10	3bitr4i 302	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵)
12	11	abbii 2806	. . 3 ⊢ {𝑤 ∣ ∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵} = {𝑤 ∣ ∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵}
13		df-iun 4940	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑤 ∣ ∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵}
14		df-iun 4940	. . 3 ⊢ ∪ 𝑦 ∈ 𝐴 𝐵 = {𝑤 ∣ ∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵}
15	12, 13, 14	3eqtr4i 2774	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 𝐵
16		bnj1143 32982	. 2 ⊢ ∪ 𝑦 ∈ 𝐴 𝐵 ⊆ 𝐵
17	15, 16	eqsstri 3965	1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵

Syntax hints:   → wi 4   ∧ wa 396  ∀wal 1538  ∃wex 1780   ∈ wcel 2105  {cab 2713  ∃wrex 3070   ⊆ wss 3897  ∪ ciun 4938

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-clab 2714  df-cleq 2728  df-clel 2814  df-ne 2941  df-ral 3062  df-rex 3071  df-v 3443  df-dif 3900  df-in 3904  df-ss 3914  df-nul 4269  df-iun 4940

This theorem is referenced by:  bnj1145  33185