 Home Intuitionistic Logic ExplorerTheorem List (p. 8 of 74) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  ILE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Theorem List for Intuitionistic Logic Explorer - 701-800   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theorempm2.64 701 Theorem *2.64 of [WhiteheadRussell] p. 107. (Contributed by NM, 3-Jan-2005.)
((φ ψ) → ((φ ¬ ψ) → φ))

Theorempm5.53 702 Theorem *5.53 of [WhiteheadRussell] p. 125. (Contributed by NM, 3-Jan-2005.)
((((φ ψ) χ) → θ) ↔ (((φθ) (ψθ)) (χθ)))

Theorempm2.38 703 Theorem *2.38 of [WhiteheadRussell] p. 105. (Contributed by NM, 6-Mar-2008.)
((ψχ) → ((ψ φ) → (χ φ)))

Theorempm2.36 704 Theorem *2.36 of [WhiteheadRussell] p. 105. (Contributed by NM, 6-Mar-2008.)
((ψχ) → ((φ ψ) → (χ φ)))

Theorempm2.37 705 Theorem *2.37 of [WhiteheadRussell] p. 105. (Contributed by NM, 6-Mar-2008.)
((ψχ) → ((ψ φ) → (φ χ)))

Theorempm2.73 706 Theorem *2.73 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.)
((φψ) → (((φ ψ) χ) → (ψ χ)))

Theorempm2.74 707 Theorem *2.74 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Mario Carneiro, 31-Jan-2015.)
((ψφ) → (((φ ψ) χ) → (φ χ)))

Theorempm2.76 708 Theorem *2.76 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.) (Revised by Mario Carneiro, 31-Jan-2015.)
((φ (ψχ)) → ((φ ψ) → (φ χ)))

Theorempm2.75 709 Theorem *2.75 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 4-Jan-2013.)
((φ ψ) → ((φ (ψχ)) → (φ χ)))

Theorempm2.8 710 Theorem *2.8 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Mario Carneiro, 31-Jan-2015.)
((φ ψ) → ((¬ ψ χ) → (φ χ)))

Theorempm2.81 711 Theorem *2.81 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.)
((ψ → (χθ)) → ((φ ψ) → ((φ χ) → (φ θ))))

Theorempm2.82 712 Theorem *2.82 of [WhiteheadRussell] p. 108. (Contributed by NM, 3-Jan-2005.)
(((φ ψ) χ) → (((φ ¬ χ) θ) → ((φ ψ) θ)))

Theorempm3.2ni 713 Infer negated disjunction of negated premises. (Contributed by NM, 4-Apr-1995.)
¬ φ    &    ¬ ψ        ¬ (φ ψ)

Theoremorabs 714 Absorption of redundant internal disjunct. Compare Theorem *4.45 of [WhiteheadRussell] p. 119. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 28-Feb-2014.)
(φ ↔ ((φ ψ) φ))

TheoremorabsOLD 715 Obsolete proof of orabs 714 as of 28-Feb-2014. (Contributed by NM, 5-Aug-1993.)
(φ ↔ ((φ ψ) φ))

Theoremoranabs 716 Absorb a disjunct into a conjunct. (Contributed by Roy F. Longton, 23-Jun-2005.) (Proof shortened by Wolf Lammen, 10-Nov-2013.)
(((φ ¬ ψ) ψ) ↔ (φ ψ))

Theoremordi 717 Distributive law for disjunction. Theorem *4.41 of [WhiteheadRussell] p. 119. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 31-Jan-2015.)
((φ (ψ χ)) ↔ ((φ ψ) (φ χ)))

Theoremordir 718 Distributive law for disjunction. (Contributed by NM, 12-Aug-1994.)
(((φ ψ) χ) ↔ ((φ χ) (ψ χ)))

Theoremandi 719 Distributive law for conjunction. Theorem *4.4 of [WhiteheadRussell] p. 118. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 5-Jan-2013.)
((φ (ψ χ)) ↔ ((φ ψ) (φ χ)))

