Theorem bnj1146 30116

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 1830	. . . . . 6 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)
2		bnj1146.1	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
3	2	nf5i 2011	. . . . . . 7 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐴
4		nfv 1830	. . . . . . 7 ⊢ Ⅎ𝑥 𝑤 ∈ 𝐵
5	3, 4	nfan 1816	. . . . . 6 ⊢ Ⅎ𝑥(𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)
6		eleq1 2676	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
7	6	anbi1d 737	. . . . . 6 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)))
8	1, 5, 7	cbvex 2260	. . . . 5 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵) ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
9		df-rex 2902	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
10		df-rex 2902	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∃𝑦(𝑦 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
11	8, 9, 10	3bitr4i 291	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵)
12	11	abbii 2726	. . 3 ⊢ {𝑤 ∣ ∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵} = {𝑤 ∣ ∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵}
13		df-iun 4457	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑤 ∣ ∃𝑥 ∈ 𝐴 𝑤 ∈ 𝐵}
14		df-iun 4457	. . 3 ⊢ ∪ 𝑦 ∈ 𝐴 𝐵 = {𝑤 ∣ ∃𝑦 ∈ 𝐴 𝑤 ∈ 𝐵}
15	12, 13, 14	3eqtr4i 2642	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 𝐵
16		bnj1143 30115	. 2 ⊢ ∪ 𝑦 ∈ 𝐴 𝐵 ⊆ 𝐵
17	15, 16	eqsstri 3598	1 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 ⊆ 𝐵

Syntax hints:   → wi 4   ∧ wa 383  ∀wal 1473  ∃wex 1695   ∈ wcel 1977  {cab 2596  ∃wrex 2897   ⊆ wss 3540  ∪ ciun 4455

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-v 3175  df-dif 3543  df-in 3547  df-ss 3554  df-nul 3875  df-iun 4457

This theorem is referenced by:  bnj1145  30315