Theorem snssgOLD 3810

Description: Obsolete version of snssgOLD 3810 as of 1-Jan-2025. (Contributed by NM, 22-Jul-2001.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
snssgOLD	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ {𝐴} ⊆ 𝐵))

Proof of Theorem snssgOLD

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2293	. 2 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
2		sneq 3681	. . 3 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
3	2	sseq1d 3255	. 2 ⊢ (𝑥 = 𝐴 → ({𝑥} ⊆ 𝐵 ↔ {𝐴} ⊆ 𝐵))
4		vex 2804	. . 3 ⊢ 𝑥 ∈ V
5	4	snss 3809	. 2 ⊢ (𝑥 ∈ 𝐵 ↔ {𝑥} ⊆ 𝐵)
6	1, 3, 5	vtoclbg 2864	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ {𝐴} ⊆ 𝐵))

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1397   ∈ wcel 2201   ⊆ wss 3199  {csn 3670

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2212

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1810  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-v 2803  df-in 3205  df-ss 3212  df-sn 3676

This theorem is referenced by: (None)