Nuprl Lemma : stable__implies
∀[P,Q:ℙ]. (Stable{P} ⇒ Stable{Q ⇒ P})
Proof
Definitions occuring in Statement :
stable: Stable{P},
uall: ∀[x:A]. B[x],
prop: ℙ,
implies: P ⇒ Q
Definitions unfolded in proof :
prop: ℙ,
false: False,
not: ¬A,
member: t ∈ T,
uimplies: b supposing a,
stable: Stable{P},
implies: P ⇒ Q,
uall: ∀[x:A]. B[x]
Lemmas referenced :
stable_wf,
not_wf
Rules used in proof :
independent_functionElimination,
independent_isectElimination,
universeEquality,
rename,
hypothesis,
functionEquality,
isectElimination,
extract_by_obid,
voidElimination,
hypothesisEquality,
thin,
dependent_functionElimination,
lambdaEquality,
sqequalHypSubstitution,
sqequalRule,
introduction,
cut,
lambdaFormation,
isect_memberFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}[P,Q:\mBbbP{}]. (Stable\{P\} {}\mRightarrow{} Stable\{Q {}\mRightarrow{} P\})
Date html generated:
2017_09_29-PM-05_46_35
Last ObjectModification:
2017_09_26-AM-02_17_46
Theory : core_2
Home
Index