Nuprl Lemma : strict-fun_wf
StrictFun ∈ Type
Proof
Definitions occuring in Statement : 
strict-fun: StrictFun
, 
member: t ∈ T
, 
universe: Type
Definitions unfolded in proof : 
strict-fun: StrictFun
, 
member: t ∈ T
, 
uall: ∀[x:A]. B[x]
Lemmas referenced : 
partial_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalRule, 
sqequalReflexivity, 
sqequalTransitivity, 
computationStep, 
functionEquality, 
cut, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
voidEquality, 
hypothesis
Latex:
StrictFun  \mmember{}  Type
Date html generated:
2016_05_15-PM-10_04_18
Last ObjectModification:
2015_12_27-PM-05_16_49
Theory : bar!type
Home
Index