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