Nuprl Lemma : usquash-elim
∀[T:ℙ]. (SqStable(T) ⇒ usquash(T) ⇒ T)
Proof
Definitions occuring in Statement :
usquash: usquash(T),
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
usquash: usquash(T),
squash: ↓T,
prop: ℙ,
sq_stable: SqStable(P)
Lemmas referenced :
usquash_wf,
sq_stable_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation_alt,
lambdaFormation_alt,
cut,
introduction,
sqequalHypSubstitution,
pertypeElimination2,
sqequalRule,
thin,
hypothesis,
imageMemberEquality,
hypothesisEquality,
baseClosed,
universeIsType,
extract_by_obid,
isectElimination,
universeEquality,
independent_functionElimination
Latex:
\mforall{}[T:\mBbbP{}]. (SqStable(T) {}\mRightarrow{} usquash(T) {}\mRightarrow{} T)
Date html generated:
2020_05_19-PM-09_35_58
Last ObjectModification:
2020_05_17-PM-04_34_10
Theory : per!type!1
Home
Index