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

Theorem bnj92 29210
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj92.1  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
bnj92.2  |-  Z  e. 
_V
Assertion
Ref Expression
bnj92  |-  ( [. Z  /  n ]. ps  <->  A. i  e.  om  ( suc  i  e.  Z  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
Distinct variable groups:    A, n    R, n    i, Z    f, n    i, n    y, n
Allowed substitution hints:    ps( y, f, i, n)    A( y,
f, i)    R( y,
f, i)    Z( y,
f, n)

Proof of Theorem bnj92
StepHypRef Expression
1 bnj92.1 . . 3  |-  ( ps  <->  A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
2 bnj92.2 . . 3  |-  Z  e. 
_V
31, 2bnj524 29082 . 2  |-  ( [. Z  /  n ]. ps  <->  [. Z  /  n ]. A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
42bnj538 29085 . 2  |-  ( [. Z  /  n ]. A. i  e.  om  ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  A. i  e.  om  [. Z  /  n ]. ( suc  i  e.  n  ->  ( f `
 suc  i )  =  U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) ) )
5 sbcimg 3045 . . . . 5  |-  ( Z  e.  _V  ->  ( [. Z  /  n ]. ( suc  i  e.  n  ->  ( f `  suc  i )  = 
U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) )  <->  ( [. Z  /  n ]. suc  i  e.  n  ->  [. Z  /  n ]. ( f `
 suc  i )  =  U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) ) ) )
62, 5ax-mp 8 . . . 4  |-  ( [. Z  /  n ]. ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  ( [. Z  /  n ]. suc  i  e.  n  ->  [. Z  /  n ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
7 sbcel2gv 3064 . . . . . 6  |-  ( Z  e.  _V  ->  ( [. Z  /  n ]. suc  i  e.  n  <->  suc  i  e.  Z ) )
82, 7ax-mp 8 . . . . 5  |-  ( [. Z  /  n ]. suc  i  e.  n  <->  suc  i  e.  Z )
92bnj525 29083 . . . . 5  |-  ( [. Z  /  n ]. (
f `  suc  i )  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R )  <-> 
( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )
108, 9imbi12i 316 . . . 4  |-  ( (
[. Z  /  n ]. suc  i  e.  n  ->  [. Z  /  n ]. ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  ( suc  i  e.  Z  ->  ( f `  suc  i
)  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R ) ) )
116, 10bitri 240 . . 3  |-  ( [. Z  /  n ]. ( suc  i  e.  n  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  ( suc  i  e.  Z  ->  ( f `  suc  i
)  =  U_ y  e.  ( f `  i
)  pred ( y ,  A ,  R ) ) )
1211ralbii 2580 . 2  |-  ( A. i  e.  om  [. Z  /  n ]. ( suc  i  e.  n  -> 
( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) )  <->  A. i  e.  om  ( suc  i  e.  Z  ->  ( f `
 suc  i )  =  U_ y  e.  ( f `  i ) 
pred ( y ,  A ,  R ) ) )
133, 4, 123bitri 262 1  |-  ( [. Z  /  n ]. ps  <->  A. i  e.  om  ( suc  i  e.  Z  ->  ( f `  suc  i )  =  U_ y  e.  ( f `  i )  pred (
y ,  A ,  R ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    = wceq 1632    e. wcel 1696   A.wral 2556   _Vcvv 2801   [.wsbc 3004   U_ciun 3921   suc csuc 4410   omcom 4672   ` cfv 5271    predc-bnj14 29029
This theorem is referenced by:  bnj106  29216  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-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  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-ral 2561  df-v 2803  df-sbc 3005
  Copyright terms: Public domain W3C validator