Theorem snssb 3751

Description: Characterization of the inclusion of a singleton in a class. (Contributed by BJ, 1-Jan-2025.)

Assertion

Ref	Expression
snssb	⊢ ({𝐴} ⊆ 𝐵 ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵))

Proof of Theorem snssb

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfss2 3168	. 2 ⊢ ({𝐴} ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵))
2		velsn 3635	. . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
3	2	imbi1i 238	. . 3 ⊢ ((𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
4	3	albii 1481	. 2 ⊢ (∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
5		eleq1 2256	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
6	5	pm5.74i 180	. . . 4 ⊢ ((𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝐴 ∈ 𝐵))
7	6	albii 1481	. . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵))
8		19.23v 1894	. . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵))
9		isset 2766	. . . . 5 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
10	9	bicomi 132	. . . 4 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ 𝐴 ∈ V)
11	10	imbi1i 238	. . 3 ⊢ ((∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵))
12	7, 8, 11	3bitri 206	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵) ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵))
13	1, 4, 12	3bitri 206	1 ⊢ ({𝐴} ⊆ 𝐵 ↔ (𝐴 ∈ V → 𝐴 ∈ 𝐵))

Syntax hints:   → wi 4   ↔ wb 105  ∀wal 1362   = wceq 1364  ∃wex 1503   ∈ wcel 2164  Vcvv 2760   ⊆ wss 3153  {csn 3618

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-in 3159  df-ss 3166  df-sn 3624

This theorem is referenced by:  snssg  3752