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

Theorem bnj528 28921
Description: Technical lemma for bnj852 28953. 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
bnj528.1  |-  G  =  ( f  u.  { <. m ,  U_ y  e.  ( f `  p
)  pred ( y ,  A ,  R )
>. } )
Assertion
Ref Expression
bnj528  |-  G  e. 
_V

Proof of Theorem bnj528
StepHypRef Expression
1 bnj528.1 . 2  |-  G  =  ( f  u.  { <. m ,  U_ y  e.  ( f `  p
)  pred ( y ,  A ,  R )
>. } )
21bnj918 28796 1  |-  G  e. 
_V
Colors of variables: wff set class
Syntax hints:    = wceq 1623    e. wcel 1684   _Vcvv 2788    u. cun 3150   {csn 3640   <.cop 3643   U_ciun 3905   ` cfv 5255    predc-bnj14 28713
This theorem is referenced by:  bnj600  28951  bnj908  28963
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-rex 2549  df-v 2790  df-dif 3155  df-un 3157  df-nul 3456  df-sn 3646  df-pr 3647  df-uni 3828
  Copyright terms: Public domain W3C validator