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

Theorem bnj528 29262
Description: Technical lemma for bnj852 29294. 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 29137 1  |-  G  e. 
_V
Colors of variables: wff set class
Syntax hints:    = wceq 1653    e. wcel 1726   _Vcvv 2958    u. cun 3320   {csn 3816   <.cop 3819   U_ciun 4095   ` cfv 5456    predc-bnj14 29054
This theorem is referenced by:  bnj600  29292  bnj908  29304
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4332  ax-nul 4340  ax-pr 4405  ax-un 4703
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-rex 2713  df-v 2960  df-dif 3325  df-un 3327  df-nul 3631  df-sn 3822  df-pr 3823  df-uni 4018
  Copyright terms: Public domain W3C validator