Theorem elnonrel 44168

Description: Only an ordered pair where not both entries are sets could be an element of the non-relation part of class. (Contributed by RP, 25-Oct-2020.)

Assertion

Ref	Expression
elnonrel	⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))

Proof of Theorem elnonrel

Step	Hyp	Ref	Expression
1		nonrel 44167	. . 3 ⊢ (𝐴 ∖ ◡◡𝐴) = (𝐴 ∖ (V × V))
2	1	eleq2i 2857	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ ⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)))
3		eldif 3917	. . 3 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)))
4		opelxp 5687	. . . . . 6 ⊢ (⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ (𝑋 ∈ V ∧ 𝑌 ∈ V))
5	4	notbii 323	. . . . 5 ⊢ (¬ ⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V))
6	5	anbi2i 634	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
7		opprc 4856	. . . . . 6 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ⟨𝑋, 𝑌⟩ = ∅)
8	7	eleq1d 2850	. . . . 5 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → (⟨𝑋, 𝑌⟩ ∈ 𝐴 ↔ ∅ ∈ 𝐴))
9	8	pm5.32ri 585	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
10	6, 9	bitri 278	. . 3 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
11	3, 10	bitri 278	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
12	2, 11	bitri 278	1 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))

Syntax hints:  ¬ wn 3   ↔ wb 209   ∧ wa 400   ∈ wcel 2145  Vcvv 3457   ∖ cdif 3904  ∅c0 4288  ⟨cop 4591   × cxp 5649  ^◡ccnv 5650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5250  ax-pr 5394

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5105  df-opab 5167  df-xp 5657  df-rel 5658  df-cnv 5659

This theorem is referenced by: (None)