{ [A:']
    B:{B:'| valueall-type(B)} . F:bag(A)  bag(B)  bag(B).
      [X:EClass(A)]
        NormalLProgrammable'(A;X)
         NormalLProgrammable'(B;x,s.F[x;s]|X, Prior(self)|) 
        supposing s:bag(B). (F[{};s] = {}) }

{ Proof }



Definitions occuring in Statement :  Message: Message normal-locally-programmable: NormalLProgrammable(A;X) rec-combined-class1: x,s.F[x; s]|X, Prior(self)| eclass: EClass(A[eo; e]) uimplies: b supposing a uall: [x:A]. B[x] so_apply: x[s1;s2] all: x:A. B[x] implies: P  Q set: {x:A| B[x]}  function: x:A  B[x] universe: Type equal: s = t empty-bag: {} bag: bag(T) valueall-type: valueall-type(T)
Lemmas :  length_wf1 int_subtype_base subtype_base_sq decidable__equal_int select_wf int_seg_wf nat_wf false_wf not_wf le_wf Message-inhabited subtype_rel_wf squash_wf rec-combined-class-locally-programmable1 event-ordering+_inc event-ordering+_wf es-E_wf sq_stable_from_decidable sq_stable__uall sq_stable__all uall_wf member_wf eclass_wf2 eclass_wf3 empty-bag_wf valueall-type_wf eclass_wf bag_wf normal-locally-programmable_wf dataflow-program_wf Id_wf rec-combined-class1_wf Message_wf local-program-at_wf

\mforall{}[A:\mBbbU{}']
    \mforall{}B:\{B:\mBbbU{}'|  valueall-type(B)\}  .  \mforall{}F:bag(A)  {}\mrightarrow{}  bag(B)  {}\mrightarrow{}  bag(B).
        \mforall{}[X:EClass(A)]
            NormalLProgrammable'(A;X)  {}\mRightarrow{}  NormalLProgrammable'(B;x,s.F[x;s]|X,  Prior(self)|) 
            supposing  \mforall{}s:bag(B).  (F[\{\};s]  =  \{\})


Date html generated: 2011_08_17-PM-04_08_26
Last ObjectModification: 2011_06_28-PM-07_34_16

Home Index