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

Theorem bnj1529 28862
Description: Technical lemma for bnj1522 28864. 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
bnj1529.1  |-  ( ch 
->  A. x  e.  A  ( F `  x )  =  ( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >. ) )
bnj1529.2  |-  ( w  e.  F  ->  A. x  w  e.  F )
Assertion
Ref Expression
bnj1529  |-  ( ch 
->  A. y  e.  A  ( F `  y )  =  ( G `  <. y ,  ( F  |`  pred ( y ,  A ,  R ) ) >. ) )
Distinct variable groups:    w, A, x, y    w, F, y   
w, G, x, y   
w, R, x, y
Allowed substitution hints:    ch( x, y, w)    F( x)

Proof of Theorem bnj1529
StepHypRef Expression
1 bnj1529.1 . 2  |-  ( ch 
->  A. x  e.  A  ( F `  x )  =  ( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >. ) )
2 nfv 1619 . . 3  |-  F/ y ( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )
3 bnj1529.2 . . . . . 6  |-  ( w  e.  F  ->  A. x  w  e.  F )
43nfcii 2485 . . . . 5  |-  F/_ x F
5 nfcv 2494 . . . . 5  |-  F/_ x
y
64, 5nffv 5615 . . . 4  |-  F/_ x
( F `  y
)
7 nfcv 2494 . . . . 5  |-  F/_ x G
8 nfcv 2494 . . . . . . 7  |-  F/_ x  pred ( y ,  A ,  R )
94, 8nfres 5039 . . . . . 6  |-  F/_ x
( F  |`  pred (
y ,  A ,  R ) )
105, 9nfop 3893 . . . . 5  |-  F/_ x <. y ,  ( F  |`  pred ( y ,  A ,  R ) ) >.
117, 10nffv 5615 . . . 4  |-  F/_ x
( G `  <. y ,  ( F  |`  pred ( y ,  A ,  R ) ) >.
)
126, 11nfeq 2501 . . 3  |-  F/ x
( F `  y
)  =  ( G `
 <. y ,  ( F  |`  pred ( y ,  A ,  R
) ) >. )
13 fveq2 5608 . . . 4  |-  ( x  =  y  ->  ( F `  x )  =  ( F `  y ) )
14 id 19 . . . . . 6  |-  ( x  =  y  ->  x  =  y )
15 bnj602 28709 . . . . . . 7  |-  ( x  =  y  ->  pred (
x ,  A ,  R )  =  pred ( y ,  A ,  R ) )
1615reseq2d 5037 . . . . . 6  |-  ( x  =  y  ->  ( F  |`  pred ( x ,  A ,  R ) )  =  ( F  |`  pred ( y ,  A ,  R ) ) )
1714, 16opeq12d 3885 . . . . 5  |-  ( x  =  y  ->  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >.  =  <. y ,  ( F  |`  pred ( y ,  A ,  R
) ) >. )
1817fveq2d 5612 . . . 4  |-  ( x  =  y  ->  ( G `  <. x ,  ( F  |`  pred (
x ,  A ,  R ) ) >.
)  =  ( G `
 <. y ,  ( F  |`  pred ( y ,  A ,  R
) ) >. )
)
1913, 18eqeq12d 2372 . . 3  |-  ( x  =  y  ->  (
( F `  x
)  =  ( G `
 <. x ,  ( F  |`  pred ( x ,  A ,  R
) ) >. )  <->  ( F `  y )  =  ( G `  <. y ,  ( F  |`  pred ( y ,  A ,  R ) ) >. ) ) )
202, 12, 19cbvral 2836 . 2  |-  ( A. x  e.  A  ( F `  x )  =  ( G `  <. x ,  ( F  |`  pred ( x ,  A ,  R ) ) >. )  <->  A. y  e.  A  ( F `  y )  =  ( G `  <. y ,  ( F  |`  pred ( y ,  A ,  R ) ) >.
) )
211, 20sylib 188 1  |-  ( ch 
->  A. y  e.  A  ( F `  y )  =  ( G `  <. y ,  ( F  |`  pred ( y ,  A ,  R ) ) >. ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1540    = wceq 1642    e. wcel 1710   A.wral 2619   <.cop 3719    |` cres 4773   ` cfv 5337    predc-bnj14 28475
This theorem is referenced by:  bnj1523  28863
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ral 2624  df-rex 2625  df-rab 2628  df-v 2866  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-nul 3532  df-if 3642  df-sn 3722  df-pr 3723  df-op 3725  df-uni 3909  df-br 4105  df-opab 4159  df-xp 4777  df-res 4783  df-iota 5301  df-fv 5345  df-bnj14 28476
  Copyright terms: Public domain W3C validator