Theorem bj-axsn 37987

Description: Two ways of stating the axiom of singleton (which is the universal closure of either side, see ax-bj-sn 37988). (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 4599	. 2 ⊢ (𝑧 ∈ {𝑥} ↔ 𝑧 = 𝑥)
2	1	bj-clex 37986	1 ⊢ ({𝑥} ∈ V ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ 𝑧 = 𝑥))

This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1567  ∃wex 1811   ∈ wcel 2144  Vcvv 3450  {csn 4583

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-sn 4584

This theorem is used by:  bj-snexg  37989