Nuprl Lemma : fpf-domain_wf2
∀[A,B:Type]. ∀[f:a:A fp-> B]. (fpf-domain(f) ∈ A List)
Proof
Definitions occuring in Statement :
fpf-domain: fpf-domain(f),
fpf: a:A fp-> B[a],
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf-domain: fpf-domain(f),
pi1: fst(t),
fpf: a:A fp-> B[a],
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
fpf_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
sqequalHypSubstitution,
productElimination,
thin,
hypothesisEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
lemma_by_obid,
isectElimination,
lambdaEquality,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[A,B:Type]. \mforall{}[f:a:A fp-> B]. (fpf-domain(f) \mmember{} A List)
Date html generated:
2018_05_21-PM-09_17_15
Last ObjectModification:
2018_02_09-AM-10_16_26
Theory : finite!partial!functions
Home
Index