Nuprl Lemma : fpf-normalize_wf
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ─→ Type]. ∀[g:x:A fp-> B[x]]. (fpf-normalize(eq;g) ∈ x:A fp-> B[x])
Proof
Definitions occuring in Statement :
fpf-normalize: fpf-normalize(eq;g),
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ─→ B[x],
universe: Type
Lemmas :
list-subtype,
reduce_wf,
l_member_wf,
fpf-join_wf,
fpf-single_wf,
fpf-empty_wf,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[g:x:A fp-> B[x]].
(fpf-normalize(eq;g) \mmember{} x:A fp-> B[x])
Date html generated:
2015_07_17-AM-11_16_43
Last ObjectModification:
2015_01_28-AM-07_37_19
Home
Index