Theorem en1eqsnbi 9305

Description: A set containing an element has exactly one element iff it is a singleton. Formerly part of proof for rngen1zr 20456. (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.)

Assertion

Ref	Expression
en1eqsnbi	⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴}))

Proof of Theorem en1eqsnbi

Step	Hyp	Ref	Expression
1		en1eqsn 9304	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ≈ 1o) → 𝐵 = {𝐴})
2	1	ex 418	. 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o → 𝐵 = {𝐴}))
3		ensn1g 9087	. . 3 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ≈ 1o)
4		breq1 5111	. . 3 ⊢ (𝐵 = {𝐴} → (𝐵 ≈ 1o ↔ {𝐴} ≈ 1o))
5	3, 4	syl5ibrcom 250	. 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 = {𝐴} → 𝐵 ≈ 1o))
6	2, 5	impbid 215	1 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2147  {csn 4588   class class class wbr 5108  1_oc1o 8507   ≈ cen 9008

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-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-1o 8514  df-en 9012

This theorem is used by:  rngen1zr  20456  srgen1zr0  20493  rngosn4  39125