Theorem iuneq12daf 30896

Description: Equality deduction for indexed union, deduction version. (Contributed by Thierry Arnoux, 13-Mar-2017.)

Hypotheses

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

Assertion

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

Proof of Theorem iuneq12daf

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iuneq12daf.1	. . . . 5 ⊢ Ⅎ𝑥𝜑
2		iuneq12daf.5	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 = 𝐷)
3	2	eleq2d 2824	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷))
4	1, 3	rexbida 3251	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐷))
5		iuneq12daf.4	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
6		iuneq12daf.2	. . . . . 6 ⊢ Ⅎ𝑥𝐴
7		iuneq12daf.3	. . . . . 6 ⊢ Ⅎ𝑥𝐵
8	6, 7	rexeqf 3333	. . . . 5 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
9	5, 8	syl 17	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
10	4, 9	bitrd 278	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
11	10	alrimiv 1930	. 2 ⊢ (𝜑 → ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
12		abbi1 2806	. . 3 ⊢ (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷})
13		df-iun 4926	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶}
14		df-iun 4926	. . 3 ⊢ ∪ 𝑥 ∈ 𝐵 𝐷 = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷}
15	12, 13, 14	3eqtr4g 2803	. 2 ⊢ (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)
16	11, 15	syl 17	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1537   = wceq 1539  Ⅎwnf 1786   ∈ wcel 2106  {cab 2715  Ⅎwnfc 2887  ∃wrex 3065  ∪ ciun 4924

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-rex 3070  df-iun 4926

This theorem is referenced by:  measvunilem0  32181