Theorem abbid 2355

Description: Equivalent wff's yield equal class abstractions (deduction form). (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 7-Oct-2016.)

Hypotheses

Ref	Expression
abbid.1	|- F/ x ph
abbid.2	|- ( ph -> ( ps <-> ch ) )

Assertion

Ref	Expression
abbid	|- ( ph -> { x | ps } = { x | ch } )

Proof of Theorem abbid

Step	Hyp	Ref	Expression
1		abbid.1	. . 3 |- F/ x ph
2		abbid.2	. . 3 |- ( ph -> ( ps <-> ch ) )
3	1, 2	alrimi 1575	. 2 |- ( ph -> A. x ( ps <-> ch ) )
4		abbibcom 2352	. 2 |- ( A. x ( ps <-> ch ) <-> { x | ps } = { x | ch } )
5	3, 4	sylib 122	1 |- ( ph -> { x | ps } = { x | ch } )

Syntax hints:   -> wi 4   <-> wb 105   A.wal 1400   = wceq 1402   F/wnf 1513   {cab 2224

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231

This theorem is referenced by:  abbidv  2358  rabeqf  2811  sbcbid  3109  hashf1lem2  11264