Nuprl Lemma : Memory-class-trans

[Info,B,A:Type].
  R:B  B  . f:A  B  B. init:Id  bag(B). X:EClass(A). es:EO+(Info). e1,e2:E. v1,v2:B.
    (Trans(B;x,y.R[x;y])
     (s1,s2:B.  SqStable(R[s1;s2]))
     (a:A. e:E.  (a  X(e)  (s:B. R[s;f a s])))
     single-valued-classrel(es;X;A)
     single-valued-bag(init loc(e1);B)
     v1  Memory-class(f;init;X)(e1)
     v2  Memory-class(f;init;X)(e2)
     (e1 <loc e2)
     (e:E. (e1 loc e   (e <loc e2)  (a:A. a  X(e))))
     R[v1;v2])


Proof not projected




Definitions occuring in Statement :  Memory-class: Memory-class(f;init;X) single-valued-classrel: single-valued-classrel(es;X;T) classrel: v  X(e) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-le: e loc e'  es-locl: (e <loc e') es-loc: loc(e) es-E: E Id: Id trans: Trans(T;x,y.E[x; y]) sq_stable: SqStable(P) uall: [x:A]. B[x] prop: so_apply: x[s1;s2] all: x:A. B[x] exists: x:A. B[x] implies: P  Q and: P  Q apply: f a function: x:A  B[x] universe: Type single-valued-bag: single-valued-bag(b;T) bag: bag(T)
Definitions :  uall: [x:A]. B[x] all: x:A. B[x] prop: implies: P  Q so_apply: x[s1;s2] member: t  T so_lambda: x.t[x] so_lambda: x y.t[x; y] iterated_classrel: v  X*(f,init,e) exists: x:A. B[x] and: P  Q ycomb: Y squash: T ifthenelse: if b then t else f fi  or: P  Q btrue: tt true: True es-locl: (e <loc e') false: False not: A guard: {T} cand: A c B iff: P  Q so_apply: x[s] uimplies: b supposing a decidable: Dec(P) sq_type: SQType(T) trans: Trans(T;x,y.E[x; y]) es-le: e loc e'  subtype: S  T !hyp_hide: x
Lemmas :  Memory-classrel btrue_neq_bfalse exists_wf es-E_wf event-ordering+_inc and_wf es-le_wf es-locl_wf classrel_wf Memory-class_wf single-valued-bag_wf es-loc_wf single-valued-classrel_wf all_wf sq_stable_wf trans_wf event-ordering+_wf eclass_wf Id_wf bag_wf es-locl-first assert_elim decidable__exists-single-valued-classrel subtype_base_sq bool_wf bool_subtype_base equal_wf not_wf bag-member_wf or_wf es-first_wf es-pred_property iterated_classrel_wf iterated_classrel-single-val iterated_classrel_trans2 es-pred_wf decidable__exists-classrel-between3 squash_wf true_wf es-causl_transitivity2 es-causle_weakening_locl es-causl_irreflexivity es-le-loc es-locl-trichotomy implies-es-le-pred es-loc-pred es-pred-causl es-causl_weakening es-causle_weakening es-pred-locl es-locl_transitivity2

\mforall{}[Info,B,A:Type].
    \mforall{}R:B  {}\mrightarrow{}  B  {}\mrightarrow{}  \mBbbP{}.  \mforall{}f:A  {}\mrightarrow{}  B  {}\mrightarrow{}  B.  \mforall{}init:Id  {}\mrightarrow{}  bag(B).  \mforall{}X:EClass(A).  \mforall{}es:EO+(Info).  \mforall{}e1,e2:E.
    \mforall{}v1,v2:B.
        (Trans(B;x,y.R[x;y])
        {}\mRightarrow{}  (\mforall{}s1,s2:B.    SqStable(R[s1;s2]))
        {}\mRightarrow{}  (\mforall{}a:A.  \mforall{}e:E.    (a  \mmember{}  X(e)  {}\mRightarrow{}  (\mforall{}s:B.  R[s;f  a  s])))
        {}\mRightarrow{}  single-valued-classrel(es;X;A)
        {}\mRightarrow{}  single-valued-bag(init  loc(e1);B)
        {}\mRightarrow{}  v1  \mmember{}  Memory-class(f;init;X)(e1)
        {}\mRightarrow{}  v2  \mmember{}  Memory-class(f;init;X)(e2)
        {}\mRightarrow{}  (e1  <loc  e2)
        {}\mRightarrow{}  (\mexists{}e:E.  (e1  \mleq{}loc  e    \mwedge{}  (e  <loc  e2)  \mwedge{}  (\mexists{}a:A.  a  \mmember{}  X(e))))
        {}\mRightarrow{}  R[v1;v2])


Date html generated: 2012_01_23-PM-01_01_02
Last ObjectModification: 2012_01_11-PM-03_51_31

Home Index