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

Theorem bnj557 30971
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
bnj557.3  |-  D  =  ( om  \  { (/)
} )
bnj557.16  |-  G  =  ( f  u.  { <. m ,  U_ y  e.  ( f `  p
)  pred ( y ,  A ,  R )
>. } )
bnj557.17  |-  ( ta  <->  ( f  Fn  m  /\  ph' 
/\  ps' ) )
bnj557.18  |-  ( si  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  m )
)
bnj557.19  |-  ( et  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  om  /\  m  =  suc  p ) )
bnj557.20  |-  ( ze  <->  ( i  e.  om  /\  suc  i  e.  n  /\  m  =  suc  i ) )
bnj557.21  |-  B  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R )
bnj557.22  |-  C  = 
U_ y  e.  ( f `  p ) 
pred ( y ,  A ,  R )
bnj557.23  |-  K  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R )
bnj557.24  |-  L  = 
U_ y  e.  ( G `  p ) 
pred ( y ,  A ,  R )
bnj557.25  |-  G  =  ( f  u.  { <. m ,  C >. } )
bnj557.28  |-  ( ph'  <->  (
f `  (/) )  = 
pred ( x ,  A ,  R ) )
bnj557.29  |-  ( ps'  <->  A. i  e.  om  ( suc  i  e.  m  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj557.36  |-  ( ( R  FrSe  A  /\  ta  /\  si )  ->  G  Fn  n )
Assertion
Ref Expression
bnj557  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( G `  m )  =  L )
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 bnj557
StepHypRef Expression
1 3an4anass 1291 . . . . 5  |-  ( ( ( R  FrSe  A  /\  ta  /\  et )  /\  ze )  <->  ( ( R  FrSe  A  /\  ta )  /\  ( et  /\  ze ) ) )
2 bnj557.18 . . . . . . . 8  |-  ( si  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  m )
)
3 bnj557.19 . . . . . . . 8  |-  ( et  <->  ( m  e.  D  /\  n  =  suc  m  /\  p  e.  om  /\  m  =  suc  p ) )
42, 3bnj556 30970 . . . . . . 7  |-  ( et 
->  si )
543anim3i 1250 . . . . . 6  |-  ( ( R  FrSe  A  /\  ta  /\  et )  -> 
( R  FrSe  A  /\  ta  /\  si )
)
6 bnj557.20 . . . . . . 7  |-  ( ze  <->  ( i  e.  om  /\  suc  i  e.  n  /\  m  =  suc  i ) )
7 vex 3203 . . . . . . . 8  |-  i  e. 
_V
87bnj216 30800 . . . . . . 7  |-  ( m  =  suc  i  -> 
i  e.  m )
96, 8bnj837 30831 . . . . . 6  |-  ( ze 
->  i  e.  m
)
105, 9anim12i 590 . . . . 5  |-  ( ( ( R  FrSe  A  /\  ta  /\  et )  /\  ze )  -> 
( ( R  FrSe  A  /\  ta  /\  si )  /\  i  e.  m
) )
111, 10sylbir 225 . . . 4  |-  ( ( ( R  FrSe  A  /\  ta )  /\  ( et  /\  ze ) )  ->  ( ( R 
FrSe  A  /\  ta  /\  si )  /\  i  e.  m ) )
123bnj1254 30880 . . . . . 6  |-  ( et 
->  m  =  suc  p )
136simp3bi 1078 . . . . . 6  |-  ( ze 
->  m  =  suc  i )
14 bnj551 30812 . . . . . 6  |-  ( ( m  =  suc  p  /\  m  =  suc  i )  ->  p  =  i )
1512, 13, 14syl2an 494 . . . . 5  |-  ( ( et  /\  ze )  ->  p  =  i )
1615adantl 482 . . . 4  |-  ( ( ( R  FrSe  A  /\  ta )  /\  ( et  /\  ze ) )  ->  p  =  i )
1711, 16jca 554 . . 3  |-  ( ( ( R  FrSe  A  /\  ta )  /\  ( et  /\  ze ) )  ->  ( ( ( R  FrSe  A  /\  ta  /\  si )  /\  i  e.  m )  /\  p  =  i
) )
18 bnj256 30772 . . 3  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze ) 
<->  ( ( R  FrSe  A  /\  ta )  /\  ( et  /\  ze )
) )
19 df-3an 1039 . . 3  |-  ( ( ( R  FrSe  A  /\  ta  /\  si )  /\  i  e.  m  /\  p  =  i
)  <->  ( ( ( R  FrSe  A  /\  ta  /\  si )  /\  i  e.  m )  /\  p  =  i
) )
2017, 18, 193imtr4i 281 . 2  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( ( R 
FrSe  A  /\  ta  /\  si )  /\  i  e.  m  /\  p  =  i ) )
21 bnj557.28 . . 3  |-  ( ph'  <->  (
f `  (/) )  = 
pred ( x ,  A ,  R ) )
22 bnj557.29 . . 3  |-  ( ps'  <->  A. i  e.  om  ( suc  i  e.  m  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
23 bnj557.3 . . 3  |-  D  =  ( om  \  { (/)
} )
24 bnj557.16 . . 3  |-  G  =  ( f  u.  { <. m ,  U_ y  e.  ( f `  p
)  pred ( y ,  A ,  R )
>. } )
25 bnj557.17 . . 3  |-  ( ta  <->  ( f  Fn  m  /\  ph' 
/\  ps' ) )
26 bnj557.22 . . 3  |-  C  = 
U_ y  e.  ( f `  p ) 
pred ( y ,  A ,  R )
27 bnj557.25 . . 3  |-  G  =  ( f  u.  { <. m ,  C >. } )
28 bnj557.21 . . 3  |-  B  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R )
29 bnj557.23 . . 3  |-  K  = 
U_ y  e.  ( G `  i ) 
pred ( y ,  A ,  R )
30 bnj557.24 . . 3  |-  L  = 
U_ y  e.  ( G `  p ) 
pred ( y ,  A ,  R )
31 bnj557.36 . . 3  |-  ( ( R  FrSe  A  /\  ta  /\  si )  ->  G  Fn  n )
3221, 22, 23, 24, 25, 2, 26, 27, 28, 29, 30, 31bnj553 30968 . 2  |-  ( ( ( R  FrSe  A  /\  ta  /\  si )  /\  i  e.  m  /\  p  =  i
)  ->  ( G `  m )  =  L )
3320, 32syl 17 1  |-  ( ( R  FrSe  A  /\  ta  /\  et  /\  ze )  ->  ( G `  m )  =  L )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   A.wral 2912    \ cdif 3571    u. cun 3572   (/)c0 3915   {csn 4177   <.cop 4183   U_ciun 4520   suc csuc 5725    Fn wfn 5883   ` cfv 5888   omcom 7065    /\ w-bnj17 30752    predc-bnj14 30754    FrSe w-bnj15 30758
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-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949  ax-reg 8497
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-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-id 5024  df-eprel 5029  df-fr 5073  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-res 5126  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896  df-bnj17 30753
This theorem is referenced by:  bnj558  30972
  Copyright terms: Public domain W3C validator