Nuprl Lemma : loop-class-state-total
∀[Info,B:Type]. ∀[init:Id ─→ bag(B)]. ∀[X:EClass(B ─→ B)]. ∀[es:EO+(Info)].
  es-total-class(es;loop-class-state(X;init)) supposing ∀l:Id. (1 ≤ #(init l))
Proof
Definitions occuring in Statement : 
loop-class-state: loop-class-state(X;init)
, 
es-total-class: es-total-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 : 
es-loc_wf, 
decidable__lt, 
bag-size_wf, 
nat_wf, 
false_wf, 
add_functionality_wrt_le, 
add-commutes, 
zero-add, 
le-add-cancel, 
loop-class-state-exists, 
bag-member-iff-size, 
loop-class-state_wf, 
eclass_wf, 
es-E_wf, 
event-ordering+_subtype, 
decidable__le, 
not-le-2, 
less-iff-le, 
condition-implies-le, 
minus-add, 
minus-one-mul, 
add-swap, 
add-associates, 
add-zero, 
le-add-cancel2, 
less_than_wf, 
class-ap_wf, 
all_wf, 
Id_wf, 
le_wf, 
event-ordering+_wf, 
bag_wf
Latex:
\mforall{}[Info,B:Type].  \mforall{}[init:Id  {}\mrightarrow{}  bag(B)].  \mforall{}[X:EClass(B  {}\mrightarrow{}  B)].  \mforall{}[es:EO+(Info)].
    es-total-class(es;loop-class-state(X;init))  supposing  \mforall{}l:Id.  (1  \mleq{}  \#(init  l))
Date html generated:
2015_07_21-PM-02_33_33
Last ObjectModification:
2015_01_27-PM-09_45_15
Home
Index