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

Theorem bnj121 28902
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj121.1  |-  ( ze  <->  ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) ) )
bnj121.2  |-  ( ze'  <->  [. 1o  /  n ]. ze )
bnj121.3  |-  ( ph'  <->  [. 1o  /  n ]. ph )
bnj121.4  |-  ( ps'  <->  [. 1o  /  n ]. ps )
Assertion
Ref Expression
bnj121  |-  ( ze'  <->  (
( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  1o  /\  ph'  /\  ps' ) ) )
Distinct variable groups:    A, n    R, n    f, n    x, n
Allowed substitution hints:    ph( x, f, n)    ps( x, f, n)    ze( x, f, n)    A( x, f)    R( x, f)    ph'( x, f, n)    ps'( x, f, n)    ze'( x, f, n)

Proof of Theorem bnj121
StepHypRef Expression
1 bnj121.1 . . 3  |-  ( ze  <->  ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) ) )
2 bnj105 28750 . . 3  |-  1o  e.  _V
31, 2bnj524 28766 . 2  |-  ( [. 1o  /  n ]. ze  <->  [. 1o  /  n ]. ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) ) )
4 bnj121.2 . 2  |-  ( ze'  <->  [. 1o  /  n ]. ze )
52bnj90 28748 . . . . . . 7  |-  ( [. 1o  /  n ]. f  Fn  n  <->  f  Fn  1o )
65bicomi 193 . . . . . 6  |-  ( f  Fn  1o  <->  [. 1o  /  n ]. f  Fn  n
)
7 bnj121.3 . . . . . 6  |-  ( ph'  <->  [. 1o  /  n ]. ph )
8 bnj121.4 . . . . . 6  |-  ( ps'  <->  [. 1o  /  n ]. ps )
96, 7, 83anbi123i 1140 . . . . 5  |-  ( ( f  Fn  1o  /\  ph' 
/\  ps' )  <->  ( [. 1o  /  n ]. f  Fn  n  /\  [. 1o  /  n ]. ph  /\  [. 1o  /  n ]. ps ) )
10 sbc3ang 3049 . . . . . 6  |-  ( 1o  e.  _V  ->  ( [. 1o  /  n ]. ( f  Fn  n  /\  ph  /\  ps )  <->  (
[. 1o  /  n ]. f  Fn  n  /\  [. 1o  /  n ]. ph  /\  [. 1o  /  n ]. ps )
) )
112, 10ax-mp 8 . . . . 5  |-  ( [. 1o  /  n ]. (
f  Fn  n  /\  ph 
/\  ps )  <->  ( [. 1o  /  n ]. f  Fn  n  /\  [. 1o  /  n ]. ph  /\  [. 1o  /  n ]. ps ) )
129, 11bitr4i 243 . . . 4  |-  ( ( f  Fn  1o  /\  ph' 
/\  ps' )  <->  [. 1o  /  n ]. ( f  Fn  n  /\  ph  /\  ps ) )
1312imbi2i 303 . . 3  |-  ( ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  1o  /\  ph'  /\  ps' ) )  <-> 
( ( R  FrSe  A  /\  x  e.  A
)  ->  [. 1o  /  n ]. ( f  Fn  n  /\  ph  /\  ps ) ) )
14 nfv 1605 . . . . 5  |-  F/ n
( R  FrSe  A  /\  x  e.  A
)
1514sbc19.21g 3055 . . . 4  |-  ( 1o  e.  _V  ->  ( [. 1o  /  n ]. ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) )  <->  ( ( R  FrSe  A  /\  x  e.  A )  ->  [. 1o  /  n ]. ( f  Fn  n  /\  ph  /\ 
ps ) ) ) )
162, 15ax-mp 8 . . 3  |-  ( [. 1o  /  n ]. (
( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) )  <->  ( ( R  FrSe  A  /\  x  e.  A )  ->  [. 1o  /  n ]. ( f  Fn  n  /\  ph  /\ 
ps ) ) )
1713, 16bitr4i 243 . 2  |-  ( ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  1o  /\  ph'  /\  ps' ) )  <->  [. 1o  /  n ]. ( ( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  n  /\  ph  /\  ps ) ) )
183, 4, 173bitr4i 268 1  |-  ( ze'  <->  (
( R  FrSe  A  /\  x  e.  A
)  ->  ( f  Fn  1o  /\  ph'  /\  ps' ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    /\ w3a 934    e. wcel 1684   _Vcvv 2788   [.wsbc 2991    Fn wfn 5250   1oc1o 6472    FrSe w-bnj15 28717
This theorem is referenced by:  bnj150  28908  bnj153  28912
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-pw 3627  df-sn 3646  df-suc 4398  df-fn 5258  df-1o 6479
  Copyright terms: Public domain W3C validator