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

Theorem bnj981 29763
Description: Technical lemma for bnj69 29821. 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
bnj981.1  |-  ( ph  <->  ( f `  (/) )  = 
pred ( X ,  A ,  R )
)
bnj981.2  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj981.3  |-  D  =  ( om  \  { (/)
} )
bnj981.4  |-  B  =  { f  |  E. n  e.  D  (
f  Fn  n  /\  ph 
/\  ps ) }
bnj981.5  |-  ( ch  <->  ( n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps ) )
Assertion
Ref Expression
bnj981  |-  ( Z  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i ) ) )
Distinct variable groups:    A, f,
i, n, y    D, i, y    R, f, i, n, y    f, X, i, n, y    f, Z, i, n, y    ph, i,
y
Allowed substitution hints:    ph( f, n)    ps( y, f, i, n)    ch( y, f, i, n)    B( y, f, i, n)    D( f, n)

Proof of Theorem bnj981
StepHypRef Expression
1 nfv 1752 . . . 4  |-  F/ y  Z  e.  trCl ( X ,  A ,  R )
2 bnj981.2 . . . . . . . . . . . 12  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
3 nfcv 2585 . . . . . . . . . . . . 13  |-  F/_ y om
4 nfv 1752 . . . . . . . . . . . . . 14  |-  F/ y  suc  i  e.  n
5 nfiu1 4327 . . . . . . . . . . . . . . 15  |-  F/_ y U_ y  e.  (
f `  i )  pred ( y ,  A ,  R )
65nfeq2 2602 . . . . . . . . . . . . . 14  |-  F/ y ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R )
74, 6nfim 1977 . . . . . . . . . . . . 13  |-  F/ y ( suc  i  e.  n  ->  ( f `  suc  i )  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) )
83, 7nfral 2812 . . . . . . . . . . . 12  |-  F/ y A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )
92, 8nfxfr 1693 . . . . . . . . . . 11  |-  F/ y ps
109nfri 1926 . . . . . . . . . 10  |-  ( ps 
->  A. y ps )
11 bnj981.5 . . . . . . . . . 10  |-  ( ch  <->  ( n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps ) )
1210, 11bnj1096 29596 . . . . . . . . 9  |-  ( ch 
->  A. y ch )
1312nfi 1671 . . . . . . . 8  |-  F/ y ch
14 nfv 1752 . . . . . . . 8  |-  F/ y  i  e.  n
15 nfv 1752 . . . . . . . 8  |-  F/ y  Z  e.  ( f `
 i )
1613, 14, 15nf3an 1987 . . . . . . 7  |-  F/ y ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i
) )
1716nfex 2005 . . . . . 6  |-  F/ y E. i ( ch 
/\  i  e.  n  /\  Z  e.  (
f `  i )
)
1817nfex 2005 . . . . 5  |-  F/ y E. n E. i
( ch  /\  i  e.  n  /\  Z  e.  ( f `  i
) )
1918nfex 2005 . . . 4  |-  F/ y E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i ) )
201, 19nfim 1977 . . 3  |-  F/ y ( Z  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i
) ) )
21 eleq1 2495 . . . 4  |-  ( y  =  Z  ->  (
y  e.  trCl ( X ,  A ,  R )  <->  Z  e.  trCl ( X ,  A ,  R ) ) )
22 eleq1 2495 . . . . . 6  |-  ( y  =  Z  ->  (
y  e.  ( f `
 i )  <->  Z  e.  ( f `  i
) ) )
23223anbi3d 1342 . . . . 5  |-  ( y  =  Z  ->  (
( ch  /\  i  e.  n  /\  y  e.  ( f `  i
) )  <->  ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i ) ) ) )
24233exbidv 1762 . . . 4  |-  ( y  =  Z  ->  ( E. f E. n E. i ( ch  /\  i  e.  n  /\  y  e.  ( f `  i ) )  <->  E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i
) ) ) )
2521, 24imbi12d 322 . . 3  |-  ( y  =  Z  ->  (
( y  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  y  e.  ( f `  i
) ) )  <->  ( Z  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i ) ) ) ) )
26 bnj981.1 . . . 4  |-  ( ph  <->  ( f `  (/) )  = 
pred ( X ,  A ,  R )
)
27 bnj981.3 . . . 4  |-  D  =  ( om  \  { (/)
} )
28 bnj981.4 . . . 4  |-  B  =  { f  |  E. n  e.  D  (
f  Fn  n  /\  ph 
/\  ps ) }
2926, 2, 27, 28, 11bnj917 29747 . . 3  |-  ( y  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  y  e.  ( f `  i ) ) )
3020, 25, 29vtoclg1f 3139 . 2  |-  ( Z  e.  trCl ( X ,  A ,  R )  ->  ( Z  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i
) ) ) )
3130pm2.43i 50 1  |-  ( Z  e.  trCl ( X ,  A ,  R )  ->  E. f E. n E. i ( ch  /\  i  e.  n  /\  Z  e.  ( f `  i ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 188    /\ w3a 983    = wceq 1438   E.wex 1660    e. wcel 1869   {cab 2408   A.wral 2776   E.wrex 2777    \ cdif 3434   (/)c0 3762   {csn 3997   U_ciun 4297   suc csuc 5442    Fn wfn 5594   ` cfv 5599   omcom 6704    /\ w-bnj17 29493    predc-bnj14 29495    trClc-bnj18 29501
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1666  ax-4 1679  ax-5 1749  ax-6 1795  ax-7 1840  ax-10 1888  ax-11 1893  ax-12 1906  ax-13 2054  ax-ext 2401
This theorem depends on definitions:  df-bi 189  df-an 373  df-3an 985  df-tru 1441  df-ex 1661  df-nf 1665  df-sb 1788  df-clab 2409  df-cleq 2415  df-clel 2418  df-nfc 2573  df-ral 2781  df-rex 2782  df-v 3084  df-iun 4299  df-fn 5602  df-bnj17 29494  df-bnj18 29502
This theorem is referenced by:  bnj1128  29801
  Copyright terms: Public domain W3C validator