{ 
es:EO
[T:Type]
i:Id
[P:T 
]
L:T List
[Q:E {x:T| (x 
L)} ]
((x:T. Dec(P[x]))
(xL.P[x] (
e:E. Q[e;x]))
e'@i.True supposing 
(xL. P[x])
e'@i.(xL.P[x] (e:E. (e 
loc e' 
Q[e;x])))
supposing (xL.e:E. (Q[e;x] (loc(e) = i)))) }
{ Proof }
Definitions occuring in Statement :
existse-at: e@i.P[e],
es-le: e loc e' ,
es-loc: loc(e),
es-E: E,
event_ordering: EO,
Id: Id,
decidable: Dec(P),
uimplies: b supposing a,
uall: [x:A]. B[x],
prop: ,
so_apply: x[s1;s2],
so_apply: x[s],
all: x:A. B[x],
exists: x:A. B[x],
not: A,
implies: P Q,
and: P Q,
true: True,
set: {x:A| B[x]} ,
function: x:A B[x],
list: type List,
universe: Type,
equal: s = t,
l_exists: (xL. P[x]),
l_all: (xL.P[x]),
l_member: (x l)
Definitions :
all: x:A. B[x],
uall: [x:A]. B[x],
prop: ,
implies: P Q,
so_apply: x[s],
uimplies: b supposing a,
l_all: (xL.P[x]),
so_apply: x[s1;s2],
exists: x:A. B[x],
not: A,
member: t T,
subtype: S 
T,
suptype: suptype(S; T),
false: False,
so_lambda: 
x.t[x],
l_member: (x l),
cand: A c B,
le: A B,
l_exists: (xL. P[x]),
and: P Q,
true: True,
squash: 
T,
existse-at: e@i.P[e],
nat: 
Lemmas :
l_member_wf,
es-E_wf,
list-set-type,
es-bound-list,
l_exists_wf,
not_wf,
existse-at_wf,
true_wf,
es-loc_wf,
l_all_wf2,
decidable_wf,
Id_wf,
event_ordering_wf,
nat_wf,
length_wf1,
select_wf,
es-le_wf
\mforall{}es:EO
\mforall{}[T:Type]
\mforall{}i:Id
\mforall{}[P:T {}\mrightarrow{} \mBbbP{}]
\mforall{}L:T List
\mforall{}[Q:E {}\mrightarrow{} \{x:T| (x \mmember{} L)\} {}\mrightarrow{} \mBbbP{}]
((\mforall{}x:T. Dec(P[x]))
{}\mRightarrow{} (\mforall{}x\mmember{}L.P[x] {}\mRightarrow{} (\mexists{}e:E. Q[e;x]))
{}\mRightarrow{} \mexists{}e'@i.True supposing \mneg{}(\mexists{}x\mmember{}L. P[x])
{}\mRightarrow{} \mexists{}e'@i.(\mforall{}x\mmember{}L.P[x] {}\mRightarrow{} (\mexists{}e:E. (e \mleq{}loc e' \mwedge{} Q[e;x])))
supposing (\mforall{}x\mmember{}L.\mforall{}e:E. (Q[e;x] {}\mRightarrow{} (loc(e) = i))))
Date html generated:
2011_08_16-AM-10_51_44
Last ObjectModification:
2011_06_18-AM-09_26_34
Home
Index