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

Theorem bnj953 29287
Description: Technical lemma for bnj69 29356. 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
bnj953.1  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj953.2  |-  ( ( G `  i )  =  ( f `  i )  ->  A. y
( G `  i
)  =  ( f `
 i ) )
Assertion
Ref Expression
bnj953  |-  ( ( ( G `  i
)  =  ( f `
 i )  /\  ( G `  suc  i
)  =  ( f `
 suc  i )  /\  ( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )  ->  ( G `  suc  i )  =  U_ y  e.  ( G `  i )  pred (
y ,  A ,  R ) )

Proof of Theorem bnj953
StepHypRef Expression
1 bnj312 29053 . . 3  |-  ( ( ( G `  i
)  =  ( f `
 i )  /\  ( G `  suc  i
)  =  ( f `
 suc  i )  /\  ( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )  <->  ( ( G `  suc  i )  =  ( f `  suc  i
)  /\  ( G `  i )  =  ( f `  i )  /\  ( i  e. 
om  /\  suc  i  e.  n )  /\  ps ) )
2 bnj251 29043 . . 3  |-  ( ( ( G `  suc  i )  =  ( f `  suc  i
)  /\  ( G `  i )  =  ( f `  i )  /\  ( i  e. 
om  /\  suc  i  e.  n )  /\  ps ) 
<->  ( ( G `  suc  i )  =  ( f `  suc  i
)  /\  ( ( G `  i )  =  ( f `  i )  /\  (
( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )
) ) )
31, 2bitri 240 . 2  |-  ( ( ( G `  i
)  =  ( f `
 i )  /\  ( G `  suc  i
)  =  ( f `
 suc  i )  /\  ( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )  <->  ( ( G `  suc  i )  =  ( f `  suc  i
)  /\  ( ( G `  i )  =  ( f `  i )  /\  (
( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )
) ) )
4 bnj953.1 . . . . . 6  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
54bnj115 29067 . . . . 5  |-  ( ps  <->  A. i ( ( i  e.  om  /\  suc  i  e.  n )  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
6 sp 1728 . . . . . 6  |-  ( A. i ( ( i  e.  om  /\  suc  i  e.  n )  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  -> 
( ( i  e. 
om  /\  suc  i  e.  n )  ->  (
f `  suc  i )  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R ) ) )
76impcom 419 . . . . 5  |-  ( ( ( i  e.  om  /\ 
suc  i  e.  n
)  /\  A. i
( ( i  e. 
om  /\  suc  i  e.  n )  ->  (
f `  suc  i )  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R ) ) )  ->  (
f `  suc  i )  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R ) )
85, 7sylan2b 461 . . . 4  |-  ( ( ( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )
9 bnj953.2 . . . . 5  |-  ( ( G `  i )  =  ( f `  i )  ->  A. y
( G `  i
)  =  ( f `
 i ) )
109bnj956 29124 . . . 4  |-  ( ( G `  i )  =  ( f `  i )  ->  U_ y  e.  ( G `  i
)  pred ( y ,  A ,  R )  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R ) )
11 eqtr3 2315 . . . 4  |-  ( ( ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R )  /\  U_ y  e.  ( G `  i )  pred (
y ,  A ,  R )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  -> 
( f `  suc  i )  =  U_ y  e.  ( G `  i )  pred (
y ,  A ,  R ) )
128, 10, 11syl2anr 464 . . 3  |-  ( ( ( G `  i
)  =  ( f `
 i )  /\  ( ( i  e. 
om  /\  suc  i  e.  n )  /\  ps ) )  ->  (
f `  suc  i )  =  U_ y  e.  ( G `  i
)  pred ( y ,  A ,  R ) )
13 eqtr 2313 . . 3  |-  ( ( ( G `  suc  i )  =  ( f `  suc  i
)  /\  ( f `  suc  i )  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R ) )  ->  ( G `  suc  i )  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R ) )
1412, 13sylan2 460 . 2  |-  ( ( ( G `  suc  i )  =  ( f `  suc  i
)  /\  ( ( G `  i )  =  ( f `  i )  /\  (
( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )
) )  ->  ( G `  suc  i )  =  U_ y  e.  ( G `  i
)  pred ( y ,  A ,  R ) )
153, 14sylbi 187 1  |-  ( ( ( G `  i
)  =  ( f `
 i )  /\  ( G `  suc  i
)  =  ( f `
 suc  i )  /\  ( i  e.  om  /\ 
suc  i  e.  n
)  /\  ps )  ->  ( G `  suc  i )  =  U_ y  e.  ( G `  i )  pred (
y ,  A ,  R ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358   A.wal 1530    = wceq 1632    e. wcel 1696   A.wral 2556   U_ciun 3921   suc csuc 4410   omcom 4672   ` cfv 5271    /\ w-bnj17 29027    predc-bnj14 29029
This theorem is referenced by:  bnj967  29293
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-ral 2561  df-rex 2562  df-iun 3923  df-bnj17 29028
  Copyright terms: Public domain W3C validator