Nuprl Lemma : State-classrel
∀[Info,B,A:Type]. ∀[f:A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)].
∀X:EClass(A). ∀es:EO+(Info). ∀e:E. ∀[v:B]. (v ∈ State-class(init;f;X)(e) ⇐⇒ iterated_classrel(es;B;A;f;init;X;e;v))
Proof
Definitions occuring in Statement :
State-class: State-class(init;f;X),
iterated_classrel: iterated_classrel(es;S;A;f;init;X;e;v),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
Id: Id,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
function: x:A ⟶ B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
squash: ↓T,
member: t ∈ T,
prop: ℙ,
rev_implies: P ⇐ Q,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uiff: uiff(P;Q),
uimplies: b supposing a,
exists: ∃x:A. B[x],
or: P ∨ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
State-class: State-class(init;f;X),
simple-comb-2: F|X, Y|,
simple-comb: simple-comb(F;Xs),
select: L[n],
cons: [a / b],
subtract: n - m,
eclass: EClass(A[eo; e]),
sq_type: SQType(T),
guard: {T},
ifthenelse: if b then t else f fi ,
btrue: tt,
not: ¬A,
bfalse: ff,
cand: A c∧ B,
false: False,
sq_stable: SqStable(P),
bool: 𝔹,
unit: Unit,
it: ⋅,
bnot: ¬bb,
assert: ↑b,
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[Info,B,A:Type]. \mforall{}[f:A {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[init:Id {}\mrightarrow{} bag(B)].
\mforall{}X:EClass(A). \mforall{}es:EO+(Info). \mforall{}e:E.
\mforall{}[v:B]. (v \mmember{} State-class(init;f;X)(e) \mLeftarrow{}{}\mRightarrow{} iterated\_classrel(es;B;A;f;init;X;e;v))
Date html generated:
2016_05_17-AM-09_35_45
Last ObjectModification:
2016_01_17-PM-11_09_01
Theory : classrel!lemmas
Home
Index