Theoremandir 720 Distributive law for conjunction. (Contributed by NM, 12-Aug-1994.)
(((φ ψ) χ) ↔ ((φ χ) (ψ χ)))

Theoremorddi 721 Double distributive law for disjunction. (Contributed by NM, 12-Aug-1994.)
(((φ ψ) (χ θ)) ↔ (((φ χ) (φ θ)) ((ψ χ) (ψ θ))))

Theoremanddi 722 Double distributive law for conjunction. (Contributed by NM, 12-Aug-1994.)
(((φ ψ) (χ θ)) ↔ (((φ χ) (φ θ)) ((ψ χ) (ψ θ))))

Theorempm4.39 723 Theorem *4.39 of [WhiteheadRussell] p. 118. (Contributed by NM, 3-Jan-2005.)
(((φχ) (ψθ)) → ((φ ψ) ↔ (χ θ)))

Theorempm4.72 724 Implication in terms of biconditional and disjunction. Theorem *4.72 of [WhiteheadRussell] p. 121. (Contributed by NM, 30-Aug-1993.) (Proof shortened by Wolf Lammen, 30-Jan-2013.)
((φψ) ↔ (ψ ↔ (φ ψ)))

Theorempm5.16 725 Theorem *5.16 of [WhiteheadRussell] p. 124. (Contributed by NM, 3-Jan-2005.) (Revised by Mario Carneiro, 31-Jan-2015.)
¬ ((φψ) (φ ↔ ¬ ψ))

Theorembiort 726 A wff is disjoined with truth is true. (Contributed by NM, 23-May-1999.)
(φ → (φ ↔ (φ ψ)))

1.2.7  Stable propositions

Syntaxwstab 727 Extend wff definition to include stability.
wff STAB φ

Definitiondf-stab 728 Propositions where a double-negative can be removed are called stable. See Chapter 2 [Moschovakis] p. 2.

Our notation for stability is a connective STAB which we place before the formula in question. For example, STAB x = y corresponds to "x = y is stable".

(Contributed by David A. Wheeler, 13-Aug-2018.)

(STAB φ ↔ (¬ ¬ φφ))

Theoremstabnot 729 Every formula of the form ¬ φ is stable. Uses notnotnot 615. (Contributed by David A. Wheeler, 13-Aug-2018.)
STAB ¬ φ

1.2.8  Decidable propositions

Syntaxwdc 730 Extend wff definition to include decidability.
wff DECID φ

Definitiondf-dc 731 Propositions which are known to be true or false are called decidable. The (classical) Law of the Excluded Middle corresponds to the principle that all propositions are decidable, but even given intuitionistic logic, particular kinds of propositions may be decidable (for example, the proposition that two natural numbers are equal will be decidable under most sets of axioms).

Our notation for decidability is a connective DECID which we place before the formula in question. For example, DECID x = y corresponds to "x = y is decidable".

We could transform intuitionistic logic to classical logic by adding unconditional forms of condc 737, exmiddc 732, peircedc 808, or notnot2dc 739, any of which would correspond to the assertion that all propositions are decidable.

(Contributed by Jim Kingdon, 11-Mar-2018.)

(DECID φ ↔ (φ ¬ φ))

Theoremexmiddc 732 Law of excluded middle, for a decidable proposition. The law of the excluded middle is also called the principle of tertium non datur. Theorem *2.11 of [WhiteheadRussell] p. 101. It says that something is either true or not true; there are no in-between values of truth. The key way in which intuitionistic logic differs from classical logic is that intuitionistic logic says that excluded middle only holds for some propositions, and classical logic says that it holds for all propositions. (Contributed by Jim Kingdon, 12-May-2018.)
(DECID φ → (φ ¬ φ))

Theorempm2.1dc 733 Commuted law of the excluded middle for a decidable proposition. Based on theorem *2.1 of [WhiteheadRussell] p. 101. (Contributed by Jim Kingdon, 25-Mar-2018.)
(DECID φ → (¬ φ φ))

Theoremdcn 734 A decidable proposition is decidable when negated. (Contributed by Jim Kingdon, 25-Mar-2018.)
(DECID φDECID ¬ φ)

