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

Theorem pm13.183 3244
Description: Compare theorem *13.183 in [WhiteheadRussell] p. 178. Only  A is required to be a set. (Contributed by Andrew Salmon, 3-Jun-2011.)
Assertion
Ref Expression
pm13.183  |-  ( A  e.  V  ->  ( A  =  B  <->  A. z
( z  =  A  <-> 
z  =  B ) ) )
Distinct variable groups:    z, A    z, B
Allowed substitution hint:    V( z)

Proof of Theorem pm13.183
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2471 . 2  |-  ( y  =  A  ->  (
y  =  B  <->  A  =  B ) )
2 eqeq2 2482 . . . 4  |-  ( y  =  A  ->  (
z  =  y  <->  z  =  A ) )
32bibi1d 319 . . 3  |-  ( y  =  A  ->  (
( z  =  y  <-> 
z  =  B )  <-> 
( z  =  A  <-> 
z  =  B ) ) )
43albidv 1689 . 2  |-  ( y  =  A  ->  ( A. z ( z  =  y  <->  z  =  B )  <->  A. z ( z  =  A  <->  z  =  B ) ) )
5 eqeq2 2482 . . . 4  |-  ( y  =  B  ->  (
z  =  y  <->  z  =  B ) )
65alrimiv 1695 . . 3  |-  ( y  =  B  ->  A. z
( z  =  y  <-> 
z  =  B ) )
7 stdpc4 2067 . . . 4  |-  ( A. z ( z  =  y  <->  z  =  B )  ->  [ y  /  z ] ( z  =  y  <->  z  =  B ) )
8 sbbi 2116 . . . . 5  |-  ( [ y  /  z ] ( z  =  y  <-> 
z  =  B )  <-> 
( [ y  / 
z ] z  =  y  <->  [ y  /  z ] z  =  B ) )
9 eqsb3 2587 . . . . . . 7  |-  ( [ y  /  z ] z  =  B  <->  y  =  B )
109bibi2i 313 . . . . . 6  |-  ( ( [ y  /  z ] z  =  y  <->  [ y  /  z ] z  =  B )  <->  ( [ y  /  z ] z  =  y  <->  y  =  B ) )
11 equsb1 2080 . . . . . . 7  |-  [ y  /  z ] z  =  y
12 bi1 186 . . . . . . 7  |-  ( ( [ y  /  z ] z  =  y  <-> 
y  =  B )  ->  ( [ y  /  z ] z  =  y  ->  y  =  B ) )
1311, 12mpi 17 . . . . . 6  |-  ( ( [ y  /  z ] z  =  y  <-> 
y  =  B )  ->  y  =  B )
1410, 13sylbi 195 . . . . 5  |-  ( ( [ y  /  z ] z  =  y  <->  [ y  /  z ] z  =  B )  ->  y  =  B )
158, 14sylbi 195 . . . 4  |-  ( [ y  /  z ] ( z  =  y  <-> 
z  =  B )  ->  y  =  B )
167, 15syl 16 . . 3  |-  ( A. z ( z  =  y  <->  z  =  B )  ->  y  =  B )
176, 16impbii 188 . 2  |-  ( y  =  B  <->  A. z
( z  =  y  <-> 
z  =  B ) )
181, 4, 17vtoclbg 3172 1  |-  ( A  e.  V  ->  ( A  =  B  <->  A. z
( z  =  A  <-> 
z  =  B ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184   A.wal 1377    = wceq 1379   [wsb 1711    e. wcel 1767
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-v 3115
This theorem is referenced by:  mpt22eqb  6393
  Copyright terms: Public domain W3C validator