Theorem abpr 44087

Description: Condition for a class abstraction to be a pair. (Contributed by RP, 25-Aug-2024.)

Assertion

Ref	Expression
abpr	⊢ ({𝑥 ∣ 𝜑} = {𝑌, 𝑍} ↔ ∀𝑥(𝜑 ↔ (𝑥 = 𝑌 ∨ 𝑥 = 𝑍)))

Distinct variable groups:   𝑥,𝑌   𝑥,𝑍

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem abpr

Step	Hyp	Ref	Expression
1		dfpr2 4615	. 2 ⊢ {𝑌, 𝑍} = {𝑥 ∣ (𝑥 = 𝑌 ∨ 𝑥 = 𝑍)}
2	1	abeqabi 44086	1 ⊢ ({𝑥 ∣ 𝜑} = {𝑌, 𝑍} ↔ ∀𝑥(𝜑 ↔ (𝑥 = 𝑌 ∨ 𝑥 = 𝑍)))

Syntax hints:   ↔ wb 209   ∨ wo 860  ∀wal 1566   = wceq 1568  {cab 2748  {cpr 4596

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2199  ax-12 2220  ax-ext 2742

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1571  df-ex 1808  df-nf 1812  df-sb 2099  df-clab 2749  df-cleq 2762  df-clel 2845  df-v 3464  df-un 3918  df-sn 4595  df-pr 4597

This theorem is referenced by: (None)