Theorem snelpwiOLD 5455

Description: Obsolete version of snelpwi 5454 as of 17-Jan-2025. (Contributed by NM, 28-May-1995.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
snelpwiOLD	⊢ (𝐴 ∈ 𝐵 → {𝐴} ∈ 𝒫 𝐵)

Proof of Theorem snelpwiOLD

Step	Hyp	Ref	Expression
1		snssi 4813	. 2 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵)
2		snex 5442	. . 3 ⊢ {𝐴} ∈ V
3	2	elpw 4609	. 2 ⊢ ({𝐴} ∈ 𝒫 𝐵 ↔ {𝐴} ⊆ 𝐵)
4	1, 3	sylibr 234	1 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ∈ 𝒫 𝐵)

Syntax hints:   → wi 4   ∈ wcel 2106   ⊆ wss 3963  𝒫 cpw 4605  {csn 4631

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-v 3480  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-pw 4607  df-sn 4632  df-pr 4634

This theorem is referenced by: (None)