ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fz1sbc Unicode version

Theorem fz1sbc 10503
Description: Quantification over a one-member finite set of sequential integers in terms of substitution. (Contributed by NM, 28-Nov-2005.)
Assertion
Ref Expression
fz1sbc  |-  ( N  e.  ZZ  ->  ( A. k  e.  ( N ... N ) ph  <->  [. N  /  k ]. ph ) )
Distinct variable group:    k, N
Allowed substitution hint:    ph( k)

Proof of Theorem fz1sbc
StepHypRef Expression
1 sbc6g 3076 . 2  |-  ( N  e.  ZZ  ->  ( [. N  /  k ]. ph  <->  A. k ( k  =  N  ->  ph )
) )
2 df-ral 2533 . . 3  |-  ( A. k  e.  ( N ... N ) ph  <->  A. k
( k  e.  ( N ... N )  ->  ph ) )
3 elfz1eq 10439 . . . . . 6  |-  ( k  e.  ( N ... N )  ->  k  =  N )
4 elfz3 10438 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  ( N ... N
) )
5 eleq1 2301 . . . . . . 7  |-  ( k  =  N  ->  (
k  e.  ( N ... N )  <->  N  e.  ( N ... N ) ) )
64, 5syl5ibrcom 157 . . . . . 6  |-  ( N  e.  ZZ  ->  (
k  =  N  -> 
k  e.  ( N ... N ) ) )
73, 6impbid2 143 . . . . 5  |-  ( N  e.  ZZ  ->  (
k  e.  ( N ... N )  <->  k  =  N ) )
87imbi1d 231 . . . 4  |-  ( N  e.  ZZ  ->  (
( k  e.  ( N ... N )  ->  ph )  <->  ( k  =  N  ->  ph )
) )
98albidv 1877 . . 3  |-  ( N  e.  ZZ  ->  ( A. k ( k  e.  ( N ... N
)  ->  ph )  <->  A. k
( k  =  N  ->  ph ) ) )
102, 9bitr2id 193 . 2  |-  ( N  e.  ZZ  ->  ( A. k ( k  =  N  ->  ph )  <->  A. k  e.  ( N ... N
) ph ) )
111, 10bitr2d 189 1  |-  ( N  e.  ZZ  ->  ( A. k  e.  ( N ... N ) ph  <->  [. N  /  k ]. ph ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    <-> wb 105   A.wal 1400    = wceq 1402    e. wcel 2209   A.wral 2528   [.wsbc 3051  (class class class)co 6085   ZZcz 9644   ...cfz 10411
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-pre-ltirr 8291  ax-pre-apti 8294
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-neg 8500  df-z 9645  df-uz 9922  df-fz 10412
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator