Theorem bnj1316 33646

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

Hypotheses

Ref	Expression
bnj1316.1	⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
bnj1316.2	⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵)

Assertion

Ref	Expression
bnj1316	⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶)

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

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)   𝐶(𝑥,𝑦)

Proof of Theorem bnj1316

Step	Hyp	Ref	Expression
1		bnj1316.1	. . . . 5 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
2	1	nfcii 2886	. . . 4 ⊢ Ⅎ𝑥𝐴
3		bnj1316.2	. . . . 5 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵)
4	3	nfcii 2886	. . . 4 ⊢ Ⅎ𝑥𝐵
5	2, 4	nfeq 2915	. . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵
6	5	nf5ri 2188	. 2 ⊢ (𝐴 = 𝐵 → ∀𝑥 𝐴 = 𝐵)
7	6	bnj956 33602	1 ⊢ (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐶)

Syntax hints:   → wi 4  ∀wal 1539   = wceq 1541   ∈ wcel 2106  ∪ ciun 4987

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-rex 3070  df-iun 4989

This theorem is referenced by:  bnj1000  33767  bnj1318  33851