Nuprl Lemma : State-class-es-sv1
∀[Info,A,B:Type]. ∀[es:EO+(Info)]. ∀[f:A ─→ B ─→ B]. ∀[X:EClass(A)]. ∀[init:Id ─→ bag(B)].
(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],
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 :
simple-comb-es-sv,
false_wf,
le_wf,
select_wf,
cons_wf,
nil_wf,
sq_stable__le,
length_wf,
length_nil,
non_neg_length,
length_wf_nil,
length_cons,
length_wf_nat,
int_seg_wf,
decidable__equal_int,
subtype_base_sq,
int_subtype_base,
Memory-class_wf,
bag-null_wf,
lelt_wf,
bool_wf,
eqtt_to_assert,
assert-bag-null,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
bool_subtype_base,
assert-bnot,
bag_wf,
all_wf,
bag-size_wf,
nat_wf,
Memory-class-es-sv,
subtype_rel_dep_function,
Id_wf,
top_wf,
subtype_rel_bag,
equal-wf-T-base,
assert_wf,
bnot_wf,
not_wf,
uiff_transitivity,
iff_transitivity,
iff_weakening_uiff,
assert_of_bnot,
bag-size-zero,
le_weakening,
bag-combine-empty-left,
bag-size-one,
length_of_cons_lemma,
length_of_nil_lemma,
bag-combine-single-left,
bag-only_wf2,
single-valued-bag-if-le1,
decidable__lt,
le_antisymmetry_iff,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
bag-combine_wf,
single-bag_wf,
add-commutes,
zero-add,
bag_size_single_lemma,
squash_wf,
true_wf,
iff_weakening_equal
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[f:A {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[X:EClass(A)]. \mforall{}[init:Id {}\mrightarrow{} bag(B)].
(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_31
Last ObjectModification:
2015_02_04-PM-04_40_42
Home
Index