HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem iuneq2i 2008
Description: Equality inference for indexed union.
Hypothesis
Ref Expression
iuneq2i.1 |- (x e. A -> B = C)
Assertion
Ref Expression
iuneq2i |- U.x e. A B = U.x e. A C

Proof of Theorem iuneq2i
StepHypRef Expression
1 iuneq2 2006 . 2 |- (A.x e. A B = C -> U.x e. A B = U.x e. A C)
2 iuneq2i.1 . 2 |- (x e. A -> B = C)
31, 2mprg 1249 1 |- U.x e. A B = U.x e. A C
Colors of variables: wff set class
Syntax hints:   -> wi 2   = wceq 1091   e. wcel 1092  U.ciun 1994
This theorem is referenced by:  iunab 2023  abianfplem 2999  r1lim 3497  alephlim 3670
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-in 1491  df-ss 1492  df-iun 1996
metamath.org