Nuprl Lemma : no_repeats-pairs-fpf
∀[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),
no_repeats: no_repeats(T;l),
list: T List,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
and: P ∧ Q,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
top: Top,
implies: P ⇒ Q
Latex:
\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:
2016_05_16-AM-11_37_01
Last ObjectModification:
2015_12_29-AM-09_31_18
Theory : event-ordering
Home
Index