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

Theorem bnj1519 29095
Description: Technical lemma for bnj1500 29098. 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.)
Hypotheses
Ref Expression
bnj1519.1  |-  B  =  { d  |  ( d  C_  A  /\  A. x  e.  d  pred ( x ,  A ,  R )  C_  d
) }
bnj1519.2  |-  Y  = 
<. x ,  ( f  |`  pred ( x ,  A ,  R ) ) >.
bnj1519.3  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
bnj1519.4  |-  F  = 
U. C
Assertion
Ref Expression
bnj1519  |-  ( ( F `  x )  =  ( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >. )  ->  A. d
( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )
)
Distinct variable groups:    A, d    G, d    R, d    x, d
Allowed substitution hints:    A( x, f)    B( x, f, d)    C( x, f, d)    R( x, f)    F( x, f, d)    G( x, f)    Y( x, f, d)

Proof of Theorem bnj1519
StepHypRef Expression
1 bnj1519.4 . . . . 5  |-  F  = 
U. C
2 bnj1519.3 . . . . . . 7  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
3 nfre1 2599 . . . . . . . 8  |-  F/ d E. d  e.  B  ( f  Fn  d  /\  A. x  e.  d  ( f `  x
)  =  ( G `
 Y ) )
43nfab 2423 . . . . . . 7  |-  F/_ d { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
52, 4nfcxfr 2416 . . . . . 6  |-  F/_ d C
65nfuni 3833 . . . . 5  |-  F/_ d U. C
71, 6nfcxfr 2416 . . . 4  |-  F/_ d F
8 nfcv 2419 . . . 4  |-  F/_ d
x
97, 8nffv 5532 . . 3  |-  F/_ d
( F `  x
)
10 nfcv 2419 . . . 4  |-  F/_ d G
11 nfcv 2419 . . . . . 6  |-  F/_ d  pred ( x ,  A ,  R )
127, 11nfres 4957 . . . . 5  |-  F/_ d
( F  |`  pred (
x ,  A ,  R ) )
138, 12nfop 3812 . . . 4  |-  F/_ d <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >.
1410, 13nffv 5532 . . 3  |-  F/_ d
( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >.
)
159, 14nfeq 2426 . 2  |-  F/ d ( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )
1615nfri 1742 1  |-  ( ( F `  x )  =  ( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >. )  ->  A. d
( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358   A.wal 1527    = wceq 1623   {cab 2269   A.wral 2543   E.wrex 2544    C_ wss 3152   <.cop 3643   U.cuni 3827    |` cres 4691    Fn wfn 5250   ` cfv 5255    predc-bnj14 28713
This theorem is referenced by:  bnj1501  29097
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-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  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-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-xp 4695  df-res 4701  df-iota 5219  df-fv 5263
  Copyright terms: Public domain W3C validator