Theorem elnonrel 44352

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 44351	. . 3 ⊢ (𝐴 ∖ ◡◡𝐴) = (𝐴 ∖ (V × V))
2	1	eleq2i 2858	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ ⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)))
3		eldif 3918	. . 3 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)))
4		opelxp 5702	. . . . . 6 ⊢ (⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ (𝑋 ∈ V ∧ 𝑌 ∈ V))
5	4	notbii 323	. . . . 5 ⊢ (¬ ⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V))
6	5	anbi2i 635	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
7		opprc 4866	. . . . . 6 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ⟨𝑋, 𝑌⟩ = ∅)
8	7	eleq1d 2851	. . . . 5 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → (⟨𝑋, 𝑌⟩ ∈ 𝐴 ↔ ∅ ∈ 𝐴))
9	8	pm5.32ri 586	. . . 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)))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∈ wcel 2146  Vcvv 3458   ∖ cdif 3905  ∅c0 4289  ⟨cop 4600   × cxp 5664  ^◡ccnv 5665

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-ext 2738  ax-sep 5262  ax-pr 5409

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-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674

This theorem is used by: (None)