MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iuneq12df Structured version   Visualization version   GIF version

Theorem iuneq12df 4983
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.
StepHypRef Expression
1 iuneq12df.1 . . . 4 Ⅎ𝑥𝜑
2 iuneq12df.2 . . . 4 Ⅎ𝑥𝐴
3 iuneq12df.3 . . . 4 Ⅎ𝑥𝐵
4 iuneq12df.4 . . . 4 (𝜑 → 𝐴 = 𝐵)
5 iuneq12df.5 . . . . 5 (𝜑 → 𝐶 = 𝐷)
65eleq2d 2850 . . . 4 (𝜑 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷))
71, 2, 3, 4, 6rexeqbid 3348 . . 3 (𝜑 → (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
87alrimiv 1962 . 2 (𝜑 → ∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷))
9 abbi 2828 . . 3 (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷})
10 df-iun 4958 . . 3 ∪ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶}
11 df-iun 4958 . . 3 ∪ 𝑥 ∈ 𝐵 𝐷 = {𝑦 ∣ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷}
129, 10, 113eqtr4g 2823 . 2 (∀𝑦(∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑦 ∈ 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)
138, 12syl 18 1 (𝜑 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  {cab 2741  Ⅎwnfc 2911  ∃wrex 3090  ∪ ciun 4956
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-iun 4958
This theorem is used by:  iunxdif3  5060  iundisjf  33281  aciunf1  33355  measvuni  34958  iuneq2f  39354
  Copyright terms: Public domain W3C validator