Home | Intuitionistic Logic Explorer Theorem List (p. 9 of 95) | < Previous Next > |
Browser slow? Try the
Unicode version. |
||
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | pm4.66dc 801 | Theorem *4.66 of [WhiteheadRussell] p. 120, given a decidability condition. (Contributed by Jim Kingdon, 2-May-2018.) |
DECID | ||
Theorem | pm4.52im 802 | One direction of theorem *4.52 of [WhiteheadRussell] p. 120. The converse also holds in classical logic. (Contributed by Jim Kingdon, 27-Jul-2018.) |
Theorem | pm4.53r 803 | One direction of theorem *4.53 of [WhiteheadRussell] p. 120. The converse also holds in classical logic. (Contributed by Jim Kingdon, 27-Jul-2018.) |
Theorem | pm4.54dc 804 | 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 | ||
Theorem | pm4.56 805 | Theorem *4.56 of [WhiteheadRussell] p. 120. (Contributed by NM, 3-Jan-2005.) |
Theorem | oranim 806 | 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.) |
Theorem | pm4.78i 807 | 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.) |
Theorem | pm4.79dc 808 | 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 | ||
Theorem | pm5.17dc 809 | 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 | ||
Theorem | pm2.85dc 810 | 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 | ||
Theorem | orimdidc 811 | Disjunction distributes over implication. The forward direction, pm2.76 720, is valid intuitionistically. The reverse direction holds if is decidable, as can be seen at pm2.85dc 810. (Contributed by Jim Kingdon, 1-Apr-2018.) |
DECID | ||
Theorem | pm2.26dc 812 | Decidable proposition version of theorem *2.26 of [WhiteheadRussell] p. 104. (Contributed by Jim Kingdon, 20-Apr-2018.) |
DECID | ||
Theorem | pm4.81dc 813 | Theorem *4.81 of [WhiteheadRussell] p. 122, for decidable propositions. This one needs a decidability condition, but compare with pm4.8 622 which holds for all propositions. (Contributed by Jim Kingdon, 4-Jul-2018.) |
DECID | ||
Theorem | pm5.11dc 814 | A decidable proposition or its negation implies a second proposition. Based on theorem *5.11 of [WhiteheadRussell] p. 123. (Contributed by Jim Kingdon, 29-Mar-2018.) |
DECID DECID | ||
Theorem | pm5.12dc 815 | Excluded middle with antecedents for a decidable consequent. Based on theorem *5.12 of [WhiteheadRussell] p. 123. (Contributed by Jim Kingdon, 30-Mar-2018.) |
DECID | ||
Theorem | pm5.14dc 816 | A decidable proposition is implied by or implies other propositions. Based on theorem *5.14 of [WhiteheadRussell] p. 123. (Contributed by Jim Kingdon, 30-Mar-2018.) |
DECID | ||
Theorem | pm5.13dc 817 | An implication holds in at least one direction, where one proposition is decidable. Based on theorem *5.13 of [WhiteheadRussell] p. 123. (Contributed by Jim Kingdon, 30-Mar-2018.) |
DECID | ||
Theorem | pm5.55dc 818 | A disjunction is equivalent to one of its disjuncts, given a decidable disjunct. Based on theorem *5.55 of [WhiteheadRussell] p. 125. (Contributed by Jim Kingdon, 30-Mar-2018.) |
DECID | ||
Theorem | peircedc 819 | Peirce's theorem for a decidable proposition. This odd-looking theorem can be seen as an alternative to exmiddc 743, condc 748, or notnotdc 765 in the sense of expressing the "difference" between an intuitionistic system of propositional calculus and a classical system. In intuitionistic logic, it only holds for decidable propositions. (Contributed by Jim Kingdon, 3-Jul-2018.) |
DECID | ||
Theorem | looinvdc 820 | The Inversion Axiom of the infinite-valued sentential logic (L-infinity) of Lukasiewicz, but where one of the propositions is decidable. Using dfor2dc 793, we can see that this expresses "disjunction commutes." Theorem *2.69 of [WhiteheadRussell] p. 108 (plus the decidability condition). (Contributed by NM, 12-Aug-2004.) |
DECID | ||
Theorem | dftest 821 |
A proposition is testable iff its negative or double-negative is true.
See Chapter 2 [Moschovakis] p. 2.
Our notation for testability is DECID before the formula in question. For example, DECID corresponds to "x = y is testable". (Contributed by David A. Wheeler, 13-Aug-2018.) |
DECID | ||
Theorem | testbitestn 822 | A proposition is testable iff its negation is testable. See also dcn 745 (which could be read as "Decidability implies testability"). (Contributed by David A. Wheeler, 6-Dec-2018.) |
DECID DECID | ||
Theorem | stabtestimpdc 823 | "Stable and testable" is equivalent to decidable. (Contributed by David A. Wheeler, 13-Aug-2018.) |
STAB DECID DECID | ||
Theorem | pm5.21nd 824 | Eliminate an antecedent implied by each side of a biconditional. (Contributed by NM, 20-Nov-2005.) (Proof shortened by Wolf Lammen, 4-Nov-2013.) |
Theorem | pm5.35 825 | Theorem *5.35 of [WhiteheadRussell] p. 125. (Contributed by NM, 3-Jan-2005.) |
Theorem | pm5.54dc 826 | A conjunction is equivalent to one of its conjuncts, given a decidable conjunct. Based on theorem *5.54 of [WhiteheadRussell] p. 125. (Contributed by Jim Kingdon, 30-Mar-2018.) |
DECID | ||
Theorem | baib 827 | Move conjunction outside of biconditional. (Contributed by NM, 13-May-1999.) |
Theorem | baibr 828 | Move conjunction outside of biconditional. (Contributed by NM, 11-Jul-1994.) |
Theorem | rbaib 829 | Move conjunction outside of biconditional. (Contributed by Mario Carneiro, 11-Sep-2015.) |
Theorem | rbaibr 830 | Move conjunction outside of biconditional. (Contributed by Mario Carneiro, 11-Sep-2015.) |
Theorem | baibd 831 | Move conjunction outside of biconditional. (Contributed by Mario Carneiro, 11-Sep-2015.) |
Theorem | rbaibd 832 | Move conjunction outside of biconditional. (Contributed by Mario Carneiro, 11-Sep-2015.) |
Theorem | pm5.44 833 | Theorem *5.44 of [WhiteheadRussell] p. 125. (Contributed by NM, 3-Jan-2005.) |
Theorem | pm5.6dc 834 | Conjunction in antecedent versus disjunction in consequent, for a decidable proposition. Theorem *5.6 of [WhiteheadRussell] p. 125, with decidability condition added. The reverse implication holds for all propositions (see pm5.6r 835). (Contributed by Jim Kingdon, 2-Apr-2018.) |
DECID | ||
Theorem | pm5.6r 835 | Conjunction in antecedent versus disjunction in consequent. One direction of Theorem *5.6 of [WhiteheadRussell] p. 125. If is decidable, the converse also holds (see pm5.6dc 834). (Contributed by Jim Kingdon, 4-Aug-2018.) |
Theorem | orcanai 836 | Change disjunction in consequent to conjunction in antecedent. (Contributed by NM, 8-Jun-1994.) |
Theorem | intnan 837 | Introduction of conjunct inside of a contradiction. (Contributed by NM, 16-Sep-1993.) |
Theorem | intnanr 838 | Introduction of conjunct inside of a contradiction. (Contributed by NM, 3-Apr-1995.) |
Theorem | intnand 839 | Introduction of conjunct inside of a contradiction. (Contributed by NM, 10-Jul-2005.) |
Theorem | intnanrd 840 | Introduction of conjunct inside of a contradiction. (Contributed by NM, 10-Jul-2005.) |
Theorem | dcan 841 | A conjunction of two decidable propositions is decidable. (Contributed by Jim Kingdon, 12-Apr-2018.) |
DECID DECID DECID | ||
Theorem | dcor 842 | A disjunction of two decidable propositions is decidable. (Contributed by Jim Kingdon, 21-Apr-2018.) |
DECID DECID DECID | ||
Theorem | dcbi 843 | An equivalence of two decidable propositions is decidable. (Contributed by Jim Kingdon, 12-Apr-2018.) |
DECID DECID DECID | ||
Theorem | annimdc 844 | Express conjunction in terms of implication. The forward direction, annimim 781, is valid for all propositions, but as an equivalence, it requires a decidability condition. (Contributed by Jim Kingdon, 25-Apr-2018.) |
DECID DECID | ||
Theorem | pm4.55dc 845 | Theorem *4.55 of [WhiteheadRussell] p. 120, for decidable propositions. (Contributed by Jim Kingdon, 2-May-2018.) |
DECID DECID | ||
Theorem | mpbiran 846 | Detach truth from conjunction in biconditional. (Contributed by NM, 27-Feb-1996.) (Revised by NM, 9-Jan-2015.) |
Theorem | mpbiran2 847 | Detach truth from conjunction in biconditional. (Contributed by NM, 22-Feb-1996.) (Revised by NM, 9-Jan-2015.) |
Theorem | mpbir2an 848 | Detach a conjunction of truths in a biconditional. (Contributed by NM, 10-May-2005.) (Revised by NM, 9-Jan-2015.) |
Theorem | mpbi2and 849 | Detach a conjunction of truths in a biconditional. (Contributed by NM, 6-Nov-2011.) (Proof shortened by Wolf Lammen, 24-Nov-2012.) |
Theorem | mpbir2and 850 | Detach a conjunction of truths in a biconditional. (Contributed by NM, 6-Nov-2011.) (Proof shortened by Wolf Lammen, 24-Nov-2012.) |
Theorem | pm5.62dc 851 | Theorem *5.62 of [WhiteheadRussell] p. 125, for a decidable proposition. (Contributed by Jim Kingdon, 12-May-2018.) |
DECID | ||
Theorem | pm5.63dc 852 | Theorem *5.63 of [WhiteheadRussell] p. 125, for a decidable proposition. (Contributed by Jim Kingdon, 12-May-2018.) |
DECID | ||
Theorem | bianfi 853 | A wff conjoined with falsehood is false. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 26-Nov-2012.) |
Theorem | bianfd 854 | A wff conjoined with falsehood is false. (Contributed by NM, 27-Mar-1995.) (Proof shortened by Wolf Lammen, 5-Nov-2013.) |
Theorem | pm4.43 855 | Theorem *4.43 of [WhiteheadRussell] p. 119. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Wolf Lammen, 26-Nov-2012.) |
Theorem | pm4.82 856 | Theorem *4.82 of [WhiteheadRussell] p. 122. (Contributed by NM, 3-Jan-2005.) |
Theorem | pm4.83dc 857 | Theorem *4.83 of [WhiteheadRussell] p. 122, for decidable propositions. As with other case elimination theorems, like pm2.61dc 761, it only holds for decidable propositions. (Contributed by Jim Kingdon, 12-May-2018.) |
DECID | ||
Theorem | biantr 858 | A transitive law of equivalence. Compare Theorem *4.22 of [WhiteheadRussell] p. 117. (Contributed by NM, 18-Aug-1993.) |
Theorem | orbididc 859 | Disjunction distributes over the biconditional, for a decidable proposition. Based on an axiom of system DS in Vladimir Lifschitz, "On calculational proofs" (1998), http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3384. (Contributed by Jim Kingdon, 2-Apr-2018.) |
DECID | ||
Theorem | pm5.7dc 860 | Disjunction distributes over the biconditional, for a decidable proposition. Based on theorem *5.7 of [WhiteheadRussell] p. 125. This theorem is similar to orbididc 859. (Contributed by Jim Kingdon, 2-Apr-2018.) |
DECID | ||
Theorem | bigolden 861 | Dijkstra-Scholten's Golden Rule for calculational proofs. (Contributed by NM, 10-Jan-2005.) |
Theorem | anordc 862 | Conjunction in terms of disjunction (DeMorgan's law). Theorem *4.5 of [WhiteheadRussell] p. 120, but where the propositions are decidable. The forward direction, pm3.1 670, holds for all propositions, but the equivalence only holds given decidability. (Contributed by Jim Kingdon, 21-Apr-2018.) |
DECID DECID | ||
Theorem | pm3.11dc 863 | Theorem *3.11 of [WhiteheadRussell] p. 111, but for decidable propositions. The converse, pm3.1 670, holds for all propositions, not just decidable ones. (Contributed by Jim Kingdon, 22-Apr-2018.) |
DECID DECID | ||
Theorem | pm3.12dc 864 | Theorem *3.12 of [WhiteheadRussell] p. 111, but for decidable propositions. (Contributed by Jim Kingdon, 22-Apr-2018.) |
DECID DECID | ||
Theorem | pm3.13dc 865 | Theorem *3.13 of [WhiteheadRussell] p. 111, but for decidable propositions. The converse, pm3.14 669, holds for all propositions. (Contributed by Jim Kingdon, 22-Apr-2018.) |
DECID DECID | ||
Theorem | dn1dc 866 | DN_{1} for decidable propositions. Without the decidability conditions, DN_{1} can serve as a single axiom for Boolean algebra. See http://www-unix.mcs.anl.gov/~mccune/papers/basax/v12.pdf. (Contributed by Jim Kingdon, 22-Apr-2018.) |
DECID DECID DECID DECID | ||
Theorem | pm5.71dc 867 | Decidable proposition version of theorem *5.71 of [WhiteheadRussell] p. 125. (Contributed by Roy F. Longton, 23-Jun-2005.) (Modified for decidability by Jim Kingdon, 19-Apr-2018.) |
DECID | ||
Theorem | pm5.75 868 | Theorem *5.75 of [WhiteheadRussell] p. 126. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Andrew Salmon, 7-May-2011.) (Proof shortened by Wolf Lammen, 23-Dec-2012.) |
Theorem | bimsc1 869 | Removal of conjunct from one side of an equivalence. (Contributed by NM, 5-Aug-1993.) |
Theorem | ccase 870 | Inference for combining cases. (Contributed by NM, 29-Jul-1999.) (Proof shortened by Wolf Lammen, 6-Jan-2013.) |
Theorem | ccased 871 | Deduction for combining cases. (Contributed by NM, 9-May-2004.) |
Theorem | ccase2 872 | Inference for combining cases. (Contributed by NM, 29-Jul-1999.) |
Theorem | niabn 873 | Miscellaneous inference relating falsehoods. (Contributed by NM, 31-Mar-1994.) |
Theorem | dedlem0a 874 | Alternate version of dedlema 875. (Contributed by NM, 2-Apr-1994.) (Proof shortened by Andrew Salmon, 7-May-2011.) (Proof shortened by Wolf Lammen, 4-Dec-2012.) |
Theorem | dedlema 875 | Lemma for iftrue 3330. (Contributed by NM, 26-Jun-2002.) (Proof shortened by Andrew Salmon, 7-May-2011.) |
Theorem | dedlemb 876 | Lemma for iffalse 3333. (Contributed by NM, 15-May-1999.) (Proof shortened by Andrew Salmon, 7-May-2011.) |
Theorem | pm4.42r 877 | One direction of Theorem *4.42 of [WhiteheadRussell] p. 119. (Contributed by Jim Kingdon, 4-Aug-2018.) |
Theorem | ninba 878 | Miscellaneous inference relating falsehoods. (Contributed by NM, 31-Mar-1994.) |
Theorem | prlem1 879 | A specialized lemma for set theory (to derive the Axiom of Pairing). (Contributed by NM, 18-Oct-1995.) (Proof shortened by Andrew Salmon, 13-May-2011.) (Proof shortened by Wolf Lammen, 5-Jan-2013.) |
Theorem | prlem2 880 | A specialized lemma for set theory (to derive the Axiom of Pairing). (Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon, 13-May-2011.) (Proof shortened by Wolf Lammen, 9-Dec-2012.) |
Theorem | oplem1 881 | A specialized lemma for set theory (ordered pair theorem). (Contributed by NM, 18-Oct-1995.) (Proof shortened by Wolf Lammen, 8-Dec-2012.) (Proof shortened by Mario Carneiro, 2-Feb-2015.) |
Theorem | rnlem 882 | Lemma used in construction of real numbers. (Contributed by NM, 4-Sep-1995.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
Syntax | w3o 883 | Extend wff definition to include 3-way disjunction ('or'). |
Syntax | w3a 884 | Extend wff definition to include 3-way conjunction ('and'). |
Definition | df-3or 885 | Define disjunction ('or') of 3 wff's. Definition *2.33 of [WhiteheadRussell] p. 105. This abbreviation reduces the number of parentheses and emphasizes that the order of bracketing is not important by virtue of the associative law orass 683. (Contributed by NM, 8-Apr-1994.) |
Definition | df-3an 886 | Define conjunction ('and') of 3 wff.s. Definition *4.34 of [WhiteheadRussell] p. 118. This abbreviation reduces the number of parentheses and emphasizes that the order of bracketing is not important by virtue of the associative law anass 381. (Contributed by NM, 8-Apr-1994.) |
Theorem | 3orass 887 | Associative law for triple disjunction. (Contributed by NM, 8-Apr-1994.) |
Theorem | 3anass 888 | Associative law for triple conjunction. (Contributed by NM, 8-Apr-1994.) |
Theorem | 3anrot 889 | Rotation law for triple conjunction. (Contributed by NM, 8-Apr-1994.) |
Theorem | 3orrot 890 | Rotation law for triple disjunction. (Contributed by NM, 4-Apr-1995.) |
Theorem | 3ancoma 891 | Commutation law for triple conjunction. (Contributed by NM, 21-Apr-1994.) |
Theorem | 3ancomb 892 | Commutation law for triple conjunction. (Contributed by NM, 21-Apr-1994.) |
Theorem | 3orcomb 893 | Commutation law for triple disjunction. (Contributed by Scott Fenton, 20-Apr-2011.) |
Theorem | 3anrev 894 | Reversal law for triple conjunction. (Contributed by NM, 21-Apr-1994.) |
Theorem | 3anan32 895 | Convert triple conjunction to conjunction, then commute. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) |
Theorem | 3anan12 896 | Convert triple conjunction to conjunction, then commute. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Andrew Salmon, 14-Jun-2011.) |
Theorem | anandi3 897 | Distribution of triple conjunction over conjunction. (Contributed by David A. Wheeler, 4-Nov-2018.) |
Theorem | anandi3r 898 | Distribution of triple conjunction over conjunction. (Contributed by David A. Wheeler, 4-Nov-2018.) |
Theorem | 3ioran 899 | Negated triple disjunction as triple conjunction. (Contributed by Scott Fenton, 19-Apr-2011.) |
Theorem | 3simpa 900 | Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |