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

Theorem iuneq1 2003
Description: Equality theorem for indexed union.
Assertion
Ref Expression
iuneq1 |- (A = B -> U.x e. A C = U.x e. B C)
Distinct variable group(s):   x,A   x,B

Proof of Theorem iuneq1
StepHypRef Expression
1 iunss1 2002 . . 3 |- (A (_ B -> U.x e. A C (_ U.x e. B C)
2 iunss1 2002 . . 3 |- (B (_ A -> U.x e. B C (_ U.x e. A C)
31, 2anim12i 268 . 2 |- ((A (_ B /\ B (_ A) -> (U.x e. A C (_ U.x e. B C /\ U.x e. B C (_ U.x e. A C))
4 eqss 1516 . 2 |- (A = B <-> (A (_ B /\ B (_ A))
5 eqss 1516 . 2 |- (U.x e. A C = U.x e. B C <-> (U.x e. A C (_ U.x e. B C /\ U.x e. B C (_ U.x e. A C))
63, 4, 53imtr4 192 1 |- (A = B -> U.x e. A C = U.x e. B C)
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196   = wceq 1091   (_ wss 1487  U.ciun 1994
This theorem is referenced by:  kmlem10 3589
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-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-rex 1206  df-in 1491  df-ss 1492  df-iun 1996
metamath.org