Theoremdcbii 735 The equivalent of a decidable proposition is decidable. (Contributed by Jim Kingdon, 28-Mar-2018.)
(φψ)       (DECID φDECID ψ)

Theoremdcbid 736 The equivalent of a decidable proposition is decidable. (Contributed by Jim Kingdon, 7-Sep-2019.)
(φ → (ψχ))       (φ → (DECID ψDECID χ))

1.2.9  Theorems of decidable propositions

Many theorems of logic hold in intuitionistic logic just as they do in classical (non-inuitionistic) logic, for all propositions. Other theorems only hold for decidable propositions, such as the law of the excluded middle (df-dc 731), double negation elimination (notnotdc 754), or contraposition (condc 737). Our goal is to prove all well-known or important classical theorems, but with suitable decidability conditions so that the proofs follow from intuitionistic axioms. This section is focused on such proofs, given decidability conditions.

Theoremcondc 737 Contraposition of a decidable proposition.

This theorem swaps or "transposes" the order of the consequents when negation is removed. An informal example is that the statement "if there are no clouds in the sky, it is not raining" implies the statement "if it is raining, there are clouds in the sky." This theorem (without the decidability condition, of course) is called Transp or "the principle of transposition" in Principia Mathematica (Theorem *2.17 of [WhiteheadRussell] p. 103) and is Axiom A3 of [Margaris] p. 49. We will also use the term "contraposition" for this principle, although the reader is advised that in the field of philosophical logic, "contraposition" has a different technical meaning.

(Contributed by Jim Kingdon, 13-Mar-2018.)

(DECID φ → ((¬ φ → ¬ ψ) → (ψφ)))

Theorempm2.18dc 738 Proof by contradiction for a decidable proposition. Based on Theorem *2.18 of [WhiteheadRussell] p. 103 (also called the Law of Clavius). Intuitionistically it requires a decidability assumption, but compare with pm2.01 534 which does not. (Contributed by Jim Kingdon, 24-Mar-2018.)
(DECID φ → ((¬ φφ) → φ))

Theoremnotnot2dc 739 Double negation elimination for a decidable proposition. The converse, notnot1 547, holds for all propositions, not just decidable ones. This is Theorem *2.14 of [WhiteheadRussell] p. 102, but with a decidability condition added. (Contributed by Jim Kingdon, 11-Mar-2018.)
(DECID φ → (¬ ¬ φφ))

Theoremdcimpstab 740 Decidability implies stability. The converse is not necessarily true. (Contributed by David A. Wheeler, 13-Aug-2018.)
(DECID φSTAB φ)

Theoremcon1dc 741 Contraposition for a decidable proposition. Based on theorem *2.15 of [WhiteheadRussell] p. 102. (Contributed by Jim Kingdon, 29-Mar-2018.)
(DECID φ → ((¬ φψ) → (¬ ψφ)))

Theoremcon4biddc 742 A contraposition deduction. (Contributed by Jim Kingdon, 18-May-2018.)
(φ → (DECID ψ → (DECID χ → (¬ ψ ↔ ¬ χ))))       (φ → (DECID ψ → (DECID χ → (ψχ))))

Theoremimpidc 743 An importation inference for a decidable consequent. (Contributed by Jim Kingdon, 30-Apr-2018.)
(DECID χ → (φ → (ψχ)))       (DECID χ → (¬ (φ → ¬ ψ) → χ))

Theoremsimprimdc 744 Simplification given a decidable proposition. Similar to Theorem *3.27 (Simp) of [WhiteheadRussell] p. 112. (Contributed by Jim Kingdon, 30-Apr-2018.)
(DECID ψ → (¬ (φ → ¬ ψ) → ψ))

Theoremsimplimdc 745 Simplification for a decidable proposition. Similar to Theorem *3.26 (Simp) of [WhiteheadRussell] p. 112. (Contributed by Jim Kingdon, 29-Mar-2018.)
(DECID φ → (¬ (φψ) → φ))

