{ 
[A,B:Type]. [eq1:EqDecider(A)]. [eq2:EqDecider(B)]. [L:(A 
B) List].
no_repeats(A;fpf-domain(fpf(L))) }
{ Proof }
Definitions occuring in Statement :
pairs-fpf: fpf(L),
fpf-domain: fpf-domain(f),
uall: [x:A]. B[x],
product: x:A B[x],
list: type List,
universe: Type,
no_repeats: no_repeats(T;l),
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
no_repeats: no_repeats(T;l),
all: x:A. B[x],
member: t 
T,
implies: P 
Q,
not: 
A,
false: False,
le: A 
B,
so_lambda: 
x.t[x],
prop: 
,
and: P 
Q,
nat: 
,
uimplies: b supposing a,
so_apply: x[s]
Lemmas :
pairs-fpf_property,
select_wf,
fpf-domain_wf,
pairs-fpf_wf,
fpf-trivial-subtype-top,
fpf_wf,
top_wf,
not_wf,
nat_wf,
length_wf1,
deq_wf
\mforall{}[A,B:Type]. \mforall{}[eq1:EqDecider(A)]. \mforall{}[eq2:EqDecider(B)]. \mforall{}[L:(A \mtimes{} B) List].
no\_repeats(A;fpf-domain(fpf(L)))
Date html generated:
2011_08_10-AM-08_11_37
Last ObjectModification:
2011_06_18-AM-08_26_58
Home
Index