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

Theorem axext4 2267
Description: A bidirectional version of Extensionality. Although this theorem "looks" like it is just a definition of equality, it requires the Axiom of Extensionality for its proof under our axiomatization. See the comments for ax-ext 2264 and df-cleq 2276. (Contributed by NM, 14-Nov-2008.)
Assertion
Ref Expression
axext4  |-  ( x  =  y  <->  A. z
( z  e.  x  <->  z  e.  y ) )
Distinct variable groups:    x, z    y, z

Proof of Theorem axext4
StepHypRef Expression
1 elequ2 1689 . . 3  |-  ( x  =  y  ->  (
z  e.  x  <->  z  e.  y ) )
21alrimiv 1617 . 2  |-  ( x  =  y  ->  A. z
( z  e.  x  <->  z  e.  y ) )
3 axext3 2266 . 2  |-  ( A. z ( z  e.  x  <->  z  e.  y )  ->  x  =  y )
42, 3impbii 180 1  |-  ( x  =  y  <->  A. z
( z  e.  x  <->  z  e.  y ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176   A.wal 1527    = wceq 1623    e. wcel 1684
This theorem is referenced by:  ax10ext  27606
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532
  Copyright terms: Public domain W3C validator