Theorempm2.61ddc 746 Deduction eliminating a decidable antecedent. (Contributed by Jim Kingdon, 4-May-2018.)
(φ → (ψχ))    &   (φ → (¬ ψχ))       (DECID ψ → (φχ))

Theorempm2.6dc 747 Case elimination for a decidable proposition. Based on theorem *2.6 of [WhiteheadRussell] p. 107. (Contributed by Jim Kingdon, 25-Mar-2018.)
(DECID φ → ((¬ φψ) → ((φψ) → ψ)))

Theoremjadc 748 Inference forming an implication from the antecedents of two premises, where a decidable antecedent is negated. (Contributed by Jim Kingdon, 25-Mar-2018.)
(DECID φ → (¬ φχ))    &   (ψχ)       (DECID φ → ((φψ) → χ))

Theoremjaddc 749 Deduction forming an implication from the antecedents of two premises, where a decidable antecedent is negated. (Contributed by Jim Kingdon, 26-Mar-2018.)
(φ → (DECID ψ → (¬ ψθ)))    &   (φ → (χθ))       (φ → (DECID ψ → ((ψχ) → θ)))

Theorempm2.61dc 750 Case elimination for a decidable proposition. Based on theorem *2.61 of [WhiteheadRussell] p. 107. (Contributed by Jim Kingdon, 29-Mar-2018.)
(DECID φ → ((φψ) → ((¬ φψ) → ψ)))

Theorempm2.5dc 751 Negating an implication for a decidable antecedent. Based on theorem *2.5 of [WhiteheadRussell] p. 107. (Contributed by Jim Kingdon, 29-Mar-2018.)
(DECID φ → (¬ (φψ) → (¬ φψ)))

Theorempm2.521dc 752 Theorem *2.521 of [WhiteheadRussell] p. 107, but with an additional decidability condition. (Contributed by Jim Kingdon, 5-May-2018.)
(DECID φ → (¬ (φψ) → (ψφ)))

Theoremcon34bdc 753 Contraposition. Theorem *4.1 of [WhiteheadRussell] p. 116, but for a decidable proposition. (Contributed by Jim Kingdon, 24-Apr-2018.)
(DECID ψ → ((φψ) ↔ (¬ ψ → ¬ φ)))

Theoremnotnotdc 754 Double negation equivalence for a decidable proposition. Like Theorem *4.13 of [WhiteheadRussell] p. 117, but with a decidability antecendent. The forward direction, notnot1 547, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 13-Mar-2018.)
(DECID φ → (φ ↔ ¬ ¬ φ))

Theoremcon1biimdc 755 Contraposition. (Contributed by Jim Kingdon, 4-Apr-2018.)
(DECID φ → ((¬ φψ) → (¬ ψφ)))

Theoremcon1bidc 756 Contraposition. (Contributed by Jim Kingdon, 17-Apr-2018.)
(DECID φ → (DECID ψ → ((¬ φψ) ↔ (¬ ψφ))))

Theoremcon2bidc 757 Contraposition. (Contributed by Jim Kingdon, 17-Apr-2018.)
(DECID φ → (DECID ψ → ((φ ↔ ¬ ψ) ↔ (ψ ↔ ¬ φ))))

Theoremcon1biddc 758 A contraposition deduction. (Contributed by Jim Kingdon, 4-Apr-2018.)
(φ → (DECID ψ → (¬ ψχ)))       (φ → (DECID ψ → (¬ χψ)))

Theoremcon1biidc 759 A contraposition inference. (Contributed by Jim Kingdon, 15-Mar-2018.)
(DECID φ → (¬ φψ))       (DECID φ → (¬ ψφ))

Theoremcon1bdc 760 Contraposition. Bidirectional version of con1dc 741. (Contributed by NM, 5-Aug-1993.)
(DECID φ → (DECID ψ → ((¬ φψ) ↔ (¬ ψφ))))

Theoremcon2biidc 761 A contraposition inference. (Contributed by Jim Kingdon, 15-Mar-2018.)
(DECID ψ → (φ ↔ ¬ ψ))       (DECID ψ → (ψ ↔ ¬ φ))

