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

Theorem bnj150 34281
Description: Technical lemma for bnj151 34282. 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
bnj150.1  |-  ( ph  <->  ( f `  (/) )  = 
pred ( x ,  A ,  R ) )
bnj150.2  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj150.3  |-  ( ze  <->  ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) ) )
bnj150.4  |-  ( ph'  <->  [. 1o  /  n ]. ph )
bnj150.5  |-  ( ps'  <->  [. 1o  /  n ]. ps )
bnj150.6  |-  ( th0  <->  (
( R  FrSe  A  /\  x  e.  A
)  ->  E. f
( f  Fn  1o  /\  ph'  /\  ps' ) ) )
bnj150.7  |-  ( ze'  <->  [. 1o  /  n ]. ze )
bnj150.8  |-  F  =  { <. (/) ,  pred (
x ,  A ,  R ) >. }
bnj150.9  |-  ( ph"  <->  [. F  / 
f ]. ph' )
bnj150.10  |-  ( ps"  <->  [. F  / 
f ]. ps' )
bnj150.11  |-  ( ze"  <->  [. F  / 
f ]. ze' )
Assertion
Ref Expression
bnj150  |-  th0
Distinct variable groups:    A, f, n, x    f, F, i, y    R, f, n, x   
f, ze"    i, n, y
Allowed substitution hints:    ph( x, y, f, i, n)    ps( x, y, f, i, n)    ze( x, y, f, i, n)    A( y, i)    R( y, i)    F( x, n)    ph'( x, y, f, i, n)    ps'( x, y, f, i, n)    ze'( x, y, f, i, n)    ph"( x, y, f, i, n)    ps"( x, y, f, i, n)    ze"( x, y, i, n)    th0( x, y, f, i, n)

Proof of Theorem bnj150
StepHypRef Expression
1 0ex 4497 . . . . . . . . . 10  |-  (/)  e.  _V
2 bnj93 34268 . . . . . . . . . 10  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  pred ( x ,  A ,  R )  e.  _V )
3 funsng 5542 . . . . . . . . . 10  |-  ( (
(/)  e.  _V  /\  pred ( x ,  A ,  R )  e.  _V )  ->  Fun  { <. (/) ,  pred ( x ,  A ,  R ) >. } )
41, 2, 3sylancr 661 . . . . . . . . 9  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  Fun  { <. (/) ,  pred ( x ,  A ,  R ) >. } )
5 bnj150.8 . . . . . . . . . 10  |-  F  =  { <. (/) ,  pred (
x ,  A ,  R ) >. }
65funeqi 5516 . . . . . . . . 9  |-  ( Fun 
F  <->  Fun  { <. (/) ,  pred ( x ,  A ,  R ) >. } )
74, 6sylibr 212 . . . . . . . 8  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  Fun  F )
85bnj96 34270 . . . . . . . 8  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  dom  F  =  1o )
97, 8bnj1422 34243 . . . . . . 7  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  F  Fn  1o )
105bnj97 34271 . . . . . . . 8  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  ( F `  (/) )  = 
pred ( x ,  A ,  R ) )
11 bnj150.1 . . . . . . . . 9  |-  ( ph  <->  ( f `  (/) )  = 
pred ( x ,  A ,  R ) )
12 bnj150.4 . . . . . . . . 9  |-  ( ph'  <->  [. 1o  /  n ]. ph )
13 bnj150.9 . . . . . . . . 9  |-  ( ph"  <->  [. F  / 
f ]. ph' )
1411, 12, 13, 5bnj125 34277 . . . . . . . 8  |-  ( ph"  <->  ( F `  (/) )  =  pred ( x ,  A ,  R ) )
1510, 14sylibr 212 . . . . . . 7  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  ph" )
169, 15jca 530 . . . . . 6  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  ( F  Fn  1o  /\  ph" ) )
17 bnj98 34272 . . . . . . 7  |-  A. i  e.  om  ( suc  i  e.  1o  ->  ( F `  suc  i )  = 
U_ y  e.  ( F `  i ) 
pred ( y ,  A ,  R ) )
18 bnj150.2 . . . . . . . 8  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
19 bnj150.5 . . . . . . . 8  |-  ( ps'  <->  [. 1o  /  n ]. ps )
20 bnj150.10 . . . . . . . 8  |-  ( ps"  <->  [. F  / 
f ]. ps' )
2118, 19, 20, 5bnj126 34278 . . . . . . 7  |-  ( ps"  <->  A. i  e.  om  ( suc  i  e.  1o  ->  ( F `  suc  i )  = 
U_ y  e.  ( F `  i ) 
pred ( y ,  A ,  R ) ) )
2217, 21mpbir 209 . . . . . 6  |-  ps"
2316, 22jctir 536 . . . . 5  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  ( ( F  Fn  1o  /\  ph" )  /\  ps" ) )
24 df-3an 973 . . . . 5  |-  ( ( F  Fn  1o  /\  ph"  /\  ps" )  <->  ( ( F  Fn  1o  /\  ph" )  /\  ps" ) )
2523, 24sylibr 212 . . . 4  |-  ( ( R  FrSe  A  /\  x  e.  A )  ->  ( F  Fn  1o  /\  ph" 
/\  ps" ) )
26 bnj150.11 . . . . 5  |-  ( ze"  <->  [. F  / 
f ]. ze' )
27 bnj150.3 . . . . . 6  |-  ( ze  <->  ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) ) )
28 bnj150.7 . . . . . 6  |-  ( ze'  <->  [. 1o  /  n ]. ze )
2927, 28, 12, 19bnj121 34275 . . . . 5  |-  ( ze'  <->  (
( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  1o  /\  ph'  /\  ps' ) ) )
305, 13, 20, 26, 29bnj124 34276 . . . 4  |-  ( ze"  <->  ( ( R  FrSe  A  /\  x  e.  A )  ->  ( F  Fn  1o  /\  ph"  /\  ps" ) ) )
3125, 30mpbir 209 . . 3  |-  ze"
325bnj95 34269 . . . 4  |-  F  e. 
_V
33 sbceq1a 3263 . . . . 5  |-  ( f  =  F  ->  ( ze'  <->  [. F  /  f ]. ze' ) )
3433, 26syl6bbr 263 . . . 4  |-  ( f  =  F  ->  ( ze'  <->  ze" ) )
3532, 34spcev 3126 . . 3  |-  ( ze"  ->  E. f ze' )
3631, 35ax-mp 5 . 2  |-  E. f ze'
37 bnj150.6 . . . 4  |-  ( th0  <->  (
( R  FrSe  A  /\  x  e.  A
)  ->  E. f
( f  Fn  1o  /\  ph'  /\  ps' ) ) )
38 19.37v 1776 . . . 4  |-  ( E. f ( ( R 
FrSe  A  /\  x  e.  A )  ->  (
f  Fn  1o  /\  ph' 
/\  ps' ) )  <->  ( ( R  FrSe  A  /\  x  e.  A )  ->  E. f
( f  Fn  1o  /\  ph'  /\  ps' ) ) )
3937, 38bitr4i 252 . . 3  |-  ( th0  <->  E. f ( ( R 
FrSe  A  /\  x  e.  A )  ->  (
f  Fn  1o  /\  ph' 
/\  ps' ) ) )
4039, 29bnj133 34127 . 2  |-  ( th0  <->  E. f ze' )
4136, 40mpbir 209 1  |-  th0
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 367    /\ w3a 971    = wceq 1399   E.wex 1620    e. wcel 1826   A.wral 2732   _Vcvv 3034   [.wsbc 3252   (/)c0 3711   {csn 3944   <.cop 3950   U_ciun 4243   suc csuc 4794   Fun wfun 5490    Fn wfn 5491   ` cfv 5496   omcom 6599   1oc1o 7041    predc-bnj14 34087    FrSe w-bnj15 34091
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1626  ax-4 1639  ax-5 1712  ax-6 1755  ax-7 1798  ax-9 1830  ax-10 1845  ax-11 1850  ax-12 1862  ax-13 2006  ax-ext 2360  ax-sep 4488  ax-nul 4496  ax-pow 4543  ax-pr 4601
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1402  df-ex 1621  df-nf 1625  df-sb 1748  df-eu 2222  df-mo 2223  df-clab 2368  df-cleq 2374  df-clel 2377  df-nfc 2532  df-ne 2579  df-ral 2737  df-rex 2738  df-rab 2741  df-v 3036  df-sbc 3253  df-dif 3392  df-un 3394  df-in 3396  df-ss 3403  df-nul 3712  df-if 3858  df-pw 3929  df-sn 3945  df-pr 3947  df-op 3951  df-uni 4164  df-iun 4245  df-br 4368  df-opab 4426  df-id 4709  df-suc 4798  df-xp 4919  df-rel 4920  df-cnv 4921  df-co 4922  df-dm 4923  df-iota 5460  df-fun 5498  df-fn 5499  df-fv 5504  df-1o 7048  df-bnj13 34090  df-bnj15 34092
This theorem is referenced by:  bnj151  34282
  Copyright terms: Public domain W3C validator