Nuprl Lemma : local-prior-state-accumulate
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[A,T:Type]. ∀[X:EClass(A)]. ∀[base:T]. ∀[f:T ⟶ A ⟶ T]. ∀[e:E].
(prior-state(f;base;X;e)
= accumulate (with value x and list item a):
f x a
over list:
X(<e)
with starting value:
base)
∈ T)
Proof
Definitions occuring in Statement :
es-local-prior-state: prior-state(f;base;X;e),
es-prior-interface-vals: X(<e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
list_accum: list_accum,
uall: ∀[x:A]. B[x],
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ 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,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
true: True,
es-local-prior-state: prior-state(f;base;X;e),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
es-E-interface: E(X)
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[A,T:Type]. \mforall{}[X:EClass(A)]. \mforall{}[base:T]. \mforall{}[f:T {}\mrightarrow{} A {}\mrightarrow{} T]. \mforall{}[e:E].
(prior-state(f;base;X;e)
= accumulate (with value x and list item a):
f x a
over list:
X(<e)
with starting value:
base))
Date html generated:
2016_05_17-AM-07_10_56
Last ObjectModification:
2016_01_17-PM-03_04_36
Theory : event-ordering
Home
Index