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

Theorem fz1sbc 9869
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 2928 . 2  |-  ( N  e.  ZZ  ->  ( [. N  /  k ]. ph  <->  A. k ( k  =  N  ->  ph )
) )
2 df-ral 2419 . . 3  |-  ( A. k  e.  ( N ... N ) ph  <->  A. k
( k  e.  ( N ... N )  ->  ph ) )
3 elfz1eq 9808 . . . . . 6  |-  ( k  e.  ( N ... N )  ->  k  =  N )
4 elfz3 9807 . . . . . . 7  |-  ( N  e.  ZZ  ->  N  e.  ( N ... N
) )
5 eleq1 2200 . . . . . . 7  |-  ( k  =  N  ->  (
k  e.  ( N ... N )  <->  N  e.  ( N ... N ) ) )
64, 5syl5ibrcom 156 . . . . . 6  |-  ( N  e.  ZZ  ->  (
k  =  N  -> 
k  e.  ( N ... N ) ) )
73, 6impbid2 142 . . . . 5  |-  ( N  e.  ZZ  ->  (
k  e.  ( N ... N )  <->  k  =  N ) )
87imbi1d 230 . . . 4  |-  ( N  e.  ZZ  ->  (
( k  e.  ( N ... N )  ->  ph )  <->  ( k  =  N  ->  ph )
) )
98albidv 1796 . . 3  |-  ( N  e.  ZZ  ->  ( A. k ( k  e.  ( N ... N
)  ->  ph )  <->  A. k
( k  =  N  ->  ph ) ) )
102, 9syl5rbb 192 . 2  |-  ( N  e.  ZZ  ->  ( A. k ( k  =  N  ->  ph )  <->  A. k  e.  ( N ... N
) ph ) )
111, 10bitr2d 188 1  |-  ( N  e.  ZZ  ->  ( A. k  e.  ( N ... N ) ph  <->  [. N  /  k ]. ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104   A.wal 1329    = wceq 1331    e. wcel 1480   A.wral 2414   [.wsbc 2904  (class class class)co 5767   ZZcz 9047   ...cfz 9783
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-cnex 7704  ax-resscn 7705  ax-pre-ltirr 7725  ax-pre-apti 7728
This theorem depends on definitions:  df-bi 116  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-rab 2423  df-v 2683  df-sbc 2905  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-neg 7929  df-z 9048  df-uz 9320  df-fz 9784
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator