Theorem opabbi2dv 5835

Description: Deduce equality of a relation and an ordered-pair class abstraction. Compare eqabdv 2896. (Contributed by NM, 24-Feb-2014.)

Hypotheses

Ref	Expression
opabbi2dv.1	⊢ Rel 𝐴
opabbi2dv.3	⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ 𝜓))

Assertion

Ref	Expression
opabbi2dv	⊢ (𝜑 → 𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})

Distinct variable groups:   𝑥,𝑦,𝐴   𝜑,𝑥,𝑦

Allowed substitution hints:   𝜓(𝑥, 𝑦)

Proof of Theorem opabbi2dv

Step	Hyp	Ref	Expression
1		opabbi2dv.1	. . 3 ⊢ Rel 𝐴
2		opabid2 5815	. . 3 ⊢ (Rel 𝐴 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴)
3	1, 2	ax-mp 5	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴
4		opabbi2dv.3	. . 3 ⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ 𝜓))
5	4	opabbidv 5177	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
6	3, 5	eqtr3id 2812	1 ⊢ (𝜑 → 𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2143  ⟨cop 4595  {copab 5173  Rel wrel 5666

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5174  df-xp 5667  df-rel 5668

This theorem is used by:  recmulnq  10953  dmcuts  27993  dib1dim  41967