MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  unjust Unicode version

Theorem unjust 3082
Description: Soundness justification theorem for df-un 3083. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Assertion
Ref Expression
unjust  |-  { x  |  ( x  e.  A  \/  x  e.  B ) }  =  { y  |  ( y  e.  A  \/  y  e.  B ) }
Distinct variable groups:    x, A    x, B    y, A    y, B

Proof of Theorem unjust
StepHypRef Expression
1 eleq1 2313 . . . 4  |-  ( x  =  z  ->  (
x  e.  A  <->  z  e.  A ) )
2 eleq1 2313 . . . 4  |-  ( x  =  z  ->  (
x  e.  B  <->  z  e.  B ) )
31, 2orbi12d 693 . . 3  |-  ( x  =  z  ->  (
( x  e.  A  \/  x  e.  B
)  <->  ( z  e.  A  \/  z  e.  B ) ) )
43cbvabv 2368 . 2  |-  { x  |  ( x  e.  A  \/  x  e.  B ) }  =  { z  |  ( z  e.  A  \/  z  e.  B ) }
5 eleq1 2313 . . . 4  |-  ( z  =  y  ->  (
z  e.  A  <->  y  e.  A ) )
6 eleq1 2313 . . . 4  |-  ( z  =  y  ->  (
z  e.  B  <->  y  e.  B ) )
75, 6orbi12d 693 . . 3  |-  ( z  =  y  ->  (
( z  e.  A  \/  z  e.  B
)  <->  ( y  e.  A  \/  y  e.  B ) ) )
87cbvabv 2368 . 2  |-  { z  |  ( z  e.  A  \/  z  e.  B ) }  =  { y  |  ( y  e.  A  \/  y  e.  B ) }
94, 8eqtri 2273 1  |-  { x  |  ( x  e.  A  \/  x  e.  B ) }  =  { y  |  ( y  e.  A  \/  y  e.  B ) }
Colors of variables: wff set class
Syntax hints:    \/ wo 359    = wceq 1619    e. wcel 1621   {cab 2239
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-clab 2240  df-cleq 2246  df-clel 2249
  Copyright terms: Public domain W3C validator