---

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

{ Proof }

---

Definitions occuring in Statement :  Message: Message,  normal-locally-programmable: NormalLProgrammable(A;X),  rec-combined-class-1: F|X,Prior(self)|,  eclass: EClass(A[eo; e]),  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-class1-nlp

---

\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;F|X,Prior(self)|) 
            supposing  \mforall{}s:bag(B).  ((F  \{\}  s)  =  \{\})


Date html generated: 2011_08_17-PM-04_08_33
Last ObjectModification: 2011_06_28-PM-07_34_58

Home Index