Nuprl Lemma : fpf_wf
∀[A:Type]. ∀[B:A ⟶ Type].  (a:A fp-> B[a] ∈ Type)
Proof
Definitions occuring in Statement : 
fpf: a:A fp-> B[a]
, 
uall: ∀[x:A]. B[x]
, 
so_apply: x[s]
, 
member: t ∈ T
, 
function: x:A ⟶ B[x]
, 
universe: Type
Definitions unfolded in proof : 
fpf: a:A fp-> B[a]
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
prop: ℙ
, 
so_apply: x[s]
Lemmas referenced : 
list_wf, 
l_member_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalRule, 
sqequalReflexivity, 
sqequalTransitivity, 
computationStep, 
isect_memberFormation, 
introduction, 
cut, 
productEquality, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
hypothesisEquality, 
hypothesis, 
functionEquality, 
setEquality, 
applyEquality, 
setElimination, 
rename, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
cumulativity, 
universeEquality, 
isect_memberEquality, 
because_Cache
Latex:
\mforall{}[A:Type].  \mforall{}[B:A  {}\mrightarrow{}  Type].    (a:A  fp->  B[a]  \mmember{}  Type)
Date html generated:
2018_05_21-PM-09_16_59
Last ObjectModification:
2018_02_09-AM-10_16_20
Theory : finite!partial!functions
Home
Index