Theorem elsn2g 4626

Description: There is exactly one element in a singleton. Exercise 2 of [TakeutiZaring] p. 15. This variation requires only that 𝐵, rather than 𝐴, be a set. (Contributed by NM, 28-Oct-2003.)

Assertion

Ref	Expression
elsn2g	⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))

Proof of Theorem elsn2g

Step	Hyp	Ref	Expression
1		elsni 4601	. 2 ⊢ (𝐴 ∈ {𝐵} → 𝐴 = 𝐵)
2		snidg 4622	. . 3 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ {𝐵})
3		eleq1 2852	. . 3 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ {𝐵} ↔ 𝐵 ∈ {𝐵}))
4	2, 3	syl5ibrcom 250	. 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 = 𝐵 → 𝐴 ∈ {𝐵}))
5	1, 4	impbid2 229	1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {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-ext 2735

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-sn 4589

This theorem is used by:  elsn2  4627  mptiniseg  6259  elsuc2g  6460  extmptsuppeq  8243  fzosplitsni  13954  1nsgtrivd  19434  limcco  26268  ply1termlem  26576  mptprop  33388  mirimanofffr  36670  bj-elsn12g  38245  elpmapat  41087  stirlinglem8  47364  dirkercncflem2  47387  clnbgrel  49199