Nuprl Lemma : State-class-es-sv
∀[Info,A:Type]. ∀[es:EO+(Info)]. ∀[f:Top]. ∀[X:EClass(A)]. ∀[init:Id ─→ bag(Top)].
(es-sv-class(es;State-class(init;f;X))) supposing ((∀l:Id. (#(init l) ≤ 1)) and es-sv-class(es;X))
Proof
Definitions occuring in Statement :
State-class: State-class(init;f;X),
es-sv-class: es-sv-class(es;X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
le: A ≤ B,
all: ∀x:A. B[x],
apply: f a,
function: x:A ─→ B[x],
natural_number: $n,
universe: Type,
bag-size: #(bs),
bag: bag(T)
Lemmas :
less_than_wf,
bag-size_wf,
top_wf,
State-class_wf,
eclass_wf,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
nat_wf,
all_wf,
Id_wf,
le_wf,
es-sv-class_wf,
bag_wf,
equal-wf-T-base,
assert_wf,
bnot_wf,
not_wf,
uiff_transitivity,
eqtt_to_assert,
assert-bag-null,
iff_transitivity,
iff_weakening_uiff,
eqff_to_assert,
assert_of_bnot,
Memory-class-es-sv,
bag-size-zero,
le_weakening,
bag_combine_empty_lemma,
bag_size_empty_lemma,
false_wf,
bag-size-one,
bag-combine-single-left,
bag-combine-unit-left-top,
bag-size-append,
Memory-class-top,
Memory-class_wf,
length_of_cons_lemma,
length_of_nil_lemma
Latex:
\mforall{}[Info,A:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[f:Top]. \mforall{}[X:EClass(A)]. \mforall{}[init:Id {}\mrightarrow{} bag(Top)].
(es-sv-class(es;State-class(init;f;X))) supposing ((\mforall{}l:Id. (\#(init l) \mleq{} 1)) and es-sv-class(es;X))
Date html generated:
2015_07_22-PM-00_20_36
Last ObjectModification:
2015_01_28-AM-10_14_14
Home
Index