Theorem abbi 2886

Description: Equivalent formulas define equal class abstractions, and conversely. (Contributed by NM, 25-Nov-2013.) (Revised by Mario Carneiro, 11-Aug-2016.) Remove dependency on ax-8 2110 and df-clel 2891 (by avoiding use of cleqh 2934). (Revised by BJ, 23-Jun-2019.)

Assertion

Ref	Expression
abbi	⊢ (∀𝑥(𝜑 ↔ 𝜓) ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓})

Proof of Theorem abbi

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfcleq 2813	. 2 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓} ↔ ∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓}))
2		nfsab1 2806	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∣ 𝜑}
3		nfsab1 2806	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∣ 𝜓}
4	2, 3	nfbi 1898	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓})
5		nfv 1909	. . 3 ⊢ Ⅎ𝑦(𝜑 ↔ 𝜓)
6		df-clab 2798	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
7		sbequ12r 2247	. . . . 5 ⊢ (𝑦 = 𝑥 → ([𝑦 / 𝑥]𝜑 ↔ 𝜑))
8	6, 7	syl5bb 285	. . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑))
9		df-clab 2798	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓)
10		sbequ12r 2247	. . . . 5 ⊢ (𝑦 = 𝑥 → ([𝑦 / 𝑥]𝜓 ↔ 𝜓))
11	9, 10	syl5bb 285	. . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ 𝜓))
12	8, 11	bibi12d 348	. . 3 ⊢ (𝑦 = 𝑥 → ((𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ (𝜑 ↔ 𝜓)))
13	4, 5, 12	cbvalv1 2355	. 2 ⊢ (∀𝑦(𝑦 ∈ {𝑥 ∣ 𝜑} ↔ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ ∀𝑥(𝜑 ↔ 𝜓))
14	1, 13	bitr2i 278	1 ⊢ (∀𝑥(𝜑 ↔ 𝜓) ↔ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓})

Syntax hints:   ↔ wb 208  ∀wal 1529   = wceq 1531  [wsb 2063   ∈ wcel 2108  {cab 2797

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-clab 2798  df-cleq 2812

This theorem is referenced by:  nabbi  3119  rabbi  3382  sbcbi2OLD  3830  absn  4577  karden  9316  elnev  40760  csbingVD  41208  csbsngVD  41217  csbxpgVD  41218  csbrngVD  41220  csbunigVD  41222  csbfv12gALTVD  41223