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

Theorem bnj540 30962
Description: Technical lemma for bnj852 30991. 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
bnj540.1  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  N  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj540.2  |-  ( ps"  <->  [. G  / 
f ]. ps )
bnj540.3  |-  G  e. 
_V
Assertion
Ref Expression
bnj540  |-  ( ps"  <->  A. i  e.  om  ( suc  i  e.  N  ->  ( G `
 suc  i )  =  U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R ) ) )
Distinct variable groups:    A, f    f, G, i, y    f, N    R, f
Allowed substitution hints:    ps( y, f, i)    A( y, i)    R( y, i)    N( y, i)    ps"( y, f, i)

Proof of Theorem bnj540
StepHypRef Expression
1 bnj540.2 . 2  |-  ( ps"  <->  [. G  / 
f ]. ps )
2 bnj540.1 . . . 4  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  N  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
32sbcbii 3491 . . 3  |-  ( [. G  /  f ]. ps  <->  [. G  /  f ]. A. i  e.  om  ( suc  i  e.  N  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
4 bnj540.3 . . . 4  |-  G  e. 
_V
54bnj538 30809 . . 3  |-  ( [. G  /  f ]. A. i  e.  om  ( suc  i  e.  N  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  A. i  e.  om  [. G  / 
f ]. ( suc  i  e.  N  ->  ( f `
 suc  i )  =  U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) ) )
6 sbcimg 3477 . . . . 5  |-  ( G  e.  _V  ->  ( [. G  /  f ]. ( suc  i  e.  N  ->  ( f `  suc  i )  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) )  <->  ( [. G  /  f ]. suc  i  e.  N  ->  [. G  /  f ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) ) )
74, 6ax-mp 5 . . . 4  |-  ( [. G  /  f ]. ( suc  i  e.  N  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  ( [. G  /  f ]. suc  i  e.  N  ->  [. G  /  f ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
87ralbii 2980 . . 3  |-  ( A. i  e.  om  [. G  /  f ]. ( suc  i  e.  N  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  A. i  e.  om  ( [. G  /  f ]. suc  i  e.  N  ->  [. G  /  f ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
93, 5, 83bitri 286 . 2  |-  ( [. G  /  f ]. ps  <->  A. i  e.  om  ( [. G  /  f ]. suc  i  e.  N  ->  [. G  /  f ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
104bnj525 30807 . . . 4  |-  ( [. G  /  f ]. suc  i  e.  N  <->  suc  i  e.  N )
11 fveq1 6190 . . . . . 6  |-  ( f  =  G  ->  (
f `  suc  i )  =  ( G `  suc  i ) )
12 fveq1 6190 . . . . . . 7  |-  ( f  =  G  ->  (
f `  i )  =  ( G `  i ) )
1312bnj1113 30856 . . . . . 6  |-  ( f  =  G  ->  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R )  =  U_ y  e.  ( G `  i
)  pred ( y ,  A ,  R ) )
1411, 13eqeq12d 2637 . . . . 5  |-  ( f  =  G  ->  (
( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R )  <->  ( G `  suc  i )  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R ) ) )
154, 14sbcie 3470 . . . 4  |-  ( [. G  /  f ]. (
f `  suc  i )  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R )  <-> 
( G `  suc  i )  =  U_ y  e.  ( G `  i )  pred (
y ,  A ,  R ) )
1610, 15imbi12i 340 . . 3  |-  ( (
[. G  /  f ]. suc  i  e.  N  ->  [. G  /  f ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  ( suc  i  e.  N  ->  ( G `  suc  i
)  =  U_ y  e.  ( G `  i
)  pred ( y ,  A ,  R ) ) )
1716ralbii 2980 . 2  |-  ( A. i  e.  om  ( [. G  /  f ]. suc  i  e.  N  ->  [. G  /  f ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  A. i  e.  om  ( suc  i  e.  N  ->  ( G `
 suc  i )  =  U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R ) ) )
181, 9, 173bitri 286 1  |-  ( ps"  <->  A. i  e.  om  ( suc  i  e.  N  ->  ( G `
 suc  i )  =  U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    = wceq 1483    e. wcel 1990   A.wral 2912   _Vcvv 3200   [.wsbc 3435   U_ciun 4520   suc csuc 5725   ` cfv 5888   omcom 7065    predc-bnj14 30754
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-v 3202  df-sbc 3436  df-in 3581  df-ss 3588  df-uni 4437  df-iun 4522  df-br 4654  df-iota 5851  df-fv 5896
This theorem is referenced by:  bnj580  30983  bnj607  30986
  Copyright terms: Public domain W3C validator