{ 
[m:Message]. [T:Type]. (msg-has-type(m;T) 
) }
{ Proof }
Definitions occuring in Statement :
msg-has-type: msg-has-type(m;T),
Message: Message,
bool: ,
uall: [x:A]. B[x],
member: t T,
universe: Type
Definitions :
Unfold: Error :Unfold,
CollapseTHEN: Error :CollapseTHEN,
parameter: parm{i},
universe: Type,
msg-type: msg-type(msg),
MaAuto: Error :MaAuto,
member: t T,
equal: s = t,
Message: Message,
isect: 
x:A. B[x],
uall: [x:A]. B[x],
axiom: Ax,
msg-has-type: msg-has-type(m;T),
bool: ,
all: x:A. B[x],
function: x:A 
B[x],
subtype_rel: A 
r B,
uiff: uiff(P;Q),
and: P 
Q,
product: x:A 
B[x],
uimplies: b supposing a,
less_than: a < b,
not: 
A,
ge: i 
j ,
le: A 
B,
strong-subtype: strong-subtype(A;B),
pMsg: pMsg(P.M[P]),
name: Name,
list: type List,
mData: mData,
fpf: a:A fp-> B[a],
eclass: EClass(A[eo; e]),
valueall-type: valueall-type(T),
implies: P 
Q,
union: left + right,
b-union: A 
B,
tunion: x:A.B[x],
set: {x:A| B[x]} ,
quotient: x,y:A//B[x; y],
rec: rec(x.A[x]),
atom: Atom,
int: 
,
atom: Atom$n
Lemmas :
type-valueall-type,
valueall-type_wf,
Error :msg-type_wf,
eq_term_wf,
Message_wf,
bool_wf,
member_wf
\mforall{}[m:Message]. \mforall{}[T:Type]. (msg-has-type(m;T) \mmember{} \mBbbB{})
Date html generated:
2011_08_17-PM-03_58_24
Last ObjectModification:
2011_05_02-PM-04_12_48
Home
Index