Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj95 Unicode version

Theorem bnj95 29212
Description: Technical lemma for bnj124 29219. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj95.1  |-  F  =  { <. (/) ,  pred (
x ,  A ,  R ) >. }
Assertion
Ref Expression
bnj95  |-  F  e. 
_V

Proof of Theorem bnj95
StepHypRef Expression
1 bnj95.1 . 2  |-  F  =  { <. (/) ,  pred (
x ,  A ,  R ) >. }
2 snex 4232 . 2  |-  { <. (/)
,  pred ( x ,  A ,  R )
>. }  e.  _V
31, 2eqeltri 2366 1  |-  F  e. 
_V
Colors of variables: wff set class
Syntax hints:    = wceq 1632    e. wcel 1696   _Vcvv 2801   (/)c0 3468   {csn 3653   <.cop 3656    predc-bnj14 29029
This theorem is referenced by:  bnj124  29219  bnj125  29220  bnj126  29221  bnj150  29224
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-v 2803  df-dif 3168  df-un 3170  df-nul 3469  df-sn 3659  df-pr 3660
  Copyright terms: Public domain W3C validator