Nuprl Lemma : sq_stable_from_decidable
∀[P:ℙ]. (Dec(P) ⇒ SqStable(P))
Proof
Definitions occuring in Statement :
sq_stable: SqStable(P),
decidable: Dec(P),
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q
Definitions unfolded in proof :
member: t ∈ T,
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q
Lemmas referenced :
decidable_wf,
sq_stable__from_stable,
stable__from_decidable
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
hypothesisEquality,
hypothesis,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
Error :universeIsType,
universeEquality,
Error :isect_memberFormation_alt,
lambdaFormation,
independent_functionElimination
Latex:
\mforall{}[P:\mBbbP{}]. (Dec(P) {}\mRightarrow{} SqStable(P))
Date html generated:
2019_06_20-AM-11_15_35
Last ObjectModification:
2018_09_26-AM-10_23_45
Theory : core_2
Home
Index