Theorem dfnelbr2 48070

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 5819	. 2 ⊢ ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝑦 ∈ V)} ∖ {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦)}
2		df-xp 5669	. . 3 ⊢ (V × V) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝑦 ∈ V)}
3		df-eprel 5563	. . 3 ⊢ E = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦}
4	2, 3	difeq12i 4079	. 2 ⊢ ((V × V) ∖ E ) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ 𝑦 ∈ V)} ∖ {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ 𝑦})
5		df-nelbr 48069	. . 3 ⊢ _∉ = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝑥 ∈ 𝑦}
6		vex 3461	. . . . . 6 ⊢ 𝑥 ∈ V
7		vex 3461	. . . . . 6 ⊢ 𝑦 ∈ V
8	6, 7	pm3.2i 476	. . . . 5 ⊢ (𝑥 ∈ V ∧ 𝑦 ∈ V)
9	8	biantrur 540	. . . 4 ⊢ (¬ 𝑥 ∈ 𝑦 ↔ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦))
10	9	opabbii 5180	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ¬ 𝑥 ∈ 𝑦} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦)}
11	5, 10	eqtri 2788	. 2 ⊢ _∉ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ V ∧ 𝑦 ∈ V) ∧ ¬ 𝑥 ∈ 𝑦)}
12	1, 4, 11	3eqtr4ri 2799	1 ⊢ _∉ = ((V × V) ∖ E )

This proof depends on syntax axioms:  ¬ wn 3   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Vcvv 3457   ∖ cdif 3903  {copab 5175   E cep 5562   × cxp 5661   _∉ cnelbr 48068

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-opab 5176  df-eprel 5563  df-xp 5669  df-rel 5670  df-nelbr 48069

This theorem is used by: (None)