Nuprl Lemma : loop-class-memory-is-prior-loop-class-state
∀[Info,B:Type]. ∀[X:EClass(B ─→ B)]. ∀[init:Id ─→ bag(B)].
(loop-class-memory(X;init) = Prior(loop-class-state(X;init))?init ∈ EClass(B))
Proof
Definitions occuring in Statement :
loop-class-memory: loop-class-memory(X;init),
loop-class-state: loop-class-state(X;init),
primed-class-opt: Prior(X)?b,
eclass: EClass(A[eo; e]),
Id: Id,
uall: ∀[x:A]. B[x],
function: x:A ─→ B[x],
universe: Type,
equal: s = t ∈ T,
bag: bag(T)
Lemmas :
loop-class-memory_wf,
loop-class-state_wf,
base_sq,
Id_wf,
bag_wf,
eclass_wf,
es-E_wf,
event-ordering+_subtype,
event-ordering+_wf,
eclass-ext,
primed-class-opt_wf,
es-causl-swellfnd,
nat_properties,
less_than_transitivity1,
less_than_irreflexivity,
ge_wf,
less_than_wf,
int_seg_wf,
int_seg_subtype-nat,
decidable__le,
subtract_wf,
false_wf,
not-ge-2,
less-iff-le,
condition-implies-le,
minus-one-mul,
zero-add,
minus-add,
minus-minus,
add-associates,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-zero,
le-add-cancel,
decidable__equal_int,
subtype_rel-int_seg,
le_weakening,
int_seg_properties,
le_wf,
nat_wf,
zero-le-nat,
lelt_wf,
es-causl_wf,
primed-class-opt-cases,
eclass3_wf,
top_wf,
es-interface-subtype_rel2,
subtype_rel_dep_function,
es-first_wf2,
bool_wf,
eqtt_to_assert,
es-loc_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
es-pred_wf,
es-pred-locl,
es-causl_weakening,
decidable__lt,
not-equal-2,
le-add-cancel-alt,
not-le-2,
sq_stable__le,
add-mul-special,
zero-mul,
lt_int_wf,
bag-size_wf,
bag-combine_wf,
bag-map_wf,
assert_of_lt_int,
member-eclass_wf,
bnot_wf,
eq_int_wf,
neg_assert_of_eq_int,
assert_of_eq_int,
bag-size-is-zero,
bag_combine_empty_lemma,
bag_size_empty_lemma
Latex:
\mforall{}[Info,B:Type]. \mforall{}[X:EClass(B {}\mrightarrow{} B)]. \mforall{}[init:Id {}\mrightarrow{} bag(B)].
(loop-class-memory(X;init) = Prior(loop-class-state(X;init))?init)
Date html generated:
2015_07_21-PM-02_37_05
Last ObjectModification:
2015_01_27-PM-09_47_24
Home
Index