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

Theorem bnj558 32914
Description: Technical lemma for bnj852 32933. 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
bnj558.3  |-  D  =  ( om  \  { (/)
} )
bnj558.16  |-  G  =  ( f  u.  { <. m ,  U_ y  e.  ( f `  p
)  pred ( y ,  A ,  R )
>. } )
bnj558.17  |-  ( ta  <->  ( f  Fn  m  /\  ph' 
/\  ps' ) )
bnj558.18  |-  ( si  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  m )
)
bnj558.19  |-  ( et  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  om  /\  m  =  suc  p ) )
bnj558.20  |-  ( ze  <->  ( i  e.  om  /\  suc  i  e.  n  /\  m  =  suc  i ) )
bnj558.21  |-  B  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R )
bnj558.22  |-  C  = 
U_ y  e.  ( f `  p ) 
pred ( y ,  A ,  R )
bnj558.23  |-  K  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R )
bnj558.24  |-  L  = 
U_ y  e.  ( G `  p ) 
pred ( y ,  A ,  R )
bnj558.25  |-  G  =  ( f  u.  { <. m ,  C >. } )
bnj558.28  |-  ( ph'  <->  (
f `  (/) )  = 
pred ( x ,  A ,  R ) )
bnj558.29  |-  ( ps'  <->  A. i  e.  om  ( suc  i  e.  m  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj558.36  |-  ( ( R  FrSe  A  /\  ta  /\  si )  ->  G  Fn  n )
Assertion
Ref Expression
bnj558  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( G `  suc  i )  =  K )
Distinct variable groups:    A, i, p, y    y, G    R, i, p, y    f, i, p, y    i, m, p    p, ph'
Allowed substitution hints:    ta( x, y, f, i, m, n, p)    et( x, y, f, i, m, n, p)    ze( x, y, f, i, m, n, p)    si( x, y, f, i, m, n, p)    A( x, f, m, n)    B( x, y, f, i, m, n, p)    C( x, y, f, i, m, n, p)    D( x, y, f, i, m, n, p)    R( x, f, m, n)    G( x, f, i, m, n, p)    K( x, y, f, i, m, n, p)    L( x, y, f, i, m, n, p)    ph'( x, y, f, i, m, n)    ps'( x, y, f, i, m, n, p)

Proof of Theorem bnj558
StepHypRef Expression
1 bnj558.3 . . 3  |-  D  =  ( om  \  { (/)
} )
2 bnj558.16 . . 3  |-  G  =  ( f  u.  { <. m ,  U_ y  e.  ( f `  p
)  pred ( y ,  A ,  R )
>. } )
3 bnj558.17 . . 3  |-  ( ta  <->  ( f  Fn  m  /\  ph' 
/\  ps' ) )
4 bnj558.18 . . 3  |-  ( si  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  m )
)
5 bnj558.19 . . 3  |-  ( et  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  om  /\  m  =  suc  p ) )
6 bnj558.20 . . 3  |-  ( ze  <->  ( i  e.  om  /\  suc  i  e.  n  /\  m  =  suc  i ) )
7 bnj558.21 . . 3  |-  B  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R )
8 bnj558.22 . . 3  |-  C  = 
U_ y  e.  ( f `  p ) 
pred ( y ,  A ,  R )
9 bnj558.23 . . 3  |-  K  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R )
10 bnj558.24 . . 3  |-  L  = 
U_ y  e.  ( G `  p ) 
pred ( y ,  A ,  R )
11 bnj558.25 . . 3  |-  G  =  ( f  u.  { <. m ,  C >. } )
12 bnj558.28 . . 3  |-  ( ph'  <->  (
f `  (/) )  = 
pred ( x ,  A ,  R ) )
13 bnj558.29 . . 3  |-  ( ps'  <->  A. i  e.  om  ( suc  i  e.  m  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
14 bnj558.36 . . 3  |-  ( ( R  FrSe  A  /\  ta  /\  si )  ->  G  Fn  n )
151, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14bnj557 32913 . 2  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( G `  m )  =  L )
16 bnj422 32722 . . . . 5  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze ) 
<->  ( et  /\  ze  /\  R  FrSe  A  /\  ta ) )
17 bnj253 32711 . . . . 5  |-  ( ( et  /\  ze  /\  R  FrSe  A  /\  ta ) 
<->  ( ( et  /\  ze )  /\  R  FrSe  A  /\  ta ) )
1816, 17bitri 249 . . . 4  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze ) 
<->  ( ( et  /\  ze )  /\  R  FrSe  A  /\  ta ) )
1918simp1bi 1006 . . 3  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( et  /\  ze ) )
205, 6, 9, 10, 9, 10bnj554 32911 . . 3  |-  ( ( et  /\  ze )  ->  ( ( G `  m )  =  L  <-> 
( G `  suc  i )  =  K ) )
2119, 20syl 16 . 2  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( ( G `
 m )  =  L  <->  ( G `  suc  i )  =  K ) )
2215, 21mpbid 210 1  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( G `  suc  i )  =  K )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 968    = wceq 1374    e. wcel 1762   A.wral 2807    \ cdif 3466    u. cun 3467   (/)c0 3778   {csn 4020   <.cop 4026   U_ciun 4318   suc csuc 4873    Fn wfn 5574   ` cfv 5579   omcom 6671    /\ w-bnj17 32693    predc-bnj14 32695    FrSe w-bnj15 32699
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pr 4679  ax-un 6567  ax-reg 8007
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-sbc 3325  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-iun 4320  df-br 4441  df-opab 4499  df-eprel 4784  df-id 4788  df-fr 4831  df-suc 4877  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-res 5004  df-iota 5542  df-fun 5581  df-fn 5582  df-fv 5587  df-bnj17 32694
This theorem is referenced by:  bnj571  32918
  Copyright terms: Public domain W3C validator