Nuprl Lemma : memory-class1-program_wf

[Info,A,B:Type]. ∀[init:Id ─→ B]. ∀[f:Id ─→ A ─→ B ─→ B]. ∀[X:EClass(A)]. ∀[pr:LocalClass(X)].
  (memory-class1-program(init;f;pr) ∈ LocalClass(memory-class1(initially init
                                                               applying f
                                                               on X))) supposing 
     (valueall-type(B) and 
     (↓B))


Proof




Definitions occuring in Statement :  memory-class1-program: memory-class1-program(init;tr;pr) memory-class1: memory-class1 local-class: LocalClass(X) eclass: EClass(A[eo; e]) Id: Id valueall-type: valueall-type(T) uimplies: supposing a uall: [x:A]. B[x] squash: T member: t ∈ T function: x:A ─→ B[x] universe: Type
Lemmas :  loop-class-memory-program_wf eclass1_wf single-bag_wf eclass1-program_wf function-valueall-type valueall-type-value-type valueall-type_wf squash_wf local-class_wf eclass_wf es-E_wf event-ordering+_subtype event-ordering+_wf Id_wf

Latex:
\mforall{}[Info,A,B:Type].  \mforall{}[init:Id  {}\mrightarrow{}  B].  \mforall{}[f:Id  {}\mrightarrow{}  A  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[X:EClass(A)].  \mforall{}[pr:LocalClass(X)].
    (memory-class1-program(init;f;pr)  \mmember{}  LocalClass(memory-class1(initially  init
                                                                                                                              applying  f
                                                                                                                              on  X)))  supposing 
          (valueall-type(B)  and 
          (\mdownarrow{}B))



Date html generated: 2015_07_22-PM-00_05_31
Last ObjectModification: 2015_01_28-AM-09_52_27

Home Index