Nuprl Lemma : es-interface-local-state-prior
∀[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) = if e ∈b prior(X) then local-state(f;base;X;prior(X)(e)) else base fi ∈ T)
Proof
Definitions occuring in Statement :
es-interface-local-state: local-state(f;base;X;e),
es-local-prior-state: prior-state(f;base;X;e),
es-prior-interface: prior(X),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
ifthenelse: if b then t else f fi ,
uall: ∀[x:A]. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
es-local-prior-state: prior-state(f;base;X;e),
es-interface-local-state: local-state(f;base;X;e),
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
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) = if e \mmember{}\msubb{} prior(X) then local-state(f;base;X;prior(X)(e)) else base fi )
Date html generated:
2016_05_17-AM-07_10_17
Last ObjectModification:
2015_12_29-AM-00_06_33
Theory : event-ordering
Home
Index