Theorem dfnelbr2 47461

Description: Alternate definition of the negated membership as binary relation. (Proposed by BJ, 27-Dec-2021.) (Contributed by AV, 27-Dec-2021.)

Assertion

Ref	Expression
dfnelbr2	⊢ _∉ = ((V × V) ∖ E )

Proof of Theorem dfnelbr2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difopab 5777	. 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝑦 ∈ V)} ∖ {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦)}
2		df-xp 5628	. . 3 ⊢ (V × V) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝑦 ∈ V)}
3		df-eprel 5522	. . 3 ⊢ E = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}
4	2, 3	difeq12i 4074	. 2 ⊢ ((V × V) ∖ E ) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝑦 ∈ V)} ∖ {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦})
5		df-nelbr 47460	. . 3 ⊢ _∉ = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝑥 ∈ 𝑦}
6		vex 3442	. . . . . 6 ⊢ 𝑥 ∈ V
7		vex 3442	. . . . . 6 ⊢ 𝑦 ∈ V
8	6, 7	pm3.2i 470	. . . . 5 ⊢ (𝑥 ∈ V ∧ 𝑦 ∈ V)
9	8	biantrur 530	. . . 4 ⊢ (¬ 𝑥 ∈ 𝑦 ↔ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦))
10	9	opabbii 5163	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝑥 ∈ 𝑦} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦)}
11	5, 10	eqtri 2757	. 2 ⊢ _∉ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦)}
12	1, 4, 11	3eqtr4ri 2768	1 ⊢ _∉ = ((V × V) ∖ E )

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1541   ∈ wcel 2113  Vcvv 3438   ∖ cdif 3896  {copab 5158   E cep 5521   × cxp 5620   _∉ cnelbr 47459

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-opab 5159  df-eprel 5522  df-xp 5628  df-rel 5629  df-nelbr 47460

This theorem is referenced by: (None)