Metamath Proof Explorer


Theorem bj-peircestab

Description: Over minimal implicational calculus, Peirce's law implies the double negation of the stability of any formula (that is the interpretation when F. is substituted for ps and for ch ). Therefore, the double negation of the stability of any formula is provable in classical refutability calculus. It is also provable in intuitionistic calculus (see iset.mm/bj-nnst) but it is not provable in minimal calculus (see bj-stabpeirce ). (Contributed by BJ, 30-Nov-2023) Axiom ax-3 is only used through Peirce's law peirce . (Proof modification is discouraged.)

Ref Expression
Assertion bj-peircestab φψχφχχ

Proof

Step Hyp Ref Expression
1 bj-nnclav φψχφχφψχφφψχφχχ
2 ax-1 χφψχ
3 2 imim2i φψχφχφψχφφψχ
4 peirce φψχφφψχφψχ
5 3 4 syl φψχφχφψχ
6 imim2 χφφψχφψφ
7 peirce φψφφ
8 5 6 7 syl56 χφφψχφχφ
9 8 a1dd χφφψχφχφψχφ
10 1 9 syl11 φψχφχχφχ
11 peirce χφχχ
12 10 11 syl φψχφχχ