some theorem schemas of intuitionistic propositional logic
We present some theorem schemas of intuitionistic propositional logic and their deductions
, based on the axiom system given in this entry (http://planetmath.org/AxiomSystemForIntuitionisticLogic).
1.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
so we get , and therefore by the deduction theorem.∎
2.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
- 6.
,
- 7.
,
- 8.
,
- 9.
,
- 10.
,
- 11.
,
- 12.
,
- 13.
,
- 14.
,
- 15.
,
so , and therefore by the deduction theorem.∎
3.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
so . By two applications of the deduction theorem, .∎
4.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
- 6.
,
- 7.
,
- 8.
so . By the deduction theorem, .∎
5.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
- 6.
,
- 7.
,
so . By the deduction theorem, .∎
In the proof above, we use the schema in step 6 of the deduction, because , as a result of applying the deduction theorem to .
6.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
- 6.
,
- 7.
,
so . By the deduction theorem, . Since , as a result.∎
In the above proof, we use the fact that if and , then . This is the result of the following fact: if and , then .
7.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
- 6.
,
- 7.
,
so . Applying the deduction theorem twice gives us .∎
8.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
.
Since and are instances of theorem schema 4 above, as a result.∎
This also shows that , which is the result of applying modus ponens to to .
9.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
so . Applying the deduction theorem gives us .∎
10.
Proof.
From the deduction
- 1.
,
- 2.
,
- 3.
,
- 4.
,
- 5.
,
- 6.
,
- 7.
,
- 8.
,
- 9.
,
∎
Remark. Again from this entry (http://planetmath.org/AxiomSystemForIntuitionisticLogic), if we use the second axiom system instead, keeping in mind that means , the following are theorem schemas:
1. . The proof of this is essentially the same as the proof of the third theorem schema above.
2. . This is just , an instance of the theorem schema above.
3. .
Proof.
From the deduction
- 1.
(which is ),
- 2.
,
- 3.
,
- 4.
,
- 5.
so . By two applications of the deduction theorem, we get .∎