Theorem bj-snex 37649

Description: A singleton is a set. See also snex 5412, snexALT 5356. (Contributed by NM, 7-Aug-1994.) Prove it from ax-bj-sn 37647. (Revised by BJ, 12-Jan-2025.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-snex	⊢ {𝐴} ∈ V

Proof of Theorem bj-snex

Step	Hyp	Ref	Expression
1		bj-snexg 37648	. 2 ⊢ (𝐴 ∈ V → {𝐴} ∈ V)
2		snprc 4684	. . . 4 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
3	2	biimpi 219	. . 3 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅)
4		0ex 5271	. . 3 ⊢ ∅ ∈ V
5	3, 4	eqeltrdi 2871	. 2 ⊢ (¬ 𝐴 ∈ V → {𝐴} ∈ V)
6	1, 5	pm2.61i 184	1 ⊢ {𝐴} ∈ V

Syntax hints:  ¬ wn 3   = wceq 1570   ∈ wcel 2143  Vcvv 3455  ∅c0 4287  {csn 4590

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-12 2213  ax-ext 2735  ax-nul 5270  ax-bj-sn 37647

This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-v 3457  df-dif 3909  df-nul 4288  df-sn 4591

This theorem is referenced by:  bj-prex  37654