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

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

Proof of Theorem bnj1520
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 bnj1520.4 . . . . 5  |-  F  = 
U. C
2 bnj1520.3 . . . . . . . 8  |-  C  =  { f  |  E. d  e.  B  (
f  Fn  d  /\  A. x  e.  d  ( f `  x )  =  ( G `  Y ) ) }
32bnj1317 32977 . . . . . . 7  |-  ( w  e.  C  ->  A. f  w  e.  C )
43nfcii 2619 . . . . . 6  |-  F/_ f C
54nfuni 4251 . . . . 5  |-  F/_ f U. C
61, 5nfcxfr 2627 . . . 4  |-  F/_ f F
7 nfcv 2629 . . . 4  |-  F/_ f
x
86, 7nffv 5873 . . 3  |-  F/_ f
( F `  x
)
9 nfcv 2629 . . . 4  |-  F/_ f G
10 nfcv 2629 . . . . . 6  |-  F/_ f  pred ( x ,  A ,  R )
116, 10nfres 5275 . . . . 5  |-  F/_ f
( F  |`  pred (
x ,  A ,  R ) )
127, 11nfop 4229 . . . 4  |-  F/_ f <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >.
139, 12nffv 5873 . . 3  |-  F/_ f
( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >.
)
148, 13nfeq 2640 . 2  |-  F/ f ( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )
1514nfri 1822 1  |-  ( ( F `  x )  =  ( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >. )  ->  A. f
( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369   A.wal 1377    = wceq 1379   {cab 2452   A.wral 2814   E.wrex 2815    C_ wss 3476   <.cop 4033   U.cuni 4245    |` cres 5001    Fn wfn 5583   ` cfv 5588    predc-bnj14 32838
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ral 2819  df-rex 2820  df-rab 2823  df-v 3115  df-dif 3479  df-un 3481  df-in 3483  df-ss 3490  df-nul 3786  df-if 3940  df-sn 4028  df-pr 4030  df-op 4034  df-uni 4246  df-br 4448  df-opab 4506  df-xp 5005  df-res 5011  df-iota 5551  df-fv 5596
This theorem is referenced by:  bnj1501  33220
  Copyright terms: Public domain W3C validator