{ 
[es:EO]. [P,Q:E 
]. [f:{e:E| P e} E].
f 
{e:E| P e} {e:E| Q e} supposing Q 
==f== P }
{ Proof }
Definitions occuring in Statement :
weak-antecedent-function: Q ==f== P,
es-E: E,
event_ordering: EO,
uimplies: b supposing a,
uall: [x:A]. B[x],
prop: ,
member: t T,
set: {x:A| B[x]} ,
apply: f a,
function: x:A B[x]
Definitions :
uall: [x:A]. B[x],
prop: ,
uimplies: b supposing a,
member: t T,
weak-antecedent-function: Q ==f== P,
all: x:A. B[x],
and: P 
Q,
guard: {T}
Lemmas :
weak-antecedent-function_wf,
es-E_wf,
event_ordering_wf
\mforall{}[es:EO]. \mforall{}[P,Q:E {}\mrightarrow{} \mBbbP{}]. \mforall{}[f:\{e:E| P e\} {}\mrightarrow{} E]. f \mmember{} \{e:E| P e\} {}\mrightarrow{} \{e:E| Q e\} supposing Q \mleftarrow{}==f== P
Date html generated:
2011_08_16-AM-11_06_36
Last ObjectModification:
2011_06_18-AM-09_38_56
Home
Index