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