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
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf: a:A fp-> B[a],
fpf-normalize: fpf-normalize(eq;g),
pi2: snd(t),
pi1: fst(t),
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
all: ∀x:A. B[x]
Latex:
\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:
2016_05_16-AM-11_37_16
Last ObjectModification:
2015_12_29-AM-09_31_41
Theory : event-ordering
Home
Index