Theorem elnonrel 44121

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 44120	. . 3 ⊢ (𝐴 ∖ ◡◡𝐴) = (𝐴 ∖ (V × V))
2	1	eleq2i 2853	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ ⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)))
3		eldif 3912	. . 3 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)))
4		opelxp 5679	. . . . . 6 ⊢ (⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ (𝑋 ∈ V ∧ 𝑌 ∈ V))
5	4	notbii 322	. . . . 5 ⊢ (¬ ⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V))
6	5	anbi2i 632	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
7		opprc 4851	. . . . . 6 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ⟨𝑋, 𝑌⟩ = ∅)
8	7	eleq1d 2846	. . . . 5 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → (⟨𝑋, 𝑌⟩ ∈ 𝐴 ↔ ∅ ∈ 𝐴))
9	8	pm5.32ri 583	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
10	6, 9	bitri 277	. . 3 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
11	3, 10	bitri 277	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
12	2, 11	bitri 277	1 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))

Syntax hints:  ¬ wn 3   ↔ wb 208   ∧ wa 399   ∈ wcel 2141  Vcvv 3453   ∖ cdif 3899  ∅c0 4283  ⟨cop 4585   × cxp 5641  ^◡ccnv 5642

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5243  ax-pr 5387

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098  df-opab 5160  df-xp 5649  df-rel 5650  df-cnv 5651

This theorem is referenced by: (None)