FORMAL MATHEMATICS

Reduced First-Order Calculus

Presentation of the rFOC Formal System:
a computational introduction to
First-Order Logic with Identity

July 2, 2014
Pr0gett0 Al3ph
a Self-produced Digital Editions Store
in Mathematics and Theoretical Physics
http://al3ph.altervista.org/portale/
Contents 1
Contents
1 Axioms and Primitive Rules of Inference 2
2 Derived Rules of Inference 4
3 Results on Propositional Calculus 10
4 Results on Predicate Calculus 27
5 Results on Predicate Calculus with Identity 34
Contents 1
Presentation of the rFOC Theory 2
1 Axioms and Primitive Rules of Inference
Axiom Schema 1.
The First Axiom of the Conditional. This is the Axiom A1.1 of [1] p. 62 .
( ( )) (ax-1.1)
Axiom Schema 2.
The Second Axiom of the Conditional. This is the Axiom A1.2 of [1] p. 62 .
(( ( )) ( )) (ax-1.2)
Axiom Schema 3.
The Third Axiom of the Conditional. This is the Axiom A1.3 of [1] p. 62 .
(( ) (( ) ( ))) (ax-1.3)
Axiom Schema 4.
The First Axiom of the Conjunction. This is the Axiom A2.1 of [1] p. 62 .
(( ) ) (ax-2.1)
Axiom Schema 5.
The Second Axiom of the Conjunction. This is the Axiom A2.2 of [1] p. 62 .
(( ) ) (ax-2.2)
Axiom Schema 6.
The Third Axiom of the Conjunction. This is the Axiom A2.3 of [1] p. 62 .
(( ) (( ) ( ( )))) (ax-2.3)
Axiom Schema 7.
The First Axiom of the Alternative. This is the Axiom A3.1 of [1] p. 62 .
( ( )) (ax-3.1)
Axiom Schema 8.
The Second Axiom of the Alternative. This is the Axiom A3.2 of [1] p. 62 .
( ( )) (ax-3.2)
Axiom Schema 9.
The Third Axiom of the Alternative. This is the Axiom A3.3 of [1] p. 62 .
(( ) (( ) (( ) ))) (ax-3.3)
Axiom Schema 10.
The First Axiom of the Biconditional. This is the Axiom A4.1 of [1] p. 62 .
(( ) ( )) (ax-4.1)
Axiom Schema 11.
The Second Axiom of the Biconditional. This is the Axiom A4.2 of [1] p. 62 .
(( ) ( )) (ax-4.2)
Axioms and Primitive Rules of Inference 2
Presentation of the rFOC Theory 3
Axiom Schema 12.
The Third Axiom of the Biconditional. This is the Axiom A4.3 of [1] p. 62 .
(( ) (( ) ( ))) (ax-4.3)
Axiom Schema 13.
The First Axiom of the Negation. This is the Axiom A5.1 of [1] p. 62 .
(( ) ( )) (ax-5.1)
Axiom Schema 14.
The Second Axiom of the Negation. This is the Axiom A5.2 of [1] p. 62 .
( ) (ax-5.2)
Axiom Schema 15.
The Third Axiom of the Negation. This is the Axiom A5.3 of [1] p. 62 .
( ) (ax-5.3)
Metaaxiom Schema 1.
Universal Quantier Axiom. If is built from by substitution of a term t in
every free occurrence of the object metavariable x in , and by keeping every
bound occurrence of the object metavariable x in , and t is free for x in , then
we have the following axiom schema.
((x) ) (ax-A)
Metaaxiom Schema 2.
Existential Quantier Axiom. If is built from by substitution of a term t
in every free occurrence of the object metavariable x in , and by keeping every
bound occurrence of the object metavariable x in , and t is free for x in ,
then we have the following axiom schema.
( (x)) (ax-E)
Axiom Schema 16.
Inxed Form Axiom for Identity.
(s = t = s t) (ax-i-ifa)
Axiom Schema 17.
The First Identity Axiom. This is the axiom A5 of [2] p. 171.
s = s (ax-i.1)
Metaaxiom Schema 3.
The Second Identity Axiom. This is the axiom A6 of [2] p. 171. If is obtained
from by replacing one or more occurrences of s in all simultaneously by t,
and if none of the occurrences of s in have occurrences of variables bound in
and similarly for the occurrences of t in , then we have the following axiom
schema:
(s = t ( )) (ax-i.2)
Axioms and Primitive Rules of Inference 3
Presentation of the rFOC Theory 4
Rule of Inference 1.
Modus Ponens Rule: mp. If and ( ), then . This is the
Rule R1 of [1] p. 62 .
& ( ) (mp)
Rule of Inference 2.
Universalization Rule. If x is not free in (this condition is equivalent to say
x has not occurrences in or else all occurrences of x are bound in ), then we
have le following rule.
( ) ( (x)) (uni-r)
Rule of Inference 3.
Particularization Rule. If x is not free in (this condition is equivalent to say
x has not occurrences in or else all occurrences of x are bound in ), then we
have the following rule.
( ) ((x) ) (par-r)
2 Derived Rules of Inference
Metatheorem Schema 2.1.
Antecedent Adding (Derived) Rule: aa-r. If , then ( ).
( ) (aa-r)
Metatheorem Schema 2.2.
Double Antecedent (Derived) Rule: da-r. If ( ( )), then (
).
( ( )) ( ) (da-r)
Metatheorem Schema 2.3.
Logical Transitivity (Derived) Rule: lt-r. If ( ) and ( ),
then ( ).
( ) & ( ) ( ) (lt-r)
Metatheorem Schema 2.4.
Conjunction (Derived) Rule: con-r. If ( ) and ( ), then
( ( )).
( ) & ( ) ( ( )) (con-r)
Metatheorem Schema 2.5.
Alternative (Derived) Rule: alt-r. If ( ) and ( ), then
(( ) ).
( ) & ( ) (( ) ) (alt-r)
Derived Rules of Inference 4
Presentation of the rFOC Theory 5
Metatheorem Schema 2.6.
Right Implication (Derived) Rule: ri-r. If ( ), then ( ).
( ) ( ) (ri-r)
Metatheorem Schema 2.7.
Left Implication (Derived) Rule: li-r. If ( ), then ( ).
( ) ( ) (li-r)
Metatheorem Schema 2.8.
Co-implication (Derived) Rule: ci-r. If ( ) and ( ), then
( ).
( ) & ( ) ( ) (ci-r)
Metatheorem Schema 2.9.
The First Contraposition (Derived) Rule: ctr1-r. If ( ), then
( ).
( ) ( ) (ctr1-r)
Metatheorem Schema 2.10.
Double Negation Deleting (Derived) Rule for the Antecedent: Nda-r. If
( ), then ( ).
( ) ( ) (Nda-r)
Metatheorem Schema 2.11.
Double Negation Deleting (Derived) Rule for the Consequent: Ndc-r. If
( ), then ( ).
( ) ( ) (Ndc-r)
Metatheorem Schema 2.12.
Inner Provable Antecedent (Derived) Rule: ipa-r. If and ( (
)), then ( ).
& ( ( )) ( ) (ipa-r)
Metatheorem Schema 2.13.
Inner Antecedent (Derived) Rule: ia-r. This is just a generalization of the
ipa-r rule. If ( ) and ( ( )), then ( ).
( ) & ( ( )) ( ) (ia-r)
Metatheorem Schema 2.14.
Reductio ad Absurdum (Derived) Rule: ra-r. If (( ) ( )),
then ( ).
(( ) ( )) ( ) (ra-r)
Derived Rules of Inference 5
Presentation of the rFOC Theory 6
Metatheorem Schema 2.15.
Importation (Derived) Rule: imp-r. If ( ( )), then (()
).
( ( )) (( ) ) (imp-r)
Metatheorem Schema 2.16.
The Second Contraposition (Derived) Rule: ctr2-r. If ( ), then
( ).
( ) ( ) (ctr2-r)
Metatheorem Schema 2.17.
The Third Contraposition (Derived) Rule: ctr3-r. If ( ), then
( ).
( ) ( ) (ctr3-r)
Metatheorem Schema 2.18.
The Fourth Contraposition (Derived) Rule: ctr4-r. If ( ), then
( ).
( ) ( ) (ctr4-r)
Metatheorem Schema 2.19.
Exportation (Derived) Rule: exp-r. If (( ) ), then ( (
)).
(( ) ) ( ( )) (exp-r)
Metatheorem Schema 2.20.
Antecedent Exchange (Derived) Rule: aex-r. If ( ( )), then
( ( )).
( ( )) ( ( )) (aex-r)
Metatheorem Schema 2.21.
Replacement (Derived) Rule for Conditioned Logical Equivalence: rce-r. If
( ( )), then (( ) ( )).
( ( )) (( ) ( )) (rce-r)
Metatheorem Schema 2.22.
Commutation (Derived) Rule for Logical Equivalence: ce-r. If ( ),
then ( ).
( ) ( ) (ce-r)
Metatheorem Schema 2.23.
Transitive Equivalence (Derived) Rule: te-r. If ( ) and ( ),
then ( ).
( ) & ( ) ( ) (te-r)
Derived Rules of Inference 6
Presentation of the rFOC Theory 7
Metatheorem Schema 2.24.
The First Weak Replacement (Derived) Rule in respect to the Conjunction:
rc1-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (rc1-r)
Metatheorem Schema 2.25.
The First Replacement (Derived) Rule in respect to the Conjunction: Rc1-r.
If ( ), then (( ) ( )).
( ) (( ) ( )) (Rc1-r)
Metatheorem Schema 2.26.
The First Weak Replacement (Derived) Rule in respect to the Alternative:
ra1-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (ra1-r)
Metatheorem Schema 2.27.
The First Replacement (Derived) Rule in respect to the Alternative: Ra1-r.
If ( ), then (( ) ( )).
( ) (( ) ( )) (Ra1-r)
Metatheorem Schema 2.28.
The First Weak Replacement (Derived) Rule in respect to the Implication:
ri1-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (ri1-r)
Metatheorem Schema 2.29.
The First Replacement (Derived) Rule in respect to the Implication: Ri1-r.
If ( ), then (( ) ( )).
( ) (( ) ( )) (Ri1-r)
Metatheorem Schema 2.30.
The First Weak Replacement (Derived) Rule in respect to the Logical Equiva-
lence: re1-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (re1-r)
Metatheorem Schema 2.31.
The First Replacement (Derived) Rule in respect to the Logical Equivalence:
Re1-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (Re1-r)
Metatheorem Schema 2.32.
The Second Weak Replacement (Derived) Rule in respect to the Conjunction:
rc2-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (rc2-r)
Derived Rules of Inference 7
Presentation of the rFOC Theory 8
Metatheorem Schema 2.33.
The Second Replacement (Derived) Rule in respect to the Conjunction: Rc2-
r. If ( ), then (( ) ( )).
( ) (( ) ( )) (Rc2-r)
Metatheorem Schema 2.34.
The Second Weak Replacement (Derived) Rule in respect to the Alternative:
ra2-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (ra2-r)
Metatheorem Schema 2.35.
The Second Replacement (Derived) Rule in respect to the Alternative: Ra2-
r. If ( ), then (( ) ( )).
( ) (( ) ( )) (Ra2-r)
Metatheorem Schema 2.36.
The Second Weak Replacement (Derived) Rule in respect to the Implication:
ri2-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (ri2-r)
Metatheorem Schema 2.37.
The Second Replacement (Derived) Rule in respect to the Implication: Ri2-
r. If ( ), then (( ) ( )).
( ) (( ) ( )) (Ri2-r)
Metatheorem Schema 2.38.
The Second Weak Replacement (Derived) Rule in respect to the Logical Equiv-
alence: re2-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (re2-r)
Metatheorem Schema 2.39.
The Second Replacement (Derived) Rule in respect to the Logical Equivalence:
Re2-r. If ( ), then (( ) ( )).
( ) (( ) ( )) (Re2-r)
Metatheorem Schema 2.40.
The First Contraposition (Derived) Rule in respect to the Logical Equivalence:
ctre1-r. If ( ), then ( ).
( ) ( ) (ctre1-r)
Metatheorem Schema 2.41.
The Second Contraposition (Derived) Rule in respect to the Logical Equiva-
lence: ctre2-r. If ( ), then ( ).
( ) ( ) (ctre2-r)
Derived Rules of Inference 8
Presentation of the rFOC Theory 9
Metatheorem Schema 2.42.
Generalization (Derived) Rule: gen-r. If , then (x).
(x) (gen-r)
Metatheorem Schema 2.43.
Universalizator Deleting (Derived) Rule: ud-r. If is built from by
substitution of a term t in every free occurrence of the object metavariable x in
and by keeping every bound occurrence of the object metavariable x in and
t is free for x in and (x), then .
(x) (ud-r)
Metatheorem Schema 2.44.
Particularizator Adding (Derived) Rule: pa-r. If is built from by sub-
stitution of a term t in every free occurrence of the object metavariable x in
and by keeping every bound occurrence of the object metavariable x in and t
is free for x in and , then (x).
(x) (pa-r)
Metatheorem Schema 2.45.
Universalizator Propagation (Derived) Rule: up-r. If (x( )) and
(x), then (x).
(x( )) & (x) (x) (up-r)
Metatheorem Schema 2.46.
Particularizator Propagation (Derived) Rule: pp-r. If (x( )) and
(x), then (x).
(x( )) & (x) (x) (pp-r)
Metatheorem Schema 2.47.
Identity Propagation (Derived) Rule: ip-r. If t

