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

Theorem bnj125 29220
Description: Technical lemma for bnj150 29224. 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
bnj125.1  |-  ( ph  <->  ( f `  (/) )  = 
pred ( x ,  A ,  R ) )
bnj125.2  |-  ( ph'  <->  [. 1o  /  n ]. ph )
bnj125.3  |-  ( ph"  <->  [. F  / 
f ]. ph' )
bnj125.4  |-  F  =  { <. (/) ,  pred (
x ,  A ,  R ) >. }
Assertion
Ref Expression
bnj125  |-  ( ph"  <->  ( F `  (/) )  =  pred ( x ,  A ,  R ) )
Distinct variable groups:    A, f, n    f, F    R, f, n    x, f, n
Allowed substitution hints:    ph( x, f, n)    A( x)    R( x)    F( x, n)    ph'( x, f, n)   
ph"( x, f, n)

Proof of Theorem bnj125
StepHypRef Expression
1 bnj125.3 . 2  |-  ( ph"  <->  [. F  / 
f ]. ph' )
2 bnj125.2 . . . 4  |-  ( ph'  <->  [. 1o  /  n ]. ph )
3 bnj125.4 . . . . 5  |-  F  =  { <. (/) ,  pred (
x ,  A ,  R ) >. }
43bnj95 29212 . . . 4  |-  F  e. 
_V
52, 4bnj524 29082 . . 3  |-  ( [. F  /  f ]. ph'  <->  [. F  / 
f ]. [. 1o  /  n ]. ph )
6 bnj125.1 . . . . . 6  |-  ( ph  <->  ( f `  (/) )  = 
pred ( x ,  A ,  R ) )
7 bnj105 29066 . . . . . 6  |-  1o  e.  _V
86, 7bnj91 29209 . . . . 5  |-  ( [. 1o  /  n ]. ph  <->  ( f `  (/) )  =  pred ( x ,  A ,  R ) )
98, 4bnj524 29082 . . . 4  |-  ( [. F  /  f ]. [. 1o  /  n ]. ph  <->  [. F  / 
f ]. ( f `  (/) )  =  pred (
x ,  A ,  R ) )
10 fveq1 5540 . . . . . 6  |-  ( f  =  F  ->  (
f `  (/) )  =  ( F `  (/) ) )
1110eqeq1d 2304 . . . . 5  |-  ( f  =  F  ->  (
( f `  (/) )  = 
pred ( x ,  A ,  R )  <-> 
( F `  (/) )  = 
pred ( x ,  A ,  R ) ) )
124, 11sbcie 3038 . . . 4  |-  ( [. F  /  f ]. (
f `  (/) )  = 
pred ( x ,  A ,  R )  <-> 
( F `  (/) )  = 
pred ( x ,  A ,  R ) )
139, 12bitri 240 . . 3  |-  ( [. F  /  f ]. [. 1o  /  n ]. ph  <->  ( F `  (/) )  =  pred ( x ,  A ,  R ) )
145, 13bitri 240 . 2  |-  ( [. F  /  f ]. ph'  <->  ( F `  (/) )  =  pred ( x ,  A ,  R ) )
151, 14bitri 240 1  |-  ( ph"  <->  ( F `  (/) )  =  pred ( x ,  A ,  R ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    = wceq 1632   [.wsbc 3004   (/)c0 3468   {csn 3653   <.cop 3656   ` cfv 5271   1oc1o 6488    predc-bnj14 29029
This theorem is referenced by:  bnj150  29224  bnj153  29228
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-rex 2562  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-pw 3640  df-sn 3659  df-pr 3660  df-uni 3844  df-br 4040  df-suc 4414  df-iota 5235  df-fv 5279  df-1o 6495
  Copyright terms: Public domain W3C validator