Theorem bj-snglc 36935

Description: Characterization of the elements of 𝐴 in terms of elements of its singletonization. (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-snglc	⊢ (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ sngl 𝐵)

Proof of Theorem bj-snglc

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-rex 3077	. 2 ⊢ (∃𝑥 ∈ 𝐵 {𝐴} = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ {𝐴} = {𝑥}))
2		bj-elsngl 36934	. 2 ⊢ ({𝐴} ∈ sngl 𝐵 ↔ ∃𝑥 ∈ 𝐵 {𝐴} = {𝑥})
3		elisset 2826	. . . . 5 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴)
4	3	pm4.71i 559	. . . 4 ⊢ (𝐴 ∈ 𝐵 ↔ (𝐴 ∈ 𝐵 ∧ ∃𝑥 𝑥 = 𝐴))
5		19.42v 1953	. . . 4 ⊢ (∃𝑥(𝐴 ∈ 𝐵 ∧ 𝑥 = 𝐴) ↔ (𝐴 ∈ 𝐵 ∧ ∃𝑥 𝑥 = 𝐴))
6		eleq1 2832	. . . . . . 7 ⊢ (𝐴 = 𝑥 → (𝐴 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
7	6	eqcoms 2748	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
8	7	pm5.32ri 575	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝑥 = 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴))
9	8	exbii 1846	. . . 4 ⊢ (∃𝑥(𝐴 ∈ 𝐵 ∧ 𝑥 = 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴))
10	4, 5, 9	3bitr2i 299	. . 3 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴))
11		sneqbg 4868	. . . . . . 7 ⊢ (𝑥 ∈ V → ({𝑥} = {𝐴} ↔ 𝑥 = 𝐴))
12	11	elv 3493	. . . . . 6 ⊢ ({𝑥} = {𝐴} ↔ 𝑥 = 𝐴)
13		eqcom 2747	. . . . . 6 ⊢ ({𝑥} = {𝐴} ↔ {𝐴} = {𝑥})
14	12, 13	bitr3i 277	. . . . 5 ⊢ (𝑥 = 𝐴 ↔ {𝐴} = {𝑥})
15	14	anbi2i 622	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴) ↔ (𝑥 ∈ 𝐵 ∧ {𝐴} = {𝑥}))
16	15	exbii 1846	. . 3 ⊢ (∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 = 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ {𝐴} = {𝑥}))
17	10, 16	bitri 275	. 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ {𝐴} = {𝑥}))
18	1, 2, 17	3bitr4ri 304	1 ⊢ (𝐴 ∈ 𝐵 ↔ {𝐴} ∈ sngl 𝐵)

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2108  ∃wrex 3076  Vcvv 3488  {csn 4648  sngl bj-csngl 36931

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rex 3077  df-v 3490  df-un 3981  df-sn 4649  df-pr 4651  df-bj-sngl 36932

This theorem is referenced by:  bj-snglinv  36938  bj-tagci  36950  bj-tagcg  36951