is obtained from s

by
replacing one or more occurrences of s in s

by t all simultaneously, then we

have the following result:
s = t s

= t

(ip-r)
Metatheorem Schema 2.48.
Identity Symmetry (Derived) Rule: is-r.
s = t t = s (is-r)
Metatheorem Schema 2.49.
Identity Transitivity (Derived) Rule: it-r.
r = s & s = t r = t (it-r)
Results on Propositional Calculus 9
Presentation of the rFOC Theory 10
3 Results on Propositional Calculus
Theorem Schema 3.1.
((( ) ) (( ) )) (pc-ex-1)
Theorem Schema 3.2.
(( ) ( )) (pc-ex-2)
Theorem Schema 3.3.
(( ) ( )) (pc-ex-3)
Theorem Schema 3.4.
((( ) ) (( ) ( ))) (pc-ex-4)
Theorem Schema 3.5.
((( ) ) (( ) ( ))) (pc-ex-5)
Theorem Schema 3.6.
(( ) ( (( ) ))) (pc-ex-6)
Theorem Schema 3.7.
(( ) ( (( ) ))) (pc-ex-7)
Theorem Schema 3.8.
((( ) ) (( ) (( ) ))) (pc-ex-8)
Theorem Schema 3.9.
(( ) ( ( ))) (pc-ex-9)
Theorem Schema 3.10.
(( ) ( ( ))) (pc-ex-10)
Theorem Schema 3.11.
(( ) ((( ) ) )) (pc-ex-11)
Theorem Schema 3.12.
(( ) ((( ) ) )) (pc-ex-12)
Theorem Schema 3.13.
(( ( )) (( ) ( ))) (pc-ex-13)
Theorem Schema 3.14.
(( ( )) (( ) ( ))) (pc-ex-14)
Results on Propositional Calculus 10
Presentation of the rFOC Theory 11
Theorem Schema 3.15.
(( ( )) ((( ) ) ( ))) (pc-ex-15)
Theorem Schema 3.16.
(( ( )) ((( ) ) ( ))) (pc-ex-16)
Theorem Schema 3.17.
(( ( )) ((( ) ) ( ))) (pc-ex-17)
Theorem Schema 3.18.
(( ) (( ) )) (pc-ex-18)
Theorem Schema 3.19. Double Negation Deleting Law for the Consequent.
(( ) ( )) (pc-ndc)
Theorem Schema 3.20. Double Negation Adding Law for the Consequent.
(( ) ( )) (pc-nac)
Theorem Schema 3.21. Weak Identity Law.
( ) (pc-1)
Theorem Schema 3.22. Most Inner Antecedent Deleting Law.
((( ) ) ( )) (pc-2)
Theorem Schema 3.23. Contraposition of the axiom ax-1.1.
(( ) ) (pc-3)
Theorem Schema 3.24. Strengthen the antecedent on the right.
(( ) (( ) )) (pc-4)
Theorem Schema 3.25. Strengthen the antecedent on the left.
(( ) (( ) )) (pc-5)
Theorem Schema 3.26. Weaken the antecedent on the right.
((( ) ) ( )) (pc-6)
Theorem Schema 3.27. Weaken the antecedent on the left.
((( ) ) ( )) (pc-7)
Theorem Schema 3.28. Strengthen the direct conditional at the antecedent.
((( ) ) (( ) )) (pc-8)
Results on Propositional Calculus 11
Presentation of the rFOC Theory 12
Theorem Schema 3.29. Strengthen the reverse conditional at the antecedent.
((( ) ) (( ) )) (pc-9)
Theorem Schema 3.30. Strengthen the consequent with the weak antecedent.
((( ) ) (( ) (( ) ))) (pc-10)
Theorem Schema 3.31. Strengthen the consequent with the reversed weak
antecedent.
((( ) ) (( ) (( ) ))) (pc-11)
Theorem Schema 3.32. Contraposition of the ax-2.1.
( ( )) (pc-12)
Theorem Schema 3.33. Contraposition of the ax-2.2.
( ( )) (pc-13)
Theorem Schema 3.34. Contraposition of the ax-3.1.
(( ) ) (pc-14)
Theorem Schema 3.35. Contraposition of the ax-3.2.
(( ) ) (pc-15)
Theorem Schema 3.36. Weak Associative Law of the Conditional.
((( ) ) ( ( ))) (pc-16)
Theorem Schema 3.37. Strong Identity Law. This is the Theorem 4.1 of [1]
p. 70 .
( ) (pc-17)
Theorem Schema 3.38. Strong Negation Law. This is the Theorem 5.5 of [1]
p. 71 .
( ) (pc-18)
Theorem Schema 3.39. Weak Idempotence Law of the Conjunction.
( ( )) (pc-19)
Theorem Schema 3.40. Strong Idempotence Law of the Conjunction. This
is the Theorem 2.11 of [1] p. 70 .
(( ) ) (pc-20)
Theorem Schema 3.41. Weak Idempotence Law of the Alternative.
(( ) ) (pc-21)
Results on Propositional Calculus 12
Presentation of the rFOC Theory 13
Theorem Schema 3.42. Strong Idempotence Law of the Alternative. This is
the Theorem 2.12 of [1] p. 70 .
(( ) ) (pc-22)
Theorem Schema 3.43. Weak Commutative Law of the Conjunction.
(( ) ( )) (pc-23)
Theorem Schema 3.44. Strong Commutative Law of the Conjunction. This
is the Theorem 2.21 of [1] p. 70 .
(( ) ( )) (pc-24)
Theorem Schema 3.45. Weak Commutative Law of the Alternative.
(( ) ( )) (pc-25)
Theorem Schema 3.46. Strong Commutative Law of the Alternative. This is
the Theorem 2.22 of [1] p. 70 .
(( ) ( )) (pc-26)
Theorem Schema 3.47. The First Weak Associative Law of the Conjunction.
(( ( )) (( ) )) (pc-27)
Theorem Schema 3.48. The Second Weak Associative Law of the Conjunc-
tion.
((( ) ) ( ( ))) (pc-28)
Theorem Schema 3.49. Strong Associative Law of the Conjunction. This is
the Theorem 2.31 of [1] p. 70 .
(( ( )) (( ) )) (pc-29)
Theorem Schema 3.50. The First Weak Associative Law of the Alternative.
(( ( )) (( ) )) (pc-30)
Theorem Schema 3.51. The Second Weak Associative Law of the Alternative.
((( ) ) ( ( ))) (pc-31)
Theorem Schema 3.52. Strong Associative Law of the Alternative. This is
the Theorem 2.32 of [1] p. 70 .
(( ( )) (( ) )) (pc-32)
Theorem Schema 3.53. Conjunction is stronger then Alternative.
(( ) ( )) (pc-33)
Results on Propositional Calculus 13
Presentation of the rFOC Theory 14
Theorem Schema 3.54. The First Weak Distributive Law on the Right, of
the Alternative in respect to the Conjunction. The Second Law will be stated
after well have introduced the Reductio ad Absurdum (Derived) Rule ra-r.
((( ) ) (( ) ( ))) (pc-34)
Theorem Schema 3.55. The Second Weak Distributive Law on the Right, of
the Conjunction in respect to the Alternative. The First Law will be stated after
well have introduced the Reductio ad Absurdum (Derived) Rule ra-r.
((( ) ( )) (( ) )) (pc-35)
Theorem Schema 3.56. Weak Absorption Law of the Conjunction and Alter-
native.
( ( ( ))) (pc-36)
Theorem Schema 3.57. Strong Absorption Law of the Conjunction and Al-
ternative. This is the Theorem 2.51 of [1] p. 70 .
(( ( )) ) (pc-37)
Theorem Schema 3.58. Weak Absorption Law of the Alternative and Con-
junction.
(( ( )) ) (pc-38)
Theorem Schema 3.59. Strong Absorption Law of the Alternative and Con-
junction. This is the Theorem 2.52 of [1] p. 70 .
(( ( )) ) (pc-39)
Theorem Schema 3.60. The First Weak Form of the Alternative Law. The
Second Form will be stated after well have introduced the Reductio ad Absur-
dum (Derived) Rule ra-r.
(( ) ( )) (pc-40)
Theorem Schema 3.61. The Second Weak Form of the Conjunction Law. The
First Form will be stated after well have introduced the Reductio ad Absurdum
(Derived) Rule ra-r.
(( ) ( )) (pc-41)
Theorem Schema 3.62. The Second Weak Form of the Third De Morgans
Law.
(( ) ( )) (pc-42)
Theorem Schema 3.63. The First Weak Form of the First De Morgans
Law.
(( ) ( )) (pc-43)
Results on Propositional Calculus 14
Presentation of the rFOC Theory 15
Theorem Schema 3.64. The Second Weak Form of the First De Morgans
Law.
(( ) ( )) (pc-44)
Theorem Schema 3.65. The First Weak Form of the Third De Morgans
Law.
(( ) ( )) (pc-45)
Theorem Schema 3.66. The First De Morgans Law. This is the Theorem
1.22 of [1] p. 70 .
(( ) ( )) (pc-46)
Theorem Schema 3.67. The Third De Morgans Law. This is the Theorem
5.31 of [1] p. 71 .
(( ) ( )) (pc-47)
Theorem Schema 3.68. The First Weak Form of the Second De Morgans
Law.
(( ) ( )) (pc-48)
Theorem Schema 3.69. The Second Weak Form of the Fourth De Morgans
Law.
(( ) ( )) (pc-49)
Theorem Schema 3.70. The Second Weak Form of the Second De Morgans
Law.
(( ) ( )) (pc-50)
Theorem Schema 3.71. The First Weak Form of the Fourth De Morgans
Law.
(( ) ( )) (pc-51)
Theorem Schema 3.72. The Second De Morgans Law. This is the Theorem
1.32 of [1] p. 70 .
(( ) ( )) (pc-52)
Theorem Schema 3.73. The Fourth De Morgans Law. This is the Theorem
5.32 of [1] p. 71 .
(( ) ( )) (pc-53)
Theorem Schema 3.74. Inconsistency Law.
(( ) ) (pc-54)
Results on Propositional Calculus 15
Presentation of the rFOC Theory 16
Theorem Schema 3.75. Non-contradiction Law. This is the Theorem 5.2 of
[1] p. 71 .
( ) (pc-55)
Theorem Schema 3.76. Lemma a for the theorem pc-56.
(((( ) ( )) (( ) )) ( )) (pc-56a)
Theorem Schema 3.77. Lemma b for the theorem pc-56.
(((( ) ( )) (( ) )) ( )) (pc-56b)
Theorem Schema 3.78. Lemma c for the theorem pc-56.
(((( ) ( )) (( ) )) ( )) (pc-56c)
Theorem Schema 3.79. Lemma d for the theorem pc-56.
(((( ) ( )) (( ) )) ( )) (pc-56d)
Theorem Schema 3.80. Lemma e for the theorem pc-56.
(((( ) ( )) (( ) )) ( )) (pc-56e)
Theorem Schema 3.81. Lemma f for the theorem pc-56.
(((( ) ( )) (( ) )) ( )) (pc-56f)
Theorem Schema 3.82. Lemma g for the theorem pc-56.
(((( ) ( )) (( ) )) (( ) )) (pc-56g)
Theorem Schema 3.83. Lemma h for the theorem pc-56.
(((( ) ( )) (( ) )) ) (pc-56h)
Theorem Schema 3.84. Preliminary result for The Second Weak Distributive
Law of the Alternative in respect to the Conjunction. We need this theorem, into
the proof of The Second Weak Distributive Law of the Alternative in respect to
the Conjunction, with Reductio ad Absurdum Rule ra-r.
(((( ) ( )) (( ) )) ( )) (pc-56)
Theorem Schema 3.85. The Second Weak Distributive Law on the Right, of
the Alternative in respect to the Conjunction.
((( ) ( )) (( ) )) (pc-57)
Theorem Schema 3.86. Strong Distributive Law on the Right, of the Alter-
native in respect to the Conjunction. This is the Theorem 2.41 of [1] p. 70
.
((( ) ) (( ) ( ))) (pc-58)
Results on Propositional Calculus 16
Presentation of the rFOC Theory 17
Theorem Schema 3.87. Lemma a for the theorem pc-59.
(((( ) ) (( ) ( ))) ( )) (pc-59a)
Theorem Schema 3.88. Lemma b for the theorem pc-59.
(((( ) ) (( ) ( ))) ( )) (pc-59b)
Theorem Schema 3.89. Lemma c for the theorem pc-59.
(((( ) ) (( ) ( ))) ( )) (pc-59c)
Theorem Schema 3.90. Lemma d for the theorem pc-59.
(((( ) ) (( ) ( ))) ( )) (pc-59d)
Theorem Schema 3.91. Lemma e for the theorem pc-59.
(((( ) ) (( ) ( ))) ( )) (pc-59e)
Theorem Schema 3.92. Lemma f for the theorem pc-59.
(((( ) ) (( ) ( ))) ( )) (pc-59f)
Theorem Schema 3.93. Lemma g for the theorem pc-59.
(((( ) ) (( ) ( ))) (( ) )) (pc-59g)
Theorem Schema 3.94. Preliminary result for The First Weak Distributive
Law of the Conjunction in respect to the Alternative. We need this theorem,
into the proof of the First Weak Distributive Law of the Conjunction in respect
to the Alternative, with Reductio ad Absurdum Rule ra-r.
(((( ) ) (( ) ( ))) ( )) (pc-59)
Theorem Schema 3.95. The First Weak Distributive Law on the Right, of
the Conjunction in respect to the Alternative.
((( ) ) (( ) ( ))) (pc-60)
Theorem Schema 3.96. Strong Distributive Law on the Right, of the Con-
junction in respect to the Alternative. This is the Theorem 2.42 of [1] p. 70
.
((( ) ) (( ) ( ))) (pc-61)
Theorem Schema 3.97. Preliminary result for The Second Weak Form of
the Alternative Law. We need this theorem, into the proof of The Second Weak
Form of the Alternative Law, with Reductio ad Absurdum Rule ra-r.
((( ) ( )) ( )) (pc-62)
Theorem Schema 3.98. The Second Weak Form of the Alternative Law.
(( ) ( )) (pc-63)
Results on Propositional Calculus 17
Presentation of the rFOC Theory 18
Theorem Schema 3.99. Strong Form of the Alternative Law. This law is
usually assumed as a Denition of the Alternative sign, in several textbooks
of Mathematical Logic. This is the Theorem 1.11 of [1] p. 69 .
(( ) ( )) (pc-64)
Theorem Schema 3.100. Preliminary result for The First Weak Form of the
Conjunction Law. We need this theorem, into the proof of The First Weak Form
of the Conjunction Law, with Reductio ad Absurdum Rule ra-r.
((( ) ( )) ( )) (pc-65)
Theorem Schema 3.101. The First Weak Form of the Conjunction Law.
(( ) ( )) (pc-66)
Theorem Schema 3.102. Strong Form of the Conjunction Law. This law is
usually assumed as a Denition of the Conjunction sign, in several textbooks
of Mathematical Logic. This is the Theorem 1.12 of [1] p. 69 .
(( ) ( )) (pc-67)
Theorem Schema 3.103. Tertium Non Datur Law. This is the Theorem
5.1 of [1] p. 71
( ) (pc-68)
Theorem Schema 3.104. The First Weak Form of the Filones Law.
(( ) ( )) (pc-69)
Theorem Schema 3.105. The Second Weak Form of the Filones Law.
(( ) ( )) (pc-70)
Theorem Schema 3.106. Strong Form of the Filones Law. This is the
Theorem 1.21 of [1] p. 70 .
(( ) ( )) (pc-71)
Theorem Schema 3.107. Importation Law. This is the Theorem 6.21 of [1]
p. 71 .
(( ( )) (( ) )) (pc-72)
Theorem Schema 3.108. The Second Contraposition Law. This is the The-
orem 6.12 of [1] p. 71 .
(( ) ( )) (pc-73)
Theorem Schema 3.109. The Third Contraposition Law. This is the Theorem
6.13 of [1] p. 71 .
(( ) ( )) (pc-74)
Results on Propositional Calculus 18
Presentation of the rFOC Theory 19
Theorem Schema 3.110. The Fourth Contraposition Law. This is the Theo-
rem 6.14 of [1] p. 71 .
(( ) ( )) (pc-75)
Theorem Schema 3.111. The First Weak Form of the Crisippos Law.
(( ) ( )) (pc-76)
Theorem Schema 3.112. The Second Weak Form of the Crisippos Law.
(( ) ( )) (pc-77)
Theorem Schema 3.113. Strong Form of the Crisippos Law. This is the
Theorem 1.31 of [1] p. 70 .
(( ) ( )) (pc-78)
Theorem Schema 3.114. Lemma a for the theorem pc-79.
(((( ) ) ( ( ))) ) (pc-79a)
Theorem Schema 3.115. Lemma b for the theorem pc-79.
(((( ) ) ( ( ))) ) (pc-79b)
Theorem Schema 3.116. Lemma c for the theorem pc-79.
(((( ) ) ( ( ))) ) (pc-79c)
Theorem Schema 3.117. Lemma d for the theorem pc-79.
(((( ) ) ( ( ))) ) (pc-79d)
Theorem Schema 3.118. Preliminary result for the Exportation Law. We
need this theorem, into the proof of the Exportation Law with Reductio ad
Absurdum Rule ra-r.
(((( ) ) ( ( ))) ( )) (pc-79)
Theorem Schema 3.119. Exportation Law. This is the Theorem 6.22 of [1]
p. 71 .
((( ) ) ( ( ))) (pc-80)
Theorem Schema 3.120. Lemma a for the theorem pc-81.
((( ( )) ( ( ))) ) (pc-81a)
Theorem Schema 3.121. Lemma b for the theorem pc-81.
((( ( )) ( ( ))) ) (pc-81b)
Theorem Schema 3.122. Lemma c for the theorem pc-81.
((( ( )) ( ( ))) ) (pc-81c)
Results on Propositional Calculus 19
Presentation of the rFOC Theory 20
Theorem Schema 3.123. Lemma d for the theorem pc-81.
((( ( )) ( ( ))) ) (pc-81d)
Theorem Schema 3.124. Preliminary result for the Antecedent Exchange
Law. We need this theorem, into the proof of the Antecedent Exchange Law,
with Reductio ad Absurdum Rule ra-r.
((( ( )) ( ( ))) ( )) (pc-81)
Theorem Schema 3.125. Antecedent Exchange Law. This is the Theorem 6.3
of [1] p. 71 .
(( ( )) ( ( ))) (pc-82)
Theorem Schema 3.126. The First Weak Form of the Distributive Law of
the Conditional in respect to the Conjunction.
(( ( )) (( ) ( ))) (pc-83)
Theorem Schema 3.127. The Second Weak Form of the Distributive Law of
the Conditional in respect to the Conjunction.
((( ) ( )) ( ( ))) (pc-84)
Theorem Schema 3.128. Strong Form of the Distributive Law of the Con-
ditional in respect to the Conjunction. This is the Theorem 3.1 of [1] p. 70
.
(( ( )) (( ) ( ))) (pc-85)
Theorem Schema 3.129. Lemma a for the theorem pc-86.
((( ( )) (( ) ( ))) ) (pc-86a)
Theorem Schema 3.130. Lemma b for the theorem pc-86.
((( ( )) (( ) ( ))) ) (pc-86b)
Theorem Schema 3.131. Lemma c for the theorem pc-86.
((( ( )) (( ) ( ))) ( )) (pc-86c)
Theorem Schema 3.132. Lemma d for the theorem pc-86.
((( ( )) (( ) ( ))) ) (pc-86d)
Theorem Schema 3.133. Lemma e for the theorem pc-86.
((( ( )) (( ) ( ))) ) (pc-86e)
Theorem Schema 3.134. Preliminary result for The First Weak Form of the
Distributive Law of the Conditional in respect to the Alternative. We need this
theorem, into the proof of The First Weak Form of the Distributive Law of the
Conditional in respect to the Alternative, with Reductio ad Absurdum Rule
ra-r.
((( ( )) (( ) ( ))) ( )) (pc-86)
Results on Propositional Calculus 20
Presentation of the rFOC Theory 21
Theorem Schema 3.135. The First Weak Form of the Distributive Law of
the Conditional in respect to the Alternative.
(( ( )) (( ) ( ))) (pc-87)
Theorem Schema 3.136. The Second Weak Form of the Distributive Law of
the Conditional in respect to the Alternative.
((( ) ( )) ( ( ))) (pc-88)
Theorem Schema 3.137. Strong Form of the Distributive Law of the Con-
ditional in respect to the Alternative. This is the Theorem 3.2 of [1] p. 70
.
(( ( )) (( ) ( ))) (pc-89)
Theorem Schema 3.138. Lemma a for the theorem pc-90.
((( ( )) (( ) ( ))) ( )) (pc-90a)
Theorem Schema 3.139. Lemma b for the theorem pc-90.
((( ( )) (( ) ( ))) ( )) (pc-90b)
Theorem Schema 3.140. Lemma c for the theorem pc-90.
((( ( )) (( ) ( ))) ( )) (pc-90c)
Theorem Schema 3.141. Lemma d for the theorem pc-90.
((( ( )) (( ) ( ))) ) (pc-90d)
Theorem Schema 3.142. Lemma e for the theorem pc-90.
((( ( )) (( ) ( ))) ) (pc-90e)
Theorem Schema 3.143. Lemma f for the theorem pc-90.
((( ( )) (( ) ( ))) ) (pc-90f)
Theorem Schema 3.144. Lemma g for the theorem pc-90.
((( ( )) (( ) ( ))) ) (pc-90g)
Theorem Schema 3.145. Preliminary result for The First Weak Form of the
Distributive Law of the Conditional in respect to the Conditional. We need this
theorem, into the proof of The First Weak Form of the Distributive Law of the
Conditional in respect to the Conditional, with Reductio ad Absurdum Rule
ra-r.
((( ( )) (( ) ( ))) ( )) (pc-90)
Theorem Schema 3.146. The First Weak Form of the Distributive Law of
the Conditional in respect to the Conditional.
(( ( )) (( ) ( ))) (pc-91)
Results on Propositional Calculus 21
Presentation of the rFOC Theory 22
Theorem Schema 3.147. Lemma a for the theorem pc-92.
(((( ) ( )) ( ( ))) ) (pc-92a)
Theorem Schema 3.148. Lemma b for the theorem pc-92.
(((( ) ( )) ( ( ))) ( )) (pc-92b)
Theorem Schema 3.149. Lemma c for the theorem pc-92.
(((( ) ( )) ( ( ))) ( )) (pc-92c)
Theorem Schema 3.150. Lemma d for the theorem pc-92.
(((( ) ( )) ( ( ))) ) (pc-92d)
Theorem Schema 3.151. Lemma e for the theorem pc-92.
(((( ) ( )) ( ( ))) ) (pc-92e)
Theorem Schema 3.152. Lemma f for the theorem pc-92.
(((( ) ( )) ( ( ))) ) (pc-92f)
Theorem Schema 3.153. Preliminary result for The Second Weak Form of
the Distributive Law of the Conditional in respect to the Conditional. We need
this theorem, into the proof of The Second Weak Form of the Distributive Law
of the Conditional in respect to the Conditional, with Reductio ad Absurdum
Rule ra-r.
(((( ) ( )) ( ( ))) ( )) (pc-92)
Theorem Schema 3.154. The Second Weak Form of the Distributive Law of
the Conditional in respect to the Conditional.
((( ) ( )) ( ( ))) (pc-93)
Theorem Schema 3.155. Strong Form of the Distributive Law of the Con-
ditional in respect to the Conditional. This is the Theorem 3.3 of [1] p. 70
.
(( ( )) (( ) ( ))) (pc-94)
Theorem Schema 3.156. Preliminary result for The First Weak Form of the
Biconditional Law in respect to the Conditional and Negation. We need this
theorem, into the proof of The First Weak Form of the Biconditional Law in
respect to the Conditional and Negation, with Reductio ad Absurdum Rule
ra-r.
((( ) (( ) ( ))) (( ) ( )))
(pc-95)
Theorem Schema 3.157. The First Weak Form of the Biconditional Law in
respect to the Conditional and Negation.
(( ) (( ) ( ))) (pc-96)
Results on Propositional Calculus 22
Presentation of the rFOC Theory 23
Theorem Schema 3.158. Lemma a for the theorem pc-97.
((( ) ( )) ( )) (pc-97a)
Theorem Schema 3.159. Lemma b for the theorem pc-97.
((( ) ( )) ( )) (pc-97b)
Theorem Schema 3.160. The Second Weak Form of the Biconditional Law
in respect to the Conditional and Negation.
((( ) ( )) ( )) (pc-97)
Theorem Schema 3.161. Strong Form of the Biconditional Law in respect to
the Conditional and Negation. This law is usually assumed as a Denition of
Biconditional sign in some textbooks of Mathematical Logic, by substituting our
extern sign with a sign to the form =df. (a such denition is called a
Metatheoretical denition). This is the Theorem 1.13 of [1] p. 70 .
(( ) (( ) ( ))) (pc-98)
Theorem Schema 3.162. The First Weak Form of the Biconditional Law in
respect to the Alternative and Negation.
(( ) (( ) ( ))) (pc-99)
Theorem Schema 3.163. The Second Weak Form of the Biconditional Law
in respect to the Alternative and Negation.
((( ) ( )) ( )) (pc-100)
Theorem Schema 3.164. Strong Form of the Biconditional Law in respect to
the Alternative and Negation. This is the Theorem 1.23 of [1] p. 70 .
(( ) (( ) ( ))) (pc-101)
Theorem Schema 3.165. The First Weak Form of the Biconditional Law in
respect to the Conjunction and Negation.
(( ) (( ) ( ))) (pc-102)
Theorem Schema 3.166. The Second Weak Form of the Biconditional Law
in respect to the Conjunction and Negation.
((( ) ( )) ( )) (pc-103)
Theorem Schema 3.167. Strong Form of the Biconditional Law in respect to
the Conjunction and Negation. This is the Theorem 1.33 of [1] p. 70 .
(( ) (( ) ( ))) (pc-104)
Theorem Schema 3.168. Lemma a for the theorem pc-105.
((( ) ( )) ((( ) ( )) (( ) ( ))))
(pc-105a)
Results on Propositional Calculus 23
Presentation of the rFOC Theory 24
Theorem Schema 3.169. Lemma b for the theorem pc-105.
((( ) ( )) ( )) (pc-105b)
Theorem Schema 3.170. Lemma c for the theorem pc-105.
((( ) ( )) ( )) (pc-105c)
Theorem Schema 3.171. Lemma d for the theorem pc-105.
((( ) ( )) ) (pc-105d)
Theorem Schema 3.172. Lemma e for the theorem pc-105.
((( ) ( )) ) (pc-105e)
Theorem Schema 3.173. Lemma f for the theorem pc-105.
((( ) ( )) ) (pc-105f)
Theorem Schema 3.174. Lemma g for the theorem pc-105.
((( ) ( )) ( )) (pc-105g)
Theorem Schema 3.175. Lemma h for the theorem pc-105.
((( ) ( )) ( )) (pc-105h)
Theorem Schema 3.176. Lemma i for the theorem pc-105.
((( ) ( )) ( )) (pc-105i)
Theorem Schema 3.177. Lemma j for the theorem pc-105.
((( ) ( )) ( )) (pc-105j)
Theorem Schema 3.178. Lemma k for the theorem pc-105.
((( ( )) (( ) ( ))) ( )) (pc-105k)
Theorem Schema 3.179. Lemma l for the theorem pc-105.
((( ( )) (( ) ( ))) ) (pc-105l)
Theorem Schema 3.180. Lemma m for the theorem pc-105.
((( ( )) (( ) ( ))) ( )) (pc-105m)
Theorem Schema 3.181. Preliminary result of the Distributive Law of the
Conditional in respect to the Biconditional. We need this theorem, into the
proof of the Distributive Law of the Conditional in respect to the Biconditional,
with Reductio ad Absurdum Rule ra-r.
((( ( )) (( ) ( ))) (( ) ( )))
(pc-105)
Results on Propositional Calculus 24
Presentation of the rFOC Theory 25
Theorem Schema 3.182. Distributive Law of the Conditional in rispect to
the Biconditional. This is the Theorem 3.4 of [1] p. 70
(( ( )) (( ) ( ))) (pc-106)
Theorem Schema 3.183. Commutative Law of the Biconditional. This is the
Theorem 4.2 of [1] p. 70 .
(( ) ( )) (pc-107)
Theorem Schema 3.184. Transitive Law of the Biconditional. This is the
Theorem 4.3 of [1] p. 70 .
((( ) ( )) ( )) (pc-108)
Theorem Schema 3.185. Lemma a for the theorem pc-109.
(( ) (( ) ( ))) (pc-109a)
Theorem Schema 3.186. The First Monotonicity Law of the Conjunction in
respect to the Biconditional. This is the Theorem 4.41 of [1] p. 71 .
(( ) (( ) ( ))) (pc-109)
Theorem Schema 3.187. Lemma a for the theorem pc-110.
(( ) (( ) ( ))) (pc-110a)
Theorem Schema 3.188. The First Monotonicity Law of the Alternative in
respect to the Biconditional. This is the Theorem 4.42 of [1] p. 71 .
(( ) (( ) ( ))) (pc-110)
Theorem Schema 3.189. Lemma a for the theorem pc-111.
(( ) (( ) ( ))) (pc-111a)
Theorem Schema 3.190. The First Monotonicity Law of the Conditional in
respect to the Biconditional. This is the Theorem 4.43 of [1] p. 71 .
(( ) (( ) ( ))) (pc-111)
Theorem Schema 3.191. Lemma a for the theorem pc-112.
(( ) (( ) ( ))) (pc-112a)
Theorem Schema 3.192. The First Monotonicity Law of the Biconditional
in respect to the Biconditional. This is the Theorem 4.44 of [1] p. 71 .
(( ) (( ) ( ))) (pc-112)
Theorem Schema 3.193. Lemma a for the theorem pc-113.
(( ) (( ) ( ))) (pc-113a)
Results on Propositional Calculus 25
Presentation of the rFOC Theory 26
Theorem Schema 3.194. The Second Monotonicity Law of the Conjunction
in respect to the Biconditional. This is the Theorem 4.51 of [1] p. 71 .
(( ) (( ) ( ))) (pc-113)
Theorem Schema 3.195. Lemma a for the theorem pc-114.
(( ) (( ) ( ))) (pc-114a)
Theorem Schema 3.196. The Second Monotonicity Law of the Alternative in
respect to the Biconditional. This is the Theorem 4.52 of [1] p. 71 .
(( ) (( ) ( ))) (pc-114)
Theorem Schema 3.197. Lemma a for the theorem pc-115.
(( ) (( ) ( ))) (pc-115a)
Theorem Schema 3.198. The Second Monotonicity Law of the Conditional
in respect to the Biconditional. This is the Theorem 4.53 of [1] p. 71 .
(( ) (( ) ( ))) (pc-115)
Theorem Schema 3.199. Lemma a for the theorem pc-116.
(( ) (( ) ( ))) (pc-116a)
Theorem Schema 3.200. The Second Monotonicity Law of the Biconditional
in respect to the Biconditional. This is the Theorem 4.54 of [1] p. 71 .
(( ) (( ) ( ))) (pc-116)
Theorem Schema 3.201. The First Weak Form of the Contraposition Law of
the Biconditional.
(( ) ( )) (pc-117)
Theorem Schema 3.202. The Second Weak Form of the Contraposition Law
of the Biconditional.
(( ) ( )) (pc-118)
Theorem Schema 3.203. Strong Form of the Contraposition Law of the Bi-
conditional. This is the Theorem 5.4 of [1] p. 71 .
(( ) ( )) (pc-119)
Theorem Schema 3.204. The First Weak Distributive Law on the Left, of
the Conjunction in respect to the Alternative.
(( ( )) (( ) ( ))) (pc-120)
Theorem Schema 3.205. The Second Weak Distributive Law on the Left, of
the Conjunction in respect to the Alternative.
((( ) ( )) ( ( ))) (pc-121)
Results on Propositional Calculus 26
Presentation of the rFOC Theory 27
Theorem Schema 3.206. Strong Distributive Law on the Left, of the Con-
junction in respect to the Alternative.
(( ( )) (( ) ( ))) (pc-122)
Theorem Schema 3.207. The First Weak Distributive Law on the Left, of
the Alternative in respect to the Conjunction.
(( ( )) (( ) ( ))) (pc-123)
Theorem Schema 3.208. The Second Weak Distributive Law on the Left, of
the Alternative in respect to the Conjunction.
((( ) ( )) ( ( ))) (pc-124)
Theorem Schema 3.209. Strong Distributive Law on the Left, of the Alter-
native in respect to the Conjunction.
(( ( )) (( ) ( ))) (pc-125)
4 Results on Predicate Calculus
Theorem Schema 4.1. Universalization is stronger than particularization.
This is the Theorem I of [1] p. 166 .
((x) (x)) (rfoc-1)
Theorem Schema 4.2. Universalizer Exchange Weak Law.
((x(y)) (y(x))) (rfoc-2)
Theorem Schema 4.3. Universalizer Exchange Strong Law.
((x(y)) (y(x))) (rfoc-3)
Theorem Schema 4.4. Universalizer Exportation Law in respect to the Par-
ticularizer. This is the theorem of [1] p. 170 .
((x(y)) (y(x))) (rfoc-4)
Theorem Schema 4.5. Particularizer Exchange Weak Law.
((x(y)) (y(x))) (rfoc-5)
Theorem Schema 4.6. Particularizer Exchange Strong Law.
((x(y)) (y(x))) (rfoc-6)
Theorem Schema 4.7. The First Weak Form of the theorem 1.1 of [1] p. 173
.
((x) (x)) (rfoc-7)
Results on Predicate Calculus 27
Presentation of the rFOC Theory 28
Theorem Schema 4.8. The Second Weak Form of the theorem 1.1 of [1] p.
173 .
((x) (x)) (rfoc-8)
Theorem Schema 4.9. Theorem 1.1 of [1] p. 173 .
((x) (x)) (rfoc-9)
Theorem Schema 4.10. The First Weak Form of the theorem 1.2 of [1] p.
173 .
((x) (x)) (rfoc-10)
Theorem Schema 4.11. The Second Weak Form of the theorem 1.2 of [1] p.
173 .
((x) (x)) (rfoc-11)
Theorem Schema 4.12. Theorem 1.2 of [1] p. 173 .
((x) (x)) (rfoc-12)
Theorem Schema 4.13. The First Weak Form of the theorem 1.3 of [1] p.
173 .
((x) (x)) (rfoc-13)
Theorem Schema 4.14. The Second Weak Form of the theorem 1.3 of [1] p.
173 .
((x) (x)) (rfoc-14)
Theorem Schema 4.15. Theorem 1.3 of [1] p. 173 .
((x) (x)) (rfoc-15)
Theorem Schema 4.16. The First Weak Form of the theorem 1.4 of [1] p.
173 .
((x) (x)) (rfoc-16)
Theorem Schema 4.17. The Second Weak Form of the theorem 1.4 of [1] p.
173 .
((x) (x)) (rfoc-17)
Theorem Schema 4.18. Theorem 1.4 of [1] p. 173 .
((x) (x)) (rfoc-18)
Theorem Schema 4.19. The First Weak Form of the Distributive Law of the
Universalizer in respect to the Conjunction.
((x( )) ((x) (x))) (rfoc-19)
Results on Predicate Calculus 28
Presentation of the rFOC Theory 29
Theorem Schema 4.20. The Second Weak Form of the Distributive Law of
the Universalizer in respect to the Conjunction.
(((x) (x)) (x( ))) (rfoc-20)
Theorem Schema 4.21. Distributive Law of the Universalizer in respect to
the Conjunction. This is the theorem 2.1 of [1] p. 173 .
((x( )) ((x) (x))) (rfoc-21)
Theorem Schema 4.22. Distributive Law of the Particularizer in respect to
the Conjunction. This is the theorem 2.2 of [1] p. 173 .
((x( )) ((x) (x))) (rfoc-22)
Theorem Schema 4.23. Exportation Law in respect to the Universalizer and
Conjunction.
((x( )) ( (x))) (rfoc-23)
Metatheorem Schema 4.1. Importation Law in respect to the Universalizer
and Conjunction. If x is not free in , then we have the following result:
(( (x)) (x( ))) (rfoc-24)
Metatheorem Schema 4.2. Crossing under the Universalizer in respect to
the Conjunction. This is the theorem 2.3 of [1] p. 173 . If x is not free in ,
then we have the following result:
((x( )) ( (x))) (rfoc-25)
Metatheorem Schema 4.3. Exportation Law in respect to the Particularizer
and Conjunction. If x is not free in , then we have the following result:
((x( )) ( (x))) (rfoc-26)
Theorem Schema 4.24. Lemma a for the theorem rfoc-27.
((( (x)) (x( ))) ( )) (rfoc-27a)
Metatheorem Schema 4.4. Preliminary result for the theorem rfoc-28. If
x is not free in , then we have the following result:
((( (x)) (x( ))) ((x) (x))) (rfoc-27)
Metatheorem Schema 4.5. Importation Law in respect to the Particularizer
and Conjunction. If x is not free in , then we have the following result:
(( (x)) (x( ))) (rfoc-28)
Metatheorem Schema 4.6. Crossing under the Particularizer in respect to
the Conjunction. This is the theorem 2.4 of [1] p. 173 . If x is not free in ,
then we have the following result:
((x( )) ( (x))) (rfoc-29)
Results on Predicate Calculus 29
Presentation of the rFOC Theory 30
Theorem Schema 4.25. The First Weak Form of the Distributive Law of the
Particularizer in respect to the Alternative.
((x( )) ((x) (x))) (rfoc-30)
Theorem Schema 4.26. The Second Weak Form of the Distributive Law of
the Particularizer in respect to the Alternative.
(((x) (x)) (x( ))) (rfoc-31)
Theorem Schema 4.27. Distributive Law of the Particularizer in respect to
the Alternative. This is the theorem 3.1 of [1] p. 174 .
((x( )) ((x) (x))) (rfoc-32)
Theorem Schema 4.28. Distributive Law of the Universalizer in respect to
the Alternative. This is the theorem 3.2 of [1] p. 174 .
(((x) (x)) (x( ))) (rfoc-33)
Metatheorem Schema 4.7. Exportation Law in respect to the Particularizer
and Alternative. If x is not free in , then we have the following result:
((x( )) ( (x))) (rfoc-34)
Theorem Schema 4.29. Importation Law in respect to the Particularizer and
Alternative.
(( (x)) (x( ))) (rfoc-35)
Metatheorem Schema 4.8. Crossing under the Particularizer in respect to
the Alternative. This is the theorem 3.3 of [1] p. 174 . If x is not free in ,
then we have the following result:
((x( )) ( (x))) (rfoc-36)
Metatheorem Schema 4.9. Importation Law in respect to the Universalizer
and Alternative. If x is not free in , then we have the following result:
(( (x)) (x( ))) (rfoc-37)
Theorem Schema 4.30. Lemma a for the theorem rfoc-38.
(((x( )) ( (x))) ( (x))) (rfoc-38a)
Theorem Schema 4.31. Lemma b for the theorem rfoc-38.
(((x( )) ( (x))) ( )) (rfoc-38b)
Metatheorem Schema 4.10. Preliminary result for the theorem rfoc-39. If
x is not free in , then we have the following result:
(((x( )) ( (x))) ((x) (x))) (rfoc-38)
Results on Predicate Calculus 30
Presentation of the rFOC Theory 31
Metatheorem Schema 4.11. Exportation Law in respect to the Universalizer
and Alternative. If x is not free in , then we have the following result:
((x( )) ( (x))) (rfoc-39)
Metatheorem Schema 4.12. Crossing under the Universalizer in respect to
the Alternative. This is the theorem 3.4 of [1] p. 174 . If x is not free in ,
then we have the following result:
((x( )) ( (x))) (rfoc-40)
Theorem Schema 4.32. Lemma a for the theorem rfoc-41b and for the
theorem rfoc-41.
(((x( )) ((x) (x))) ((x) (x))) (rfoc-41a)
Theorem Schema 4.33. Lemma b for the theorem rfoc-41.
(((x( )) ((x) (x))) ) (rfoc-41b)
Theorem Schema 4.34. Preliminary result for the theorem rfoc-42.
(((x( )) ((x) (x))) ((x) (x))) (rfoc-41)
Theorem Schema 4.35. Distributive Law of the Universalizer in respect to
the Conditional. This is the theorem 4.1 of [1] p. 174 .
((x( )) ((x) (x))) (rfoc-42)
Theorem Schema 4.36. Lemma a for the theorem rfoc-43b and for the
theorem rfoc-43.
((((x) (x)) (x( ))) ( )) (rfoc-43a)
Theorem Schema 4.37. Lemma b for the theorem rfoc-43.
((((x) (x)) (x( ))) (x)) (rfoc-43b)
Theorem Schema 4.38. Preliminary result for the theorem rfoc-44.
((((x) (x)) (x( ))) ((x) (x))) (rfoc-43)
Theorem Schema 4.39. Distributive Law of the Particularizer in respect to
the Conditional. This is the theorem 4.2 of [1] p. 174 .
(((x) (x)) (x( ))) (rfoc-44)
Theorem Schema 4.40. Lemma a for the theorem rfoc-45b and for the
theorem rfoc-45.
(((x( )) ( (x))) ( (x))) (rfoc-45a)
Metatheorem Schema 4.13. Lemma b for the theorem rfoc-45. If x is
not free in , then we have the following result:
(((x( )) ( (x))) (x)) (rfoc-45b)
Results on Predicate Calculus 31
Presentation of the rFOC Theory 32
Metatheorem Schema 4.14. Preliminary result for the theorem rfoc-46. If
x is not free in , then we have the following result:
(((x( )) ( (x))) ((x) (x))) (rfoc-45)
Metatheorem Schema 4.15. Exportation Law in respect to the Universalizer
and Conditional. If x is not free in , then we have the following result:
((x( )) ( (x))) (rfoc-46)
Metatheorem Schema 4.16. Importation Law in respect to the Universalizer
and Conditional. If x is not free in , then we have the following result:
(( (x)) (x( ))) (rfoc-47)
Metatheorem Schema 4.17. Crossing under the Universalizer in respect to
the Conditional. This is the theorem 4.3 of [1] p. 174 . If x is not free in ,
then we have the following result:
((x( )) ( (x))) (rfoc-48)
Metatheorem Schema 4.18. Exportation Law in respect to the Particularizer
and Conditional. If x is not free in , then we have the following result:
((x( )) ( (x))) (rfoc-49)
Theorem Schema 4.41. Lemma a for the theorem rfoc-50.
((( (x)) (x( ))) ( )) (rfoc-50a)
Metatheorem Schema 4.19. Preliminary result for the theorem rfoc-51. If
x is not free in , then we have the following result:
((( (x)) (x( ))) ((x) (x))) (rfoc-50)
Metatheorem Schema 4.20. Importation Law in respect to the Particularizer
and Conditional. If x is not free in , then we have the following result:
(( (x)) (x( ))) (rfoc-51)
Metatheorem Schema 4.21. Crossing under the Particularizer in respect to
the Conditional. This is the theorem 4.4 of [1] p. 174 . If x is not free in ,
then we have the following result:
((x( )) ( (x))) (rfoc-52)
Theorem Schema 4.42. Lemma a for the theorem rfoc-53b and the theo-
rem rfoc-53.
(((x( )) ((x) )) ((x) )) (rfoc-53a)
Theorem Schema 4.43. Lemma b for the theorem rfoc-53.
(((x( )) ((x) )) ) (rfoc-53b)
Results on Predicate Calculus 32
Presentation of the rFOC Theory 33
Metatheorem Schema 4.22. Preliminary result for the theorem rfoc-54. If
x is not free in , then we have the following result:
(((x( )) ((x) )) ((x) (x))) (rfoc-53)
Metatheorem Schema 4.23. The First Weak Form of the theorem 4.5 of [1]
p. 174 . If x is not free in , then we have the following result:
((x( )) ((x) )) (rfoc-54)
Theorem Schema 4.44. Lemma a for the theorem rfoc-55.
((((x) ) ( )) ( )) (rfoc-55a)
Theorem Schema 4.45. Preliminary result for the theorem rfoc-56.
((((x) ) ( )) ((x) (x))) (rfoc-55)
Theorem Schema 4.46. Preliminary result for the theorem rfoc-57.
(((x) ) ( )) (rfoc-56)
Metatheorem Schema 4.24. The Second Weak Form of the theorem 4.5 of
[1] p. 174 . If x is not free in , then we have the following result:
(((x) ) (x( ))) (rfoc-57)
Metatheorem Schema 4.25. Theorem 4.5 of [1] p. 174 . If x is not free in
, then we have the following result:
((x( )) ((x) )) (rfoc-58)
Theorem Schema 4.47. Lemma a for the theorem rfoc-59.
((( ) ((x) )) ((x) )) (rfoc-59a)
Theorem Schema 4.48. Preliminary result for the theorem rfoc-60.
((( ) ((x) )) ( )) (rfoc-59)
Theorem Schema 4.49. Preliminary result for the theorem rfoc-61.
(( ) ((x) )) (rfoc-60)
Metatheorem Schema 4.26. The First Weak Form of the theorem 4.6 of [1]
p. 174 . If x is not free in , then we have the following result:
((x( )) ((x) )) (rfoc-61)
Theorem Schema 4.50. Lemma a for the theorem rfoc-62.
((((x) ) (x( ))) ( )) (rfoc-62a)
Metatheorem Schema 4.27. Preliminary result for the theorem rfoc-63. If
x is not free in , then we have the following result:
((((x) ) (x( ))) ((x) (x))) (rfoc-62)
Results on Predicate Calculus 33
Presentation of the rFOC Theory 34
Metatheorem Schema 4.28. The Second Weak Form of the theorem 4.6 of
[1] p. 174 . If x is not free in , then we have the following result:
(((x) ) (x( ))) (rfoc-63)
Metatheorem Schema 4.29. Theorem 4.6 of [1] p. 174 . If x is not free in
, then we have the following result:
((x( )) ((x) )) (rfoc-64)
Theorem Schema 4.51. Propagation Law of Particularizator by Conditional.
((x( )) ((x) (x))) (rfoc-65)
5 Results on Predicate Calculus with Identity
Metatheorem Schema 5.1. Right Weak Form of the ax-i.2. If is obtained
from by replacing one or more occurrences of s in all simultaneously by t,
and if none of the occurrences of s in have occurrences of variables bound in
and similarly for the occurrences of t in , then we have the following result.
(s = t ( )) (rfoci-i.2r)
Metatheorem Schema 5.2. Left Weak Form of the ax-i.2. If is obtained
from by replacing one or more occurrences of s in all simultaneously by t,
and if none of the occurrences of s in have occurrences of variables bound in
and similarly for the occurrences of t in , then we have the following result.
(s = t ( )) (rfoci-i.2l)
Metatheorem Schema 5.3. Theorem 31 of [2] p. 173 . If x is not free in ,
the we have the following result:
( (x)) (rfoci-1)
Metatheorem Schema 5.4. Theorem 34 of [2] p. 174 . If x has not occur-
rences in s ( this assumption is necessary, otherwise we cannot obtain s = s by
substituting s in every free occurrence of x in x = s), then we have the following
result:
(xx = s) (rfoci-2)
Theorem Schema 5.1. Identity Symmetry Law. This is the theorem 35 of [2]
p. 174 .
(x = y y = x) (rfoci-3)
Theorem Schema 5.2. Identity Transitivity Law. This is the theorem 36 of
[2] p. 174 .
((x = y y = z) x = z) (rfoci-4)
Results on Predicate Calculus with Identity 34
Presentation of the rFOC Theory 35
Metatheorem Schema 5.5. Identity Propagation Law. This is the theorem
37 of [2] p. 174 . If t

is obtained from s

by replacing one or more occurrences

of s in s

by t all simultaneously, then we have the following result:

(s = t s

= t

) (rfoci-5)
Theorem Schema 5.3. Identity Particularization.
(xx = x) (rfoci-6)
Theorem Schema 5.4. Identity Universalization.
(xx = x) (rfoci-7)
Theorem Schema 5.5. Universalization of the Identity Symmetry Law.
(x(y(x = y y = x))) (rfoci-8)
Theorem Schema 5.6. Universalization of the Identity Transitivity Law.
(x(y(z((x = y y = z) x = z)))) (rfoci-9)
References
[1] Casari Ettore: Lineamenti di Logica Matematica, Feltrinelli, 1960
[2] Monk Donald J.: Introduction to Set Theory, McGraw-Hill, 1969
[3] Srivastava S.M.: A Course on Mathematical Logic, Springer Sci-
ence+Business Media, LLC, 2008
[4] Enderton H.B.: A Mathematical Introduction to Logic (Second Edition),
Harcourt/Academic Press, 2001, New York
[5] Hamilton A.G.: Logic for Mathematicians (Revised Edition), Cambridge
University Press, 1988
[6] Mendelson E.: Introduction to Mathematical Logic (Fourth Edition), Chap-
man & Hall, 1997, New York
[7] Rautenberg W.: A Concise Introduction to Mathematical Logic (Third Edi-
tion), Springer Science+Business Media LLC, New York, 2010
[8] Megill N.: Metamath Project, http://www.metamath.org/
Results on Predicate Calculus with Identity 35