MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  snexg Structured version   Visualization version   GIF version

Theorem snexg 5405
Description: A singleton built on a set is a set. Special case of snex 5404 which is intuitionistically valid. (Contributed by NM, 7-Aug-1994.) (Revised by Mario Carneiro, 19-May-2013.) Extract from snex 5404 and shorten proof. (Revised by BJ, 15-Jan-2025.) (Proof shortened by GG, 6-Mar-2026.)
Assertion
Ref Expression
snexg (𝐴 ∈ 𝑉 → {𝐴} ∈ V)

Proof of Theorem snexg
StepHypRef Expression
1 snex 5404 . 2 {𝐴} ∈ V
21a1i 11 1 (𝐴 ∈ 𝑉 → {𝐴} ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 2147  Vcvv 3454  {csn 4588
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-v 3456  df-un 4154  df-sn 4589  df-pr 4591
This theorem is used by:  snexOLD  5407  selsALT  5416  snelpwg  5418  intidg  5432  oncutlt  28707  elreno2  28938  mirimanofffr  36670  negprop  38911
  Copyright terms: Public domain W3C validator