Nuprl Lemma : stable__not
∀[P:ℙ]. Stable{¬P}
Proof
Definitions occuring in Statement :
stable: Stable{P},
uall: ∀[x:A]. B[x],
prop: ℙ,
not: ¬A
Definitions unfolded in proof :
stable: Stable{P},
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
not: ¬A,
implies: P ⇒ Q,
false: False,
prop: ℙ
Lemmas referenced :
not_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
Error :isect_memberFormation_alt,
introduction,
cut,
lambdaFormation,
thin,
sqequalHypSubstitution,
independent_functionElimination,
promote_hyp,
hypothesis,
voidElimination,
extract_by_obid,
isectElimination,
hypothesisEquality,
lambdaEquality,
dependent_functionElimination,
because_Cache,
Error :universeIsType,
isect_memberEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[P:\mBbbP{}]. Stable\{\mneg{}P\}
Date html generated:
2019_06_20-AM-11_15_10
Last ObjectModification:
2018_09_26-AM-10_43_14
Theory : core_2
Home
Index