Theorem bj-snex 37358

Description: A singleton is a set. See also snex 5376, snexALT 5320. (Contributed by NM, 7-Aug-1994.) Prove it from ax-bj-sn 37356. (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 37357	. 2 ⊢ (𝐴 ∈ V → {𝐴} ∈ V)
2		snprc 4662	. . . 4 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
3	2	biimpi 216	. . 3 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅)
4		0ex 5242	. . 3 ⊢ ∅ ∈ V
5	3, 4	eqeltrdi 2845	. 2 ⊢ (¬ 𝐴 ∈ V → {𝐴} ∈ V)
6	1, 5	pm2.61i 182	1 ⊢ {𝐴} ∈ V

Syntax hints:  ¬ wn 3   = wceq 1542   ∈ wcel 2114  Vcvv 3430  ∅c0 4274  {csn 4568

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709  ax-nul 5241  ax-bj-sn 37356

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3432  df-dif 3893  df-nul 4275  df-sn 4569

This theorem is referenced by:  bj-prex  37363