Theorem iuneq2df 46203

Description: Equality deduction for indexed union. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
iuneq2df.1	⊢ Ⅎ𝑥𝜑
iuneq2df.2	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶)

Assertion

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

Proof of Theorem iuneq2df

Step	Hyp	Ref	Expression
1		iuneq2df.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		iuneq2df.2	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶)
3	2	ex 418	. . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 = 𝐶))
4	1, 3	ralrimi 3263	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶)
5		iuneq2 4973	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 𝐶)
6	4, 5	syl 18	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑥 ∈ 𝐴 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  Ⅎwnf 1815   ∈ wcel 2146  ∀wral 3079  ∪ ciun 4953

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-12 2215  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-v 3455  df-ss 3900  df-iun 4955

This theorem is used by:  subsaliuncl  47507  omeiunlempt  47669  hoicvrrex  47705  ovnlecvr2  47759  smflimmpt  47959  smflimsupmpt  47978  smfliminfmpt  47981