Theorem bj-elequ2g 32666

Description: A form of elequ2 2004 with a universal quantifier. Its converse is ax-ext 2602. (TODO: move to main part, minimize axext4 2606--- as of 4-Nov-2020, minimizes only axext4 2606, by 13 bytes; and link to it in the comment of ax-ext 2602.) (Contributed by BJ, 3-Oct-2019.)

Assertion

Ref	Expression
bj-elequ2g	|- ( x = y -> A. z ( z e. x <-> z e. y ) )

Distinct variable groups:   x, z   y, z

Proof of Theorem bj-elequ2g

Step	Hyp	Ref	Expression
1		elequ2 2004	. 2 |- ( x = y -> ( z e. x <-> z e. y ) )
2	1	alrimiv 1855	1 |- ( x = y -> A. z ( z e. x <-> z e. y ) )

Syntax hints:   -> wi 4   <-> wb 196   A.wal 1481

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999

This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705

This theorem is referenced by:  bj-axext4  32770  bj-cleqhyp  32892