Theorem iuneq12df 4978

Description: Equality deduction for indexed union, deduction version. (Contributed by Thierry Arnoux, 31-Dec-2016.)

Hypotheses

Ref	Expression
iuneq12df.1	⊢ Ⅎ𝑥𝜑
iuneq12df.2	⊢ Ⅎ𝑥𝐴
iuneq12df.3	⊢ Ⅎ𝑥𝐵
iuneq12df.4	⊢ (𝜑 → 𝐴 = 𝐵)
iuneq12df.5	⊢ (𝜑 → 𝐶 = 𝐷)

Assertion

Ref	Expression
iuneq12df	⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

Proof of Theorem iuneq12df

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iuneq12df.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2		iuneq12df.2	. . . 4 ⊢ Ⅎ𝑥𝐴
3		iuneq12df.3	. . . 4 ⊢ Ⅎ𝑥𝐵
4		iuneq12df.4	. . . 4 ⊢ (𝜑 → 𝐴 = 𝐵)
5		iuneq12df.5	. . . . 5 ⊢ (𝜑 → 𝐶 = 𝐷)
6	5	eleq2d 2847	. . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷))
7	1, 2, 3, 4, 6	rexeqbid 3345	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
8	7	alrimiv 1960	. 2 ⊢ (𝜑 → ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
9		abbi 2826	. . 3 ⊢ (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷})
10		df-iun 4953	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶}
11		df-iun 4953	. . 3 ⊢ ∪ 𝑥 ∈ 𝐵 𝐷 = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷}
12	9, 10, 11	3eqtr4g 2821	. 2 ⊢ (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)
13	8, 12	syl 18	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2145  {cab 2739  Ⅎwnfc 2908  ∃wrex 3087  ∪ ciun 4951

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-iun 4953

This theorem is used by:  iunxdif3  5055  iundisjf  33183  aciunf1  33257  measvuni  34847  iuneq2f  39088