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

Theorem bnj1040 32318
Description: Technical lemma for bnj69 32356. 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
bnj1040.1  |-  ( ph'  <->  [. j  /  i ]. ph )
bnj1040.2  |-  ( ps'  <->  [. j  /  i ]. ps )
bnj1040.3  |-  ( ch  <->  ( n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps ) )
bnj1040.4  |-  ( ch'  <->  [. j  /  i ]. ch )
Assertion
Ref Expression
bnj1040  |-  ( ch'  <->  (
n  e.  D  /\  f  Fn  n  /\  ph' 
/\  ps' ) )
Distinct variable groups:    D, i    f, i    i, n
Allowed substitution hints:    ph( f, i, j, n)    ps( f,
i, j, n)    ch( f, i, j, n)    D( f, j, n)    ph'( f, i, j, n)    ps'( f, i, j, n)    ch'( f, i, j, n)

Proof of Theorem bnj1040
StepHypRef Expression
1 bnj1040.4 . 2  |-  ( ch'  <->  [. j  /  i ]. ch )
2 bnj1040.3 . . 3  |-  ( ch  <->  ( n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps ) )
32sbcbii 3354 . 2  |-  ( [. j  /  i ]. ch  <->  [. j  /  i ]. ( n  e.  D  /\  f  Fn  n  /\  ph  /\  ps )
)
4 df-bnj17 32030 . . 3  |-  ( (
[. j  /  i ]. n  e.  D  /\  [. j  /  i ]. f  Fn  n  /\  [. j  /  i ]. ph  /\  [. j  /  i ]. ps ) 
<->  ( ( [. j  /  i ]. n  e.  D  /\  [. j  /  i ]. f  Fn  n  /\  [. j  /  i ]. ph )  /\  [. j  /  i ]. ps ) )
5 vex 3081 . . . . . 6  |-  j  e. 
_V
65bnj525 32085 . . . . 5  |-  ( [. j  /  i ]. n  e.  D  <->  n  e.  D
)
76bicomi 202 . . . 4  |-  ( n  e.  D  <->  [. j  / 
i ]. n  e.  D
)
85bnj525 32085 . . . . 5  |-  ( [. j  /  i ]. f  Fn  n  <->  f  Fn  n
)
98bicomi 202 . . . 4  |-  ( f  Fn  n  <->  [. j  / 
i ]. f  Fn  n
)
10 bnj1040.1 . . . 4  |-  ( ph'  <->  [. j  /  i ]. ph )
11 bnj1040.2 . . . 4  |-  ( ps'  <->  [. j  /  i ]. ps )
127, 9, 10, 11bnj887 32113 . . 3  |-  ( ( n  e.  D  /\  f  Fn  n  /\  ph' 
/\  ps' )  <->  ( [. j  /  i ]. n  e.  D  /\  [. j  /  i ]. f  Fn  n  /\  [. j  /  i ]. ph  /\  [. j  /  i ]. ps ) )
13 df-bnj17 32030 . . . . 5  |-  ( ( n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps )  <->  ( (
n  e.  D  /\  f  Fn  n  /\  ph )  /\  ps )
)
1413sbcbii 3354 . . . 4  |-  ( [. j  /  i ]. (
n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps )  <->  [. j  / 
i ]. ( ( n  e.  D  /\  f  Fn  n  /\  ph )  /\  ps ) )
15 sbcan 3337 . . . 4  |-  ( [. j  /  i ]. (
( n  e.  D  /\  f  Fn  n  /\  ph )  /\  ps ) 
<->  ( [. j  / 
i ]. ( n  e.  D  /\  f  Fn  n  /\  ph )  /\  [. j  /  i ]. ps ) )
16 sbc3an 3357 . . . . 5  |-  ( [. j  /  i ]. (
n  e.  D  /\  f  Fn  n  /\  ph )  <->  ( [. j  /  i ]. n  e.  D  /\  [. j  /  i ]. f  Fn  n  /\  [. j  /  i ]. ph )
)
1716anbi1i 695 . . . 4  |-  ( (
[. j  /  i ]. ( n  e.  D  /\  f  Fn  n  /\  ph )  /\  [. j  /  i ]. ps ) 
<->  ( ( [. j  /  i ]. n  e.  D  /\  [. j  /  i ]. f  Fn  n  /\  [. j  /  i ]. ph )  /\  [. j  /  i ]. ps ) )
1814, 15, 173bitri 271 . . 3  |-  ( [. j  /  i ]. (
n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps )  <->  ( ( [. j  /  i ]. n  e.  D  /\  [. j  /  i ]. f  Fn  n  /\  [. j  /  i ]. ph )  /\  [. j  /  i ]. ps ) )
194, 12, 183bitr4ri 278 . 2  |-  ( [. j  /  i ]. (
n  e.  D  /\  f  Fn  n  /\  ph 
/\  ps )  <->  ( n  e.  D  /\  f  Fn  n  /\  ph'  /\  ps' ) )
201, 3, 193bitri 271 1  |-  ( ch'  <->  (
n  e.  D  /\  f  Fn  n  /\  ph' 
/\  ps' ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    /\ w3a 965    e. wcel 1758   [.wsbc 3294    Fn wfn 5524    /\ w-bnj17 32029
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-clab 2440  df-cleq 2446  df-clel 2449  df-v 3080  df-sbc 3295  df-bnj17 32030
This theorem is referenced by:  bnj1128  32336
  Copyright terms: Public domain W3C validator