Theorem snssiALTVD 45636

Description: Virtual deduction proof of snssiALT 45637. (Contributed by Alan Sare, 11-Sep-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
snssiALTVD	⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)

Proof of Theorem snssiALTVD

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-ss 3919	. . 3 ⊢ ({𝐴} ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵))
2		idn1 45384	. . . . . 6 ⊢ (   𝐴 ∈ 𝐵   ▶   𝐴 ∈ 𝐵   )
3		idn2 45423	. . . . . . 7 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 ∈ {𝐴}   ▶   𝑥 ∈ {𝐴}   )
4		velsn 4603	. . . . . . 7 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
5	3, 4	e2bi 45442	. . . . . 6 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 ∈ {𝐴}   ▶   𝑥 = 𝐴   )
6		eleq1a 2857	. . . . . 6 ⊢ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
7	2, 5, 6	e12 45533	. . . . 5 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 ∈ {𝐴}   ▶   𝑥 ∈ 𝐵   )
8	7	in2 45415	. . . 4 ⊢ (   𝐴 ∈ 𝐵   ▶   (𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵)   )
9	8	gen11 45426	. . 3 ⊢ (   𝐴 ∈ 𝐵   ▶   ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵)   )
10		biimpr 223	. . 3 ⊢ (({𝐴} ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵)) → (∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ 𝐵) → {𝐴} ⊆ 𝐵))
11	1, 9, 10	e01 45501	. 2 ⊢ (   𝐴 ∈ 𝐵   ▶   {𝐴} ⊆ 𝐵   )
12	11	in1 45381	1 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2145   ⊆ wss 3902  {csn 4587

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3455  df-ss 3919  df-sn 4588  df-vd1 45380  df-vd2 45388

This theorem is used by: (None)