Theorem bj-snmooreb 37604

Description: A singleton is a Moore collection, biconditional version. (Contributed by BJ, 9-Dec-2021.) (Proof shortened by BJ, 10-Apr-2024.)

Assertion

Ref	Expression
bj-snmooreb	⊢ (𝐴 ∈ V ↔ {𝐴} ∈ Moore)

Proof of Theorem bj-snmooreb

Step	Hyp	Ref	Expression
1		bj-snmoore 37603	. 2 ⊢ (𝐴 ∈ V → {𝐴} ∈ Moore)
2		snprc 4676	. . . . 5 ⊢ (¬ 𝐴 ∈ V ↔ {𝐴} = ∅)
3	2	biimpi 218	. . . 4 ⊢ (¬ 𝐴 ∈ V → {𝐴} = ∅)
4		bj-0nmoore 37602	. . . . 5 ⊢ ¬ ∅ ∈ Moore
5	4	a1i 11	. . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ ∅ ∈ Moore)
6	3, 5	eqneltrd 2882	. . 3 ⊢ (¬ 𝐴 ∈ V → ¬ {𝐴} ∈ Moore)
7	6	con4i 114	. 2 ⊢ ({𝐴} ∈ Moore → 𝐴 ∈ V)
8	1, 7	impbii 211	1 ⊢ (𝐴 ∈ V ↔ {𝐴} ∈ Moore)

Syntax hints:  ¬ wn 3   ↔ wb 208   = wceq 1560   ∈ wcel 2142  Vcvv 3454  ∅c0 4285  {csn 4582  Moorecmoore 37593

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-pw 4557  df-sn 4583  df-pr 4585  df-uni 4866  df-int 4906  df-bj-moore 37594

This theorem is referenced by: (None)