---

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

{ Proof }

---

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

---

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


Date html generated: 2011_08_17-PM-04_08_41
Last ObjectModification: 2011_07_22-PM-11_15_40

Home Index