Nuprl Lemma : loop-class-memory-eq
∀[Info,B:Type]. ∀[X:EClass(B ⟶ B)]. ∀[init:Id ⟶ bag(B)]. ∀[es:EO+(Info)]. ∀[e:E].
  (loop-class-memory(X;init)(e)
  = if first(e) then init loc(e)
    if pred(e) ∈b X then eclass3(X;loop-class-memory(X;init))(pred(e))
    else loop-class-memory(X;init)(pred(e))
    fi 
  ∈ bag(B))
Proof
Definitions occuring in Statement : 
loop-class-memory: loop-class-memory(X;init), 
eclass3: eclass3(X;Y), 
member-eclass: e ∈b X, 
class-ap: X(e), 
eclass: EClass(A[eo; e]), 
event-ordering+: EO+(Info), 
es-first: first(e), 
es-pred: pred(e), 
es-loc: loc(e), 
es-E: E, 
Id: Id, 
ifthenelse: if b then t else f fi , 
uall: ∀[x:A]. B[x], 
apply: f a, 
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], 
subtype_rel: A ⊆r B, 
strongwellfounded: SWellFounded(R[x; y]), 
exists: ∃x:A. B[x], 
nat: ℕ, 
implies: P ⇒ Q, 
false: False, 
ge: i ≥ j , 
uimplies: b supposing a, 
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, 
so_lambda: λ2x y.t[x; y], 
so_apply: x[s1;s2], 
loop-class-memory: loop-class-memory(X;init), 
primed-class-opt: Prior(X)?b, 
class-ap: X(e), 
so_lambda: λ2x.t[x], 
so_apply: x[s], 
sq_exists: ∃x:{A| B[x]}, 
iff: P ⇐⇒ Q, 
rev_implies: P ⇐ Q, 
es-locl: (e <loc e'), 
true: True, 
rev_uimplies: rev_uimplies(P;Q), 
classrel: v ∈ X(e), 
cand: A c∧ B, 
eclass3: eclass3(X;Y), 
es-E: E, 
es-base-E: es-base-E(es)
Latex:
\mforall{}[Info,B:Type].  \mforall{}[X:EClass(B  {}\mrightarrow{}  B)].  \mforall{}[init:Id  {}\mrightarrow{}  bag(B)].  \mforall{}[es:EO+(Info)].  \mforall{}[e:E].
    (loop-class-memory(X;init)(e)
    =  if  first(e)  then  init  loc(e)
        if  pred(e)  \mmember{}\msubb{}  X  then  eclass3(X;loop-class-memory(X;init))(pred(e))
        else  loop-class-memory(X;init)(pred(e))
        fi  )
Date html generated:
2016_05_16-PM-11_40_28
Last ObjectModification:
2016_01_17-PM-07_08_23
Theory : event-ordering
Home
Index