Theorem elnonrel 44036

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 44035	. . 3 ⊢ (𝐴 ∖ ◡◡𝐴) = (𝐴 ∖ (V × V))
2	1	eleq2i 2832	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ ⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)))
3		eldif 3900	. . 3 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)))
4		opelxp 5661	. . . . . 6 ⊢ (⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ (𝑋 ∈ V ∧ 𝑌 ∈ V))
5	4	notbii 321	. . . . 5 ⊢ (¬ ⟨𝑋, 𝑌⟩ ∈ (V × V) ↔ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V))
6	5	anbi2i 629	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
7		opprc 4834	. . . . . 6 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ⟨𝑋, 𝑌⟩ = ∅)
8	7	eleq1d 2825	. . . . 5 ⊢ (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → (⟨𝑋, 𝑌⟩ ∈ 𝐴 ↔ ∅ ∈ 𝐴))
9	8	pm5.32ri 580	. . . 4 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
10	6, 9	bitri 276	. . 3 ⊢ ((⟨𝑋, 𝑌⟩ ∈ 𝐴 ∧ ¬ ⟨𝑋, 𝑌⟩ ∈ (V × V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
11	3, 10	bitri 276	. 2 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ (V × V)) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))
12	2, 11	bitri 276	1 ⊢ (⟨𝑋, 𝑌⟩ ∈ (𝐴 ∖ ◡◡𝐴) ↔ (∅ ∈ 𝐴 ∧ ¬ (𝑋 ∈ V ∧ 𝑌 ∈ V)))

Syntax hints:  ¬ wn 3   ↔ wb 207   ∧ wa 396   ∈ wcel 2119  Vcvv 3432   ∖ cdif 3887  ∅c0 4268  ⟨cop 4568   × cxp 5623  ^◡ccnv 5624

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-xp 5631  df-rel 5632  df-cnv 5633

This theorem is referenced by: (None)