Theorem rabbieq 3399

Description: Equivalent wff's correspond to restricted class abstractions which are equal with the same class. (Contributed by Peter Mazsa, 8-Jul-2019.)

Hypotheses

Ref	Expression
rabbieq.1	⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑}
rabbieq.2	⊢ (𝜑 ↔ 𝜓)

Assertion

Ref	Expression
rabbieq	⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜓}

Proof of Theorem rabbieq

Step	Hyp	Ref	Expression
1		rabbieq.1	. 2 ⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜑}
2		rabbieq.2	. . 3 ⊢ (𝜑 ↔ 𝜓)
3	2	rabbii 3396	. 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} = {𝑥 ∈ 𝐴 ∣ 𝜓}
4	1, 3	eqtri 2762	1 ⊢ 𝐵 = {𝑥 ∈ 𝐴 ∣ 𝜓}

Syntax hints:   ↔ wb 207   = wceq 1547  {crab 3391

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-9 2129  ax-ext 2711

This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-rab 3392

This theorem is referenced by:  dfdif3  4048  elneldisj  4320  elnelun  4321  1arithufd  33631  dfrefrels3  38961  dfcnvrefrels3  38976  dfsymrels3  38993  refsymrels3  39017  dftrrels3  39027  dfeqvrels3  39040  dfdisjs3  39162  dfdisjs4  39163  isubgr0uhgr  48364  grlimedgclnbgr  48486