Nuprl Lemma : State-class-locally-programmable

[A:']
  B:{B:'| valueall-type(B)} . init:Id  bag(B). f:A  B  B.
    [X:EClass'(A)]. (NormalLProgrammable'(A;X)  NormalLProgrammable'(B;State-class(init;f;X)))


Proof not projected




Definitions occuring in Statement :  State-class: State-class(init;f;X) Message: Message normal-locally-programmable: NormalLProgrammable(A;X) eclass: EClass(A[eo; e]) Id: Id uall: [x:A]. B[x] all: x:A. B[x] implies: P  Q set: {x:A| B[x]}  function: x:A  B[x] universe: Type bag: bag(T) valueall-type: valueall-type(T)
Definitions :  top: Top Accum-class: Accum-class(f;init;X) so_lambda: x.t[x] cand: A c B prop: btrue: tt null: null(as) guard: {T} member: t  T empty-bag: {} and: P  Q or: P  Q Memory-class: Memory-class(f;init;X) bag-null: bag-null(bs) ifthenelse: if b then t else f fi  State-class: State-class(init;f;X) implies: P  Q eclass: EClass(A[eo; e]) all: x:A. B[x] uall: [x:A]. B[x] uimplies: b supposing a so_apply: x[s] subtype: S  T
Lemmas :  valueall-type_wf Id_wf event-ordering+_inc es-E_wf event-ordering+_wf normal-locally-programmable_wf subtype_top top_wf subtype_rel_bag lifting-2-strict rec-combined-class-opt-1-nlp Accum-class_wf primed-class-opt-nlp equal_wf all_wf squash_wf empty-bag_wf Message_wf Memory-class_wf lifting-2_wf bag_wf bag-null_wf ifthenelse_wf simple-comb-2-nlp

\mforall{}[A:\mBbbU{}']
    \mforall{}B:\{B:\mBbbU{}'|  valueall-type(B)\}  .  \mforall{}init:Id  {}\mrightarrow{}  bag(B).  \mforall{}f:A  {}\mrightarrow{}  B  {}\mrightarrow{}  B.
        \mforall{}[X:EClass'(A)].  (NormalLProgrammable'(A;X)  {}\mRightarrow{}  NormalLProgrammable'(B;State-class(init;f;X)))


Date html generated: 2012_02_20-PM-03_02_46
Last ObjectModification: 2012_02_06-PM-06_21_01

Home Index