Theorem snssgOLD 3754

Description: Obsolete version of snssgOLD 3754 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 2256	. 2 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
2		sneq 3629	. . 3 ⊢ (𝑥 = 𝐴 → {𝑥} = {𝐴})
3	2	sseq1d 3208	. 2 ⊢ (𝑥 = 𝐴 → ({𝑥} ⊆ 𝐵 ↔ {𝐴} ⊆ 𝐵))
4		vex 2763	. . 3 ⊢ 𝑥 ∈ V
5	4	snss 3753	. 2 ⊢ (𝑥 ∈ 𝐵 ↔ {𝑥} ⊆ 𝐵)
6	1, 3, 5	vtoclbg 2821	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ {𝐴} ⊆ 𝐵))

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1364   ∈ wcel 2164   ⊆ 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: (None)