Nuprl Lemma : Memory-loc-class-is-prior-State-loc-comb

∀[Info,B,A:Type]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)].
  ∀X:EClass(A). (Memory-loc-class(f;init;X) = Prior(State-loc-comb(init;f;X))?init ∈ EClass(B))


Proof




Definitions occuring in Statement :  State-loc-comb: State-loc-comb(init;f;X),  Memory-loc-class: Memory-loc-class(f;init;X),  primed-class-opt: Prior(X)?b,  eclass: EClass(A[eo; e]),  Id: Id,  uall: ∀[x:A]. B[x],  all: ∀x:A. B[x],  function: x:A ⟶ B[x],  universe: Type,  equal: s = t ∈ T,  bag: bag(T)
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  all: ∀x:A. B[x],  Memory-loc-class: Memory-loc-class(f;init;X),  Accum-loc-class: Accum-loc-class(f;init;X),  rec-combined-loc-class-opt-1: F|Loc, X, Prior(self)?init|,  State-loc-comb: State-loc-comb(init;f;X),  exists: ∃x:A. B[x],  so_lambda: λ2x y.t[x; y],  subtype_rel: A ⊆r B,  so_apply: x[s1;s2],  uimplies: b supposing a,  strongwellfounded: SWellFounded(R[x; y]),  nat: ℕ,  implies: P ⇒ Q,  false: False,  ge: i ≥ j ,  satisfiable_int_formula: satisfiable_int_formula(fmla),  not: ¬A,  top: Top,  and: P ∧ Q,  prop: ℙ,  guard: {T},  int_seg: {i..j-},  lelt: i ≤ j < k,  le: A ≤ B,  less_than': less_than'(a;b),  decidable: Dec(P),  or: P ∨ Q,  less_than: a < b,  squash: ↓T,  bool: 𝔹,  unit: Unit,  it: ⋅,  btrue: tt,  uiff: uiff(P;Q),  ifthenelse: if b then t else f fi ,  bfalse: ff,  sq_type: SQType(T),  bnot: ¬bb,  assert: ↑b,  select: L[n],  cons: [a / b],  rec-comb: rec-comb(X;f;init),  class-ap: X(e),  lifting-loc-2: lifting-loc-2(f),  lifting2-loc: lifting2-loc(f;loc;abag;bbag),  lifting-loc-gen-rev: lifting-loc-gen-rev(n;bags;loc;f),  lifting-gen-rev: lifting-gen-rev(n;f;bags),  lifting-gen-list-rev: lifting-gen-list-rev(n;bags),  eq_int: (i =z j),  subtract: n - m,  so_lambda: λ2x.t[x],  so_apply: x[s],  lt_int: i <z j,  eclass: EClass(A[eo; e])

Latex:
\mforall{}[Info,B,A:Type].  \mforall{}[f:Id  {}\mrightarrow{}  A  {}\mrightarrow{}  B  {}\mrightarrow{}  B].  \mforall{}[init:Id  {}\mrightarrow{}  bag(B)].
    \mforall{}X:EClass(A).  (Memory-loc-class(f;init;X)  =  Prior(State-loc-comb(init;f;X))?init)



Date html generated: 2016_05_17-AM-10_02_16
Last ObjectModification: 2016_01_17-PM-11_06_24

Theory : classrel!lemmas


Home Index