Nuprl Lemma : int-valueall-type
valueall-type(ℤ)
Proof
Definitions occuring in Statement :
valueall-type: valueall-type(T),
int: ℤ
Definitions unfolded in proof :
valueall-type: valueall-type(T),
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
member: t ∈ T,
sq_stable: SqStable(P),
implies: P ⇒ Q,
all: ∀x:A. B[x],
has-value: (a)↓,
squash: ↓T
Lemmas referenced :
sq_stable__has-value,
evalall-int,
istype-int,
istype-base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :isect_memberFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
sqequalRule,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
hypothesis,
independent_functionElimination,
equalityTransitivity,
equalitySymmetry,
Error :inhabitedIsType,
Error :lambdaFormation_alt,
callbyvalueInt,
because_Cache,
Error :equalityIsType1,
dependent_functionElimination,
imageMemberEquality,
imageElimination,
Error :equalityIsType4
Latex:
valueall-type(\mBbbZ{})
Date html generated:
2019_06_20-AM-11_21_09
Last ObjectModification:
2018_10_16-PM-04_34_23
Theory : call!by!value_1
Home
Index