Theoremcon2biddc 762 A contraposition deduction. (Contributed by Jim Kingdon, 11-Apr-2018.)
(φ → (DECID χ → (ψ ↔ ¬ χ)))       (φ → (DECID χ → (χ ↔ ¬ ψ)))

Theoremcondandc 763 Proof by contradiction. This only holds for decidable propositions, as it is part of the family of theorems which assume ¬ ψ, derive a contradiction, and therefore conclude ψ. By contrast, assuming ψ, deriving a contradiction, and therefore concluding ¬ ψ, as in pm2.65 572, is valid for all propositions. (Contributed by Jim Kingdon, 13-May-2018.)
((φ ¬ ψ) → χ)    &   ((φ ¬ ψ) → ¬ χ)       (DECID ψ → (φψ))

Theorembijadc 764 Combine antecedents into a single biconditional. This inference is reminiscent of jadc 748. (Contributed by Jim Kingdon, 4-May-2018.)
(φ → (ψχ))    &   φ → (¬ ψχ))       (DECID ψ → ((φψ) → χ))

Theorempm5.18dc 765 Relationship between an equivalence and an equivalence with some negation, for decidable propositions. Based on theorem *5.18 of [WhiteheadRussell] p. 124. Given decidability, we can consider ¬ (φ ↔ ¬ ψ) to represent "negated exclusive-or". (Contributed by Jim Kingdon, 4-Apr-2018.)
(DECID φ → (DECID ψ → ((φψ) ↔ ¬ (φ ↔ ¬ ψ))))

Theoremdfandc 766 Definition of 'and' in terms of negation and implication, for decidable propositions. The forward direction holds for all propositions, and can (basically) be found at pm3.2im 553. (Contributed by Jim Kingdon, 30-Apr-2018.)
(DECID φ → (DECID ψ → ((φ ψ) ↔ ¬ (φ → ¬ ψ))))

Theorempm2.13dc 767 A decidable proposition or its triple negation is true. Theorem *2.13 of [WhiteheadRussell] p. 101 with decidability condition added. (Contributed by Jim Kingdon, 13-May-2018.)
(DECID φ → (φ ¬ ¬ ¬ φ))

Theorempm4.63dc 768 Theorem *4.63 of [WhiteheadRussell] p. 120, for decidable propositions. (Contributed by Jim Kingdon, 1-May-2018.)
(DECID φ → (DECID ψ → (¬ (φ → ¬ ψ) ↔ (φ ψ))))

Theorempm4.67dc 769 Theorem *4.67 of [WhiteheadRussell] p. 120, for decidable propositions. (Contributed by Jim Kingdon, 1-May-2018.)
(DECID φ → (DECID ψ → (¬ (¬ φ → ¬ ψ) ↔ (¬ φ ψ))))

Theoremannimim 770 Express conjunction in terms of implication. One direction of Theorem *4.61 of [WhiteheadRussell] p. 120. The converse holds for decidable propositions, as can be seen at annimdc 831. (Contributed by Jim Kingdon, 24-Dec-2017.)
((φ ¬ ψ) → ¬ (φψ))

Theorempm4.65r 771 One direction of Theorem *4.65 of [WhiteheadRussell] p. 120. The converse holds in classical logic. (Contributed by Jim Kingdon, 28-Jul-2018.)
((¬ φ ¬ ψ) → ¬ (¬ φψ))

Theoremdcim 772 An implication between two decidable propositions is decidable. (Contributed by Jim Kingdon, 28-Mar-2018.)
(DECID φ → (DECID ψDECID (φψ)))

Theoremimanim 773 Express implication in terms of conjunction. The converse only holds given a decidability condition; see imandc 774. (Contributed by Jim Kingdon, 24-Dec-2017.)
((φψ) → ¬ (φ ¬ ψ))

Theoremimandc 774 Express implication in terms of conjunction. Theorem 3.4(27) of [Stoll] p. 176, with an added decidability condition. The forward direction, imanim 773, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 25-Apr-2018.)
(DECID ψ → ((φψ) ↔ ¬ (φ ¬ ψ)))

Theorempm4.14dc 775 Theorem *4.14 of [WhiteheadRussell] p. 117, given a decidability condition. (Contributed by Jim Kingdon, 24-Apr-2018.)
(DECID χ → (((φ ψ) → χ) ↔ ((φ ¬ χ) → ¬ ψ)))

Theorempm3.37dc 776 Theorem *3.37 (Transp) of [WhiteheadRussell] p. 112, given a decidability condition. (Contributed by Jim Kingdon, 24-Apr-2018.)
(DECID χ → (((φ ψ) → χ) → ((φ ¬ χ) → ¬ ψ)))

Theorempm4.15 777 Theorem *4.15 of [WhiteheadRussell] p. 117. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 18-Nov-2012.)
(((φ ψ) → ¬ χ) ↔ ((ψ χ) → ¬ φ))

Theorempm2.54dc 778 Deriving disjunction from implication for a decidable proposition. Based on theorem *2.54 of [WhiteheadRussell] p. 107. The converse, pm2.53 628, holds whether the proposition is decidable or not. (Contributed by Jim Kingdon, 26-Mar-2018.)
(DECID φ → ((¬ φψ) → (φ ψ)))

Theoremdfordc 779 Definition of 'or' in terms of negation and implication for a decidable proposition. Based on definition of [Margaris] p. 49. One direction, pm2.53 628, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 26-Mar-2018.)
(DECID φ → ((φ ψ) ↔ (¬ φψ)))

Theorempm2.25dc 780 Elimination of disjunction based on a disjunction, for a decidable proposition. Based on theorem *2.25 of [WhiteheadRussell] p. 104. (Contributed by NM, 3-Jan-2005.)
(DECID φ → (φ ((φ ψ) → ψ)))

Theorempm2.68dc 781 Concluding disjunction from implication for a decidable proposition. Based on theorem *2.68 of [WhiteheadRussell] p. 108. Converse of pm2.62 654 and one half of dfor2dc 782. (Contributed by Jim Kingdon, 27-Mar-2018.)
(DECID φ → (((φψ) → ψ) → (φ ψ)))

Theoremdfor2dc 782 Logical 'or' expressed in terms of implication only, for a decidable proposition. Based on theorem *5.25 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 27-Mar-2018.)
(DECID φ → ((φ ψ) ↔ ((φψ) → ψ)))

Theoremimimorbdc 783 Simplify an implication between implications, for a decidable proposition. (Contributed by Jim Kingdon, 18-Mar-2018.)
(DECID ψ → (((ψχ) → (φχ)) ↔ (φ → (ψ χ))))

Theoremimordc 784 Implication in terms of disjunction for a decidable proposition. Based on theorem *4.6 of [WhiteheadRussell] p. 120. The reverse direction, imorr 785, holds for all propositions. (Contributed by Jim Kingdon, 20-Apr-2018.)
(DECID φ → ((φψ) ↔ (¬ φ ψ)))

Theoremimorr 785 Implication in terms of disjunction. One direction of theorem *4.6 of [WhiteheadRussell] p. 120. The converse holds for decidable propositions, as seen at imordc 784. (Contributed by Jim Kingdon, 21-Jul-2018.)
((¬ φ ψ) → (φψ))

Theorempm4.62dc 786 Implication in terms of disjunction. Like Theorem *4.62 of [WhiteheadRussell] p. 120, but for a decidable antecedent. (Contributed by Jim Kingdon, 21-Apr-2018.)
(DECID φ → ((φ → ¬ ψ) ↔ (¬ φ ¬ ψ)))

Theoremianordc 787 Negated conjunction in terms of disjunction (DeMorgan's law). Theorem *4.51 of [WhiteheadRussell] p. 120, but where one proposition is decidable. The reverse direction, pm3.14 657, holds for all propositions, but the equivalence only holds where one proposition is decidable. (Contributed by Jim Kingdon, 21-Apr-2018.)
(DECID φ → (¬ (φ ψ) ↔ (¬ φ ¬ ψ)))

Theoremoibabs 788 Absorption of disjunction into equivalence. (Contributed by NM, 6-Aug-1995.) (Proof shortened by Wolf Lammen, 3-Nov-2013.)
(((φ ψ) → (φψ)) ↔ (φψ))

Theorempm4.64dc 789 Theorem *4.64 of [WhiteheadRussell] p. 120, given a decidability condition. The reverse direction, pm2.53 628, holds for all propositions. (Contributed by Jim Kingdon, 2-May-2018.)
(DECID φ → ((¬ φψ) ↔ (φ ψ)))

Theorempm4.66dc 790 Theorem *4.66 of [WhiteheadRussell] p. 120, given a decidability condition. (Contributed by Jim Kingdon, 2-May-2018.)
(DECID φ → ((¬ φ → ¬ ψ) ↔ (φ ¬ ψ)))

Theorempm4.52im 791 One direction of theorem *4.52 of [WhiteheadRussell] p. 120. The converse also holds in classical logic. (Contributed by Jim Kingdon, 27-Jul-2018.)
((φ ¬ ψ) → ¬ (¬ φ ψ))

Theorempm4.53r 792 One direction of theorem *4.53 of [WhiteheadRussell] p. 120. The converse also holds in classical logic. (Contributed by Jim Kingdon, 27-Jul-2018.)
((¬ φ ψ) → ¬ (φ ¬ ψ))

Theorempm4.54dc 793 Theorem *4.54 of [WhiteheadRussell] p. 120, for decidable propositions. One form of DeMorgan's law. (Contributed by Jim Kingdon, 2-May-2018.)
(DECID φ → (DECID ψ → ((¬ φ ψ) ↔ ¬ (φ ¬ ψ))))

Theorempm4.56 794 Theorem *4.56 of [WhiteheadRussell] p. 120. (Contributed by NM, 3-Jan-2005.)
((¬ φ ¬ ψ) ↔ ¬ (φ ψ))

Theoremoranim 795 Disjunction in terms of conjunction (DeMorgan's law). One direction of Theorem *4.57 of [WhiteheadRussell] p. 120. The converse does not hold intuitionistically but does hold in classical logic. (Contributed by Jim Kingdon, 25-Jul-2018.)
((φ ψ) → ¬ (¬ φ ¬ ψ))

Theorempm4.78i 796 Implication distributes over disjunction. One direction of Theorem *4.78 of [WhiteheadRussell] p. 121. The converse holds in classical logic. (Contributed by Jim Kingdon, 15-Jan-2018.)
(((φψ) (φχ)) → (φ → (ψ χ)))

Theorempm4.79dc 797 Equivalence between a disjunction of two implications, and a conjunction and an implication. Based on theorem *4.79 of [WhiteheadRussell] p. 121 but with additional decidability antecedents. (Contributed by Jim Kingdon, 28-Mar-2018.)
(DECID φ → (DECID ψ → (((ψφ) (χφ)) ↔ ((ψ χ) → φ))))

Theorempm5.17dc 798 Two ways of stating exclusive-or which are equivalent for a decidable proposition. Based on theorem *5.17 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 16-Apr-2018.)
(DECID ψ → (((φ ψ) ¬ (φ ψ)) ↔ (φ ↔ ¬ ψ)))

Theorempm2.85dc 799 Reverse distribution of disjunction over implication, given decidability. Based on theorem *2.85 of [WhiteheadRussell] p. 108. (Contributed by Jim Kingdon, 1-Apr-2018.)
(DECID φ → (((φ ψ) → (φ χ)) → (φ (ψχ))))

Theoremorimdidc 800 Disjunction distributes over implication. The forward direction, pm2.76 708, is valid intuitionistically. The reverse direction holds if φ is decidable, as can be seen at pm2.85dc 799. (Contributed by Jim Kingdon, 1-Apr-2018.)
(DECID φ → ((φ (ψχ)) ↔ ((φ ψ) → (φ χ))))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7354
 Copyright terms: Public domain < Previous  Next >