Theorem 0nelopab 5527

Description: The empty set is never an element in an ordered-pair class abstraction. (Contributed by Alexander van der Vekens, 5-Nov-2017.) Reduce axiom usage and shorten proof. (Revised by GG, 3-Oct-2024.)

Assertion

Ref	Expression
0nelopab	⊢ ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Proof of Theorem 0nelopab

Step	Hyp	Ref	Expression
1		vex 3451	. . . . . . 7 ⊢ 𝑥 ∈ V
2		vex 3451	. . . . . . 7 ⊢ 𝑦 ∈ V
3	1, 2	opnzi 5434	. . . . . 6 ⊢ ⟨𝑥, 𝑦⟩ ≠ ∅
4	3	nesymi 2982	. . . . 5 ⊢ ¬ ∅ = ⟨𝑥, 𝑦⟩
5	4	intnanr 487	. . . 4 ⊢ ¬ (∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
6	5	nex 1800	. . 3 ⊢ ¬ ∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
7	6	nex 1800	. 2 ⊢ ¬ ∃𝑥∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
8		elopab 5487	. 2 ⊢ (∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(∅ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
9	7, 8	mtbir 323	1 ⊢ ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∅c0 4296  ⟨cop 4595  {copab 5169

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-opab 5170

This theorem is referenced by:  brabv  5528  epelg  5539  satf0n0  35365  bj-0nelmpt  37104