Theorem bj-axsn 37763

Description: Two ways of stating the axiom of singleton (which is the universal closure of either side, see ax-bj-sn 37764). (Contributed by BJ, 12-Jan-2025.) (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-axsn	⊢ ({𝑥} ∈ V ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 = 𝑥))

Distinct variable group:   𝑥,𝑦,𝑧

Proof of Theorem bj-axsn

Step	Hyp	Ref	Expression
1		velsn 4603	. 2 ⊢ (𝑧 ∈ {𝑥} ↔ 𝑧 = 𝑥)
2	1	bj-clex 37762	1 ⊢ ({𝑥} ∈ V ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 = 𝑥))

This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1568  ∃wex 1812   ∈ wcel 2145  Vcvv 3453  {csn 4587

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-sn 4588

This theorem is used by:  bj-snexg  37765