Users' Mathboxes Mathbox for Giovanni Mascellani < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iuneq12f Structured version   Visualization version   GIF version

Theorem iuneq12f 39361
Description: Equality deduction for indexed unions. (Contributed by Giovanni Mascellani, 10-Apr-2018.)
Hypotheses
Ref Expression
iuneq12f.1 Ⅎ𝑥𝐴
iuneq12f.2 Ⅎ𝑥𝐵
Assertion
Ref Expression
iuneq12f ((𝐴 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 = 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)

Proof of Theorem iuneq12f
StepHypRef Expression
1 iuneq2 4976 . 2 (∀𝑥 ∈ 𝐴 𝐶 = 𝐷 → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐴 𝐷)
2 iuneq12f.1 . . 3 Ⅎ𝑥𝐴
3 iuneq12f.2 . . 3 Ⅎ𝑥𝐵
42, 3iuneq2f 39354 . 2 (𝐴 = 𝐵 → ∪ 𝑥 ∈ 𝐴 𝐷 = ∪ 𝑥 ∈ 𝐵 𝐷)
51, 4sylan9eqr 2820 1 ((𝐴 = 𝐵 ∧ ∀𝑥 ∈ 𝐴 𝐶 = 𝐷) → ∪ 𝑥 ∈ 𝐴 𝐶 = ∪ 𝑥 ∈ 𝐵 𝐷)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  Ⅎwnfc 2911  ∀wral 3080  ∪ 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-v 3456  df-ss 3901  df-iun 4958
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator