Nuprl Lemma : until-prc_wf

[Info:{Info:Type| Info} ]
  A,B:{B:Type| valueall-type(B)} .
    [X:EClass(A)]. [Y:EClass(B)].
      Xpr:NormalLProgrammable(A;X). Ypr:NormalLProgrammable(B;Y).
        (until-prc(A;Xpr;Ypr)  NormalLProgrammable(A;(X until Y)))


Proof not projected




Definitions occuring in Statement :  until-prc: until-prc(A;Xpr;Ypr) normal-locally-programmable: NormalLProgrammable(A;X) until-class: (X until Y) eclass: EClass(A[eo; e]) uall: [x:A]. B[x] all: x:A. B[x] squash: T member: t  T set: {x:A| B[x]}  universe: Type valueall-type: valueall-type(T)
Definitions :  top: Top so_lambda: x y.t[x; y] so_lambda: x.t[x] prop: implies: P  Q until-class-locally-programmable-ext bfalse: ff btrue: tt ifthenelse: if b then t else f fi  spreadn: spread4 it: until-prc: until-prc(A;Xpr;Ypr) member: t  T all: x:A. B[x] uall: [x:A]. B[x] uimplies: b supposing a so_apply: x[s1;s2] so_apply: x[s] subtype: S  T
Lemmas :  es-interface-top top_wf event-ordering+_inc es-interface-subtype_rel2 until-class_wf normal-locally-programmable_wf event-ordering+_wf es-E_wf eclass_wf valueall-type_wf squash_wf uall_wf

\mforall{}[Info:\{Info:Type|  \mdownarrow{}Info\}  ]
    \mforall{}A,B:\{B:Type|  valueall-type(B)\}  .
        \mforall{}[X:EClass(A)].  \mforall{}[Y:EClass(B)].
            \mforall{}Xpr:NormalLProgrammable(A;X).  \mforall{}Ypr:NormalLProgrammable(B;Y).
                (until-prc(A;Xpr;Ypr)  \mmember{}  NormalLProgrammable(A;(X  until  Y)))


Date html generated: 2011_10_20-PM-03_25_38
Last ObjectModification: 2011_08_15-PM-03_27_58

Home Index