Nuprl Lemma : State-loc-comb-fun-eq-non-loc
∀[Info,B,A:Type]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)]. ∀[X:EClass(A)]. ∀[es:EO+(Info)]. ∀[e:E].
(State-loc-comb(init;f;X)(e) = State-comb(init;f loc(e);X)(e) ∈ B) supposing
(single-valued-classrel(es;X;A) and
(∀l:Id. single-valued-bag(init l;B)) and
(∀l:Id. (1 ≤ #(init l))))
Proof
Definitions occuring in Statement :
State-loc-comb: State-loc-comb(init;f;X),
State-comb: State-comb(init;f;X),
classfun: X(e),
single-valued-classrel: single-valued-classrel(es;X;T),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
le: A ≤ B,
all: ∀x:A. B[x],
apply: f a,
function: x:A ⟶ B[x],
natural_number: $n,
universe: Type,
equal: s = t ∈ T,
single-valued-bag: single-valued-bag(b;T),
bag-size: #(bs),
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uiff: uiff(P;Q),
and: P ∧ Q,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
nat: ℕ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
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)]. \mforall{}[es:EO+(Info)].
\mforall{}[e:E].
(State-loc-comb(init;f;X)(e) = State-comb(init;f loc(e);X)(e)) supposing
(single-valued-classrel(es;X;A) and
(\mforall{}l:Id. single-valued-bag(init l;B)) and
(\mforall{}l:Id. (1 \mleq{} \#(init l))))
Date html generated:
2016_05_17-AM-10_02_52
Last ObjectModification:
2015_12_29-PM-03_53_35
Theory : classrel!lemmas
Home
Index