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

Theorem uneqri 1602
Description: Inference from membership to union.
Hypothesis
Ref Expression
uneqri.1 |- ((x e. A \/ x e. B) <-> x e. C)
Assertion
Ref Expression
uneqri |- (A u. B) = C
Distinct variable group(s):   x,A   x,B   x,C

Proof of Theorem uneqri
StepHypRef Expression
1 elun 1601 . . 3 |- (x e. (A u. B) <-> (x e. A \/ x e. B))
2 uneqri.1 . . 3 |- ((x e. A \/ x e. B) <-> x e. C)
31, 2bitr 151 . 2 |- (x e. (A u. B) <-> x e. C)
43cleqri 1101 1 |- (A u. B) = C
Colors of variables: wff set class
Syntax hints:   <-> wb 127   \/ wo 195   = wceq 1091   e. wcel 1092   u. cun 1485
This theorem is referenced by:  unidm 1603  unass 1615  un0 1721
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-v 1349  df-un 1490
metamath.org