Theorem cnvepres 38616

Description: Restricted converse epsilon relation as a class of ordered pairs. (Contributed by Peter Mazsa, 10-Feb-2018.)

Assertion

Ref	Expression
cnvepres	⊢ (◡ E ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)}

Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem cnvepres

Step	Hyp	Ref	Expression
1		dfres2 5998	. 2 ⊢ (◡ E ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥◡ E 𝑦)}
2		brcnvep 38582	. . . . 5 ⊢ (𝑥 ∈ V → (𝑥◡ E 𝑦 ↔ 𝑦 ∈ 𝑥))
3	2	elv 3435	. . . 4 ⊢ (𝑥◡ E 𝑦 ↔ 𝑦 ∈ 𝑥)
4	3	anbi2i 624	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥◡ E 𝑦) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥))
5	4	opabbii 5153	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥◡ E 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)}
6	1, 5	eqtri 2760	1 ⊢ (◡ E ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝑥)}

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  Vcvv 3430   class class class wbr 5086  {copab 5148   E cep 5521  ^◡ccnv 5621   ↾ cres 5624

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-eprel 5522  df-xp 5628  df-rel 5629  df-cnv 5630  df-res 5634

This theorem is referenced by:  rncnvepres  38621  n0el2  38647  cnvepresex  38648