Theorem unieqOLD 4836

Description: Obsolete version of unieq 4835 as of 13-Aprl-2024. (Contributed by NM, 10-Aug-1993.) (Proof modification is discouraged.) (New usage is discouraged.) 29-Jun-2011.)

Assertion

Ref	Expression
unieqOLD	⊢ (𝐴 = 𝐵 → ∪ 𝐴 = ∪ 𝐵)

Proof of Theorem unieqOLD

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

Step	Hyp	Ref	Expression
1		rexeq 3406	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝑥))
2	1	abbidv 2885	. 2 ⊢ (𝐴 = 𝐵 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥} = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝑥})
3		dfuni2 4826	. 2 ⊢ ∪ 𝐴 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝑥}
4		dfuni2 4826	. 2 ⊢ ∪ 𝐵 = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝑥}
5	2, 3, 4	3eqtr4g 2881	1 ⊢ (𝐴 = 𝐵 → ∪ 𝐴 = ∪ 𝐵)

Syntax hints:   → wi 4   = wceq 1537  {cab 2799  ∃wrex 3139  ∪ cuni 4824

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 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1781  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-rex 3144  df-uni 4825

This theorem is referenced by: (None)