{ 
[Info:Type]
es:EO+(Info). Sys:EClass(Top). f:sys-antecedent(es;Sys). e:E(Sys).
n:
(((f (f^n e)) = (f^n e))
((f (f^n - 1 e)) = (f^n - 1 e)) supposing 0 < n) }
{ Proof }
Definitions occuring in Statement :
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
nat: ,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
all: x:A. B[x],
exists: x:A. B[x],
not: A,
and: P Q,
less_than: a < b,
apply: f a,
subtract: n - m,
natural_number: $n,
universe: Type,
equal: s = t,
fun_exp: f^n
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
exists: x:A. B[x],
nat: ,
and: P Q,
uimplies: b supposing a,
not: A,
member: t 
T,
prop: 
,
le: A 
B,
implies: P 
Q,
false: False,
so_lambda: 
x y.t[x; y],
int_seg: {i..j
},
lelt: i j < k,
guard: {T},
so_apply: x[s1;s2],
subtype: S 
T
Lemmas :
num-antecedents-property,
num-antecedents_wf,
es-E-interface_wf,
es-causle_wf,
es-E_wf,
assert_wf,
in-eclass_wf,
fun_exp_wf,
not_wf,
le_wf,
sys-antecedent_wf,
eclass_wf,
top_wf,
event-ordering+_inc,
event-ordering+_wf,
nat_wf
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}Sys:EClass(Top). \mforall{}f:sys-antecedent(es;Sys). \mforall{}e:E(Sys).
\mexists{}n:\mBbbN{}. (((f (f\^{}n e)) = (f\^{}n e)) \mwedge{} \mneg{}((f (f\^{}n - 1 e)) = (f\^{}n - 1 e)) supposing 0 < n)
Date html generated:
2011_08_16-PM-04_00_29
Last ObjectModification:
2011_06_20-AM-00_35_29
Home
Index