{ 
[X:Expression]. [T:Type]. [hdr:Atom List]. [typ:LimitedType].
[P:typ 
]. [f:Id T {v:typ| 
(P v)} ]. [g:T (Id List)].
((X:T) ==f=> (hdr:{typ | P}) @ g 
E#Rule) }
{ Proof }
Definitions occuring in Statement :
mk-prop-rule: (X:T) ==f=> (hdr:{typ | P}) @ g,
esharp-rule: E#Rule,
expression: Expression,
Id: Id,
assert: b,
bool: ,
uall: [x:A]. B[x],
member: t T,
set: {x:A| B[x]} ,
apply: f a,
function: x:A B[x],
list: type List,
atom: Atom,
universe: Type,
limited-type: LimitedType
Definitions :
atom: Atom$n,
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
and: P 
Q,
uiff: uiff(P;Q),
pair: <a, b>,
prop: 
,
axiom: Ax,
mk-prop-rule: (X:T) ==f=> (hdr:{typ | P}) @ g,
apply: f a,
name: Name,
Id: Id,
assert: b,
esharp-rule: E#Rule,
fpf: a:A fp-> B[a],
subtype: S 
T,
es-E-interface: E(X),
uimplies: b supposing a,
subtype_rel: A r B,
eclass: EClass(A[eo; e]),
isect: 
x:A. B[x],
product: x:A 
B[x],
exists: 
x:A. B[x],
intensional-universe: IType,
rec: rec(x.A[x]),
set: {x:A| B[x]} ,
bool: ,
atom: Atom,
uall: [x:A]. B[x],
list: type List,
expression: Expression,
limited-type: LimitedType,
all: x:A. B[x],
function: x:A B[x],
equal: s = t,
MaAuto: Error :MaAuto,
universe: Type,
CollapseTHEN: Error :CollapseTHEN,
Unfold: Error :Unfold,
member: t T,
AssertBY: Error :AssertBY,
tactic: Error :tactic
Lemmas :
subtype_rel_wf,
limited-type_wf,
member_wf,
name_wf,
Id_wf,
assert_wf,
bool_wf,
intensional-universe_wf,
expression_wf
\mforall{}[X:Expression]. \mforall{}[T:Type]. \mforall{}[hdr:Atom List]. \mforall{}[typ:LimitedType]. \mforall{}[P:typ {}\mrightarrow{} \mBbbB{}]. \mforall{}[f:Id
{}\mrightarrow{} T
{}\mrightarrow{} \{v:typ|
\muparrow{}(P v)\} ].
\mforall{}[g:T {}\mrightarrow{} (Id List)].
((X:T) ==f=> (hdr:\{typ | P\}) @ g \mmember{} E\#Rule)
Date html generated:
2011_08_17-PM-06_31_08
Last ObjectModification:
2011_06_18-AM-11_53_40
Home
Index