Theorem iuneq12daf 32948

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 2851	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷))
4	1, 3	rexbida 3279	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐷))
5		iuneq12daf.4	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐵)
6		iuneq12daf.2	. . . . . 6 ⊢ Ⅎ𝑥𝐴
7		iuneq12daf.3	. . . . . 6 ⊢ Ⅎ𝑥𝐵
8	6, 7	rexeqf 3348	. . . . 5 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
9	5, 8	syl 18	. . . 4 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐷 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
10	4, 9	bitrd 282	. . 3 ⊢ (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
11	10	alrimiv 1960	. 2 ⊢ (𝜑 → ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
12		abbi 2830	. . 3 ⊢ (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷})
13		df-iun 4960	. . 3 ⊢ ∪ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶}
14		df-iun 4960	. . 3 ⊢ ∪ 𝑥 ∈ 𝐵 𝐷 = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷}
15	12, 13, 14	3eqtr4g 2825	. 2 ⊢ (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)
16	11, 15	syl 18	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2146  {cab 2743  Ⅎwnfc 2912  ∃wrex 3091  ∪ ciun 4958

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

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 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-iun 4960

This theorem is used by:  measvunilem0  34644