Nuprl Lemma : non-uniform-triple-neg-ext
∀A:ℙ. (¬¬¬A ⇐⇒ ¬A)
Proof
Definitions occuring in Statement :
prop: ℙ,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
not: ¬A
Definitions unfolded in proof :
member: t ∈ T,
non-uniform-triple-neg
Lemmas referenced :
non-uniform-triple-neg
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
instantiate,
extract_by_obid,
hypothesis,
sqequalRule,
thin,
sqequalHypSubstitution,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}A:\mBbbP{}. (\mneg{}\mneg{}\mneg{}A \mLeftarrow{}{}\mRightarrow{} \mneg{}A)
Date html generated:
2018_05_21-PM-00_00_27
Last ObjectModification:
2018_05_19-AM-07_14_08
Theory : core_2
Home
Index