Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-snexg Unicode version

Theorem bj-snexg 15150
Description: snexg 4205 from bounded separation. (Contributed by BJ, 5-Oct-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-snexg  |-  ( A  e.  V  ->  { A }  e.  _V )

Proof of Theorem bj-snexg
StepHypRef Expression
1 dfsn2 3624 . 2  |-  { A }  =  { A ,  A }
2 bj-prexg 15149 . . 3  |-  ( ( A  e.  V  /\  A  e.  V )  ->  { A ,  A }  e.  _V )
32anidms 397 . 2  |-  ( A  e.  V  ->  { A ,  A }  e.  _V )
41, 3eqeltrid 2276 1  |-  ( A  e.  V  ->  { A }  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2160   _Vcvv 2752   {csn 3610   {cpr 3611
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-14 2163  ax-ext 2171  ax-pr 4230  ax-bdor 15054  ax-bdeq 15058  ax-bdsep 15122
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-v 2754  df-un 3148  df-sn 3616  df-pr 3617
This theorem is referenced by:  bj-snex  15151  bj-sels  15152  bj-sucexg  15160
  Copyright terms: Public domain W3C validator