Theorem bj-snexg 38162

Description: A singleton built on a set is a set. Contrary to bj-snex 38163, this proof is intuitionistically valid and does not require ax-nul 5266. (Contributed by NM, 7-Aug-1994.) Extract it from snex 5404 and prove it from ax-bj-sn 38161. (Revised by BJ, 12-Jan-2025.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-snexg	⊢ (𝐴 ∈ 𝑉 → {𝐴} ∈ V)

Proof of Theorem bj-snexg

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 4594	. . 3 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
2		ax-bj-sn 38161	. . . . 5 ⊢ ∀𝑥∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 = 𝑥)
3	2	spi 2224	. . . 4 ⊢ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 = 𝑥)
4		bj-axsn 38160	. . . 4 ⊢ ({𝑥} ∈ V ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 = 𝑥))
5	3, 4	mpbir 234	. . 3 ⊢ {𝑥} ∈ V
6	1, 5	eqeltrrdi 2873	. 2 ⊢ (𝑥 = 𝐴 → {𝐴} ∈ V)
7	6	vtocleg 3520	1 ⊢ (𝐴 ∈ 𝑉 → {𝐴} ∈ V)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Vcvv 3454  {csn 4588

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-12 2216  ax-ext 2735  ax-bj-sn 38161

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-sn 4589

This theorem is used by:  bj-snex  38163  bj-prexg  38167  bj-adjfrombun  38174