Theorem opabbi2dv 5826

Description: Deduce equality of a relation and an ordered-pair class abstraction. Compare eqabdv 2893. (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 5805	. . 3 ⊢ (Rel 𝐴 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴)
3	1, 2	ax-mp 5	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = 𝐴
4		opabbi2dv.3	. . 3 ⊢ (𝜑 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 ↔ 𝜓))
5	4	opabbidv 5170	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐴} = {⟨𝑥, 𝑦⟩ ∣ 𝜓})
6	3, 5	eqtr3id 2809	1 ⊢ (𝜑 → 𝐴 = {⟨𝑥, 𝑦⟩ ∣ 𝜓})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ⟨cop 4589  {copab 5166  Rel wrel 5655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-opab 5167  df-xp 5656  df-rel 5657

This theorem is used by:  recmulnq  11049  dmcuts  28177  dib1dim  42223