![]() |
Intuitionistic Logic Explorer Theorem List (p. 14 of 122) | < 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 | nbfal 1301 |
The negation of a proposition is equivalent to itself being equivalent to
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | bitru 1302 | A theorem is equivalent to truth. (Contributed by Mario Carneiro, 9-May-2015.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | bifal 1303 | A contradiction is equivalent to falsehood. (Contributed by Mario Carneiro, 9-May-2015.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falim 1304 |
The truth value ![]() |
![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falimd 1305 |
The truth value ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | a1tru 1306 |
Anything implies ![]() |
![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truan 1307 | True can be removed from a conjunction. (Contributed by FL, 20-Mar-2011.) (Proof shortened by Wolf Lammen, 21-Jul-2019.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | dfnot 1308 |
Given falsum, we can define the negation of a wff ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | inegd 1309 | Negation introduction rule from natural deduction. (Contributed by Mario Carneiro, 9-Feb-2017.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | pm2.21fal 1310 | If a wff and its negation are provable, then falsum is provable. (Contributed by Mario Carneiro, 9-Feb-2017.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | pclem6 1311 | Negation inferred from embedded conjunct. (Contributed by NM, 20-Aug-1993.) (Proof rewritten by Jim Kingdon, 4-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Syntax | wxo 1312 | Extend wff definition to include exclusive disjunction ('xor'). |
![]() ![]() ![]() ![]() ![]() ![]() | ||
Definition | df-xor 1313 |
Define exclusive disjunction (logical 'xor'). Return true if either the
left or right, but not both, are true. Contrast with ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xoranor 1314 | One way of defining exclusive or. Equivalent to df-xor 1313. (Contributed by Jim Kingdon and Mario Carneiro, 1-Mar-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | excxor 1315 | This tautology shows that xor is really exclusive. (Contributed by FL, 22-Nov-2010.) (Proof rewritten by Jim Kingdon, 5-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xoror 1316 | XOR implies OR. (Contributed by BJ, 19-Apr-2019.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xorbi2d 1317 | Deduction joining an equivalence and a left operand to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xorbi1d 1318 | Deduction joining an equivalence and a right operand to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xorbi12d 1319 | Deduction joining two equivalences to form equivalence of exclusive-or. (Contributed by Jim Kingdon, 7-Oct-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xorbi12i 1320 | Equality property for XOR. (Contributed by Mario Carneiro, 4-Sep-2016.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xorbin 1321 | A consequence of exclusive or. In classical logic the converse also holds. (Contributed by Jim Kingdon, 8-Mar-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | pm5.18im 1322 | One direction of pm5.18dc 816, which holds for all propositions, not just decidable propositions. (Contributed by Jim Kingdon, 10-Mar-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xornbi 1323 | A consequence of exclusive or. For decidable propositions this is an equivalence, as seen at xornbidc 1328. (Contributed by Jim Kingdon, 10-Mar-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xor3dc 1324 | Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 12-Apr-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xorcom 1325 |
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | pm5.15dc 1326 | A decidable proposition is equivalent to a decidable proposition or its negation. Based on theorem *5.15 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 18-Apr-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xor2dc 1327 | Two ways to express "exclusive or" between decidable propositions. (Contributed by Jim Kingdon, 17-Apr-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xornbidc 1328 | Exclusive or is equivalent to negated biconditional for decidable propositions. (Contributed by Jim Kingdon, 27-Apr-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xordc 1329 | Two ways to express "exclusive or" between decidable propositions. Theorem *5.22 of [WhiteheadRussell] p. 124, but for decidable propositions. (Contributed by Jim Kingdon, 5-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xordc1 1330 | Exclusive or implies the left proposition is decidable. (Contributed by Jim Kingdon, 12-Mar-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | nbbndc 1331 | Move negation outside of biconditional, for decidable propositions. Compare Theorem *5.18 of [WhiteheadRussell] p. 124. (Contributed by Jim Kingdon, 18-Apr-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | biassdc 1332 |
Associative law for the biconditional, for decidable propositions.
The classical version (without the decidability conditions) is an axiom of system DS in Vladimir Lifschitz, "On calculational proofs", Annals of Pure and Applied Logic, 113:207-224, 2002, http://www.cs.utexas.edu/users/ai-lab/pub-view.php?PubID=26805, and, interestingly, was not included in Principia Mathematica but was apparently first noted by Jan Lukasiewicz circa 1923. (Contributed by Jim Kingdon, 4-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | bilukdc 1333 | Lukasiewicz's shortest axiom for equivalential calculus (but modified to require decidable propositions). Storrs McCall, ed., Polish Logic 1920-1939 (Oxford, 1967), p. 96. (Contributed by Jim Kingdon, 5-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | dfbi3dc 1334 | An alternate definition of the biconditional for decidable propositions. Theorem *5.23 of [WhiteheadRussell] p. 124, but with decidability conditions. (Contributed by Jim Kingdon, 5-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | pm5.24dc 1335 | Theorem *5.24 of [WhiteheadRussell] p. 124, but for decidable propositions. (Contributed by Jim Kingdon, 5-May-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | xordidc 1336 | Conjunction distributes over exclusive-or, for decidable propositions. This is one way to interpret the distributive law of multiplication over addition in modulo 2 arithmetic. (Contributed by Jim Kingdon, 14-Jul-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | anxordi 1337 | Conjunction distributes over exclusive-or. (Contributed by Mario Carneiro and Jim Kingdon, 7-Oct-2018.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
For classical logic, truth tables can be used to define propositional
logic operations, by showing the results of those operations for all
possible combinations of true (
Although the intuitionistic logic connectives are not as simply defined,
Here we show that our definitions and axioms produce equivalent results for
| ||
Theorem | truantru 1338 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truanfal 1339 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falantru 1340 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falanfal 1341 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truortru 1342 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truorfal 1343 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falortru 1344 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falorfal 1345 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truimtru 1346 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truimfal 1347 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falimtru 1348 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falimfal 1349 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | nottru 1350 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | notfal 1351 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | trubitru 1352 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | trubifal 1353 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falbitru 1354 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falbifal 1355 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truxortru 1356 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | truxorfal 1357 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falxortru 1358 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | falxorfal 1359 |
A ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
The Greek Stoics developed a system of logic. The Stoic Chrysippus, in particular, was often considered one of the greatest logicians of antiquity. Stoic logic is different from Aristotle's system, since it focuses on propositional logic, though later thinkers did combine the systems of the Stoics with Aristotle. Jan Lukasiewicz reports, "For anybody familiar with mathematical logic it is self-evident that the Stoic dialectic is the ancient form of modern propositional logic" ( On the history of the logic of proposition by Jan Lukasiewicz (1934), translated in: Selected Works - Edited by Ludwik Borkowski - Amsterdam, North-Holland, 1970 pp. 197-217, referenced in "History of Logic" https://www.historyoflogic.com/logic-stoics.htm). For more about Aristotle's system, see barbara and related theorems. A key part of the Stoic logic system is a set of five "indemonstrables" assigned to Chrysippus of Soli by Diogenes Laertius, though in general it is difficult to assign specific ideas to specific thinkers. The indemonstrables are described in, for example, [Lopez-Astorga] p. 11 , [Sanford] p. 39, and [Hitchcock] p. 5. These indemonstrables are modus ponendo ponens (modus ponens) ax-mp 7, modus tollendo tollens (modus tollens) mto 624, modus ponendo tollens I mptnan 1360, modus ponendo tollens II mptxor 1361, and modus tollendo ponens (exclusive-or version) mtpxor 1363. The first is an axiom, the second is already proved; in this section we prove the other three. Since we assume or prove all of indemonstrables, the system of logic we use here is as at least as strong as the set of Stoic indemonstrables. Note that modus tollendo ponens mtpxor 1363 originally used exclusive-or, but over time the name modus tollendo ponens has increasingly referred to an inclusive-or variation, which is proved in mtpor 1362. This set of indemonstrables is not the entire system of Stoic logic. | ||
Theorem | mptnan 1360 | Modus ponendo tollens 1, one of the "indemonstrables" in Stoic logic. See rule 1 on [Lopez-Astorga] p. 12 , rule 1 on [Sanford] p. 40, and rule A3 in [Hitchcock] p. 5. Sanford describes this rule second (after mptxor 1361) as a "safer, and these days much more common" version of modus ponendo tollens because it avoids confusion between inclusive-or and exclusive-or. (Contributed by David A. Wheeler, 3-Jul-2016.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mptxor 1361 |
Modus ponendo tollens 2, one of the "indemonstrables" in Stoic logic.
Note that this uses exclusive-or ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mtpor 1362 |
Modus tollendo ponens (inclusive-or version), aka disjunctive syllogism.
This is similar to mtpxor 1363, one of the five original
"indemonstrables"
in Stoic logic. However, in Stoic logic this rule used exclusive-or,
while the name modus tollendo ponens often refers to a variant of the
rule that uses inclusive-or instead. The rule says, "if ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mtpxor 1363 |
Modus tollendo ponens (original exclusive-or version), aka disjunctive
syllogism, similar to mtpor 1362, one of the five "indemonstrables"
in
Stoic logic. The rule says, "if ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | stoic2a 1364 |
Stoic logic Thema 2 version a.
Statement T2 of [Bobzien] p. 117 shows a reconstructed version of Stoic logic thema 2 as follows: "When from two assertibles a third follows, and from the third and one (or both) of the two another follows, then this other follows from the first two."
Bobzien uses constructs such as This version a is without the phrase "or both"; see stoic2b 1365 for the version with the phrase "or both". We already have this rule as syldan 277, so here we show the equivalence and discourage its use. (New usage is discouraged.) (Contributed by David A. Wheeler, 17-Feb-2019.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | stoic2b 1365 |
Stoic logic Thema 2 version b. See stoic2a 1364.
Version b is with the phrase "or both". We already have this rule as mpd3an3 1275, so here we prove the equivalence and discourage its use. (New usage is discouraged.) (Contributed by David A. Wheeler, 17-Feb-2019.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | stoic3 1366 |
Stoic logic Thema 3.
Statement T3 of [Bobzien] p. 116-117 discusses Stoic logic thema 3. "When from two (assemblies) a third follows, and from the one that follows (i.e., the third) together with another, external external assumption, another follows, then other follows from the first two and the externally co-assumed one. (Simp. Cael. 237.2-4)" (Contributed by David A. Wheeler, 17-Feb-2019.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | stoic4a 1367 |
Stoic logic Thema 4 version a.
Statement T4 of [Bobzien] p. 117 shows a reconstructed version of Stoic logic thema 4: "When from two assertibles a third follows, and from the third and one (or both) of the two and one (or more) external assertible(s) another follows, then this other follows from the first two and the external(s)."
We use |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | stoic4b 1368 |
Stoic logic Thema 4 version b.
This is version b, which is with the phrase "or both". See stoic4a 1367 for more information. (Contributed by David A. Wheeler, 17-Feb-2019.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | syl6an 1369 | A syllogism deduction combined with conjoining antecedents. (Contributed by Alan Sare, 28-Oct-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | syl10 1370 | A nested syllogism inference. (Contributed by Alan Sare, 17-Jul-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | exbir 1371 | Exportation implication also converting head from biconditional to conditional. (Contributed by Alan Sare, 31-Dec-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | 3impexp 1372 | impexp 260 with a 3-conjunct antecedent. (Contributed by Alan Sare, 31-Dec-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | 3impexpbicom 1373 | 3impexp 1372 with biconditional consequent of antecedent that is commuted in consequent. (Contributed by Alan Sare, 31-Dec-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | 3impexpbicomi 1374 | Deduction form of 3impexpbicom 1373. (Contributed by Alan Sare, 31-Dec-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | ancomsimp 1375 | Closed form of ancoms 265. (Contributed by Alan Sare, 31-Dec-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | expcomd 1376 | Deduction form of expcom 115. (Contributed by Alan Sare, 22-Jul-2012.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | expdcom 1377 | Commuted form of expd 255. (Contributed by Alan Sare, 18-Mar-2012.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | simplbi2comg 1378 | Implication form of simplbi2com 1379. (Contributed by Alan Sare, 22-Jul-2012.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | simplbi2com 1379 | A deduction eliminating a conjunct, similar to simplbi2 378. (Contributed by Alan Sare, 22-Jul-2012.) (Proof shortened by Wolf Lammen, 10-Nov-2012.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | syl6ci 1380 | A syllogism inference combined with contraction. (Contributed by Alan Sare, 18-Mar-2012.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mpisyl 1381 | A syllogism combined with a modus ponens inference. (Contributed by Alan Sare, 25-Jul-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
The universal quantifier was introduced above in wal 1288 for use by df-tru 1293. See the comments in that section. In this section, we continue with the first "real" use of it. | ||
Axiom | ax-5 1382 | Axiom of Quantified Implication. Axiom C4 of [Monk2] p. 105. (Contributed by NM, 5-Aug-1993.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Axiom | ax-7 1383 | Axiom of Quantifier Commutation. This axiom says universal quantifiers can be swapped. One of the predicate logic axioms which do not involve equality. Axiom scheme C6' in [Megill] p. 448 (p. 16 of the preprint). Also appears as Lemma 12 of [Monk2] p. 109 and Axiom C5-3 of [Monk2] p. 113. (Contributed by NM, 5-Aug-1993.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Axiom | ax-gen 1384 |
Rule of Generalization. The postulated inference rule of predicate
calculus. See e.g. Rule 2 of [Hamilton] p. 74. This rule says that if
something is unconditionally true, then it is true for all values of a
variable. For example, if we have proved ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | gen2 1385 | Generalization applied twice. (Contributed by NM, 30-Apr-1998.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mpg 1386 | Modus ponens combined with generalization. (Contributed by NM, 24-May-1994.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mpgbi 1387 | Modus ponens on biconditional combined with generalization. (Contributed by NM, 24-May-1994.) (Proof shortened by Stefan Allan, 28-Oct-2008.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | mpgbir 1388 | Modus ponens on biconditional combined with generalization. (Contributed by NM, 24-May-1994.) (Proof shortened by Stefan Allan, 28-Oct-2008.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | a7s 1389 | Swap quantifiers in an antecedent. (Contributed by NM, 5-Aug-1993.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | alimi 1390 | Inference quantifying both antecedent and consequent. (Contributed by NM, 5-Aug-1993.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | 2alimi 1391 | Inference doubly quantifying both antecedent and consequent. (Contributed by NM, 3-Feb-2005.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | alim 1392 | Theorem 19.20 of [Margaris] p. 90. (Contributed by NM, 5-Aug-1993.) (Proof shortened by O'Cat, 30-Mar-2008.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | al2imi 1393 | Inference quantifying antecedent, nested antecedent, and consequent. (Contributed by NM, 5-Aug-1993.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | alanimi 1394 | Variant of al2imi 1393 with conjunctive antecedent. (Contributed by Andrew Salmon, 8-Jun-2011.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Syntax | wnf 1395 | Extend wff definition to include the not-free predicate. |
![]() ![]() ![]() ![]() | ||
Definition | df-nf 1396 |
Define the not-free predicate for wffs. This is read "![]() ![]() ![]() ![]() ![]() ![]() Not-free is a commonly used constraint, so it is useful to have a notation for it. Surprisingly, there is no common formal notation for it, so here we devise one. Our definition lets us work with the not-free notion within the logic itself rather than as a metalogical side condition.
To be precise, our definition really means "effectively not
free," because
it is slightly less restrictive than the usual textbook definition for
not-free (which only considers syntactic freedom). For example, |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | nfi 1397 |
Deduce that ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | hbth 1398 |
No variable is (effectively) free in a theorem.
This and later "hypothesis-building" lemmas, with labels
starting
"hb...", allow us to construct proofs of formulas of the form
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | nfth 1399 | No variable is (effectively) free in a theorem. (Contributed by Mario Carneiro, 11-Aug-2016.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() | ||
Theorem | nfnth 1400 | No variable is (effectively) free in a non-theorem. (Contributed by Mario Carneiro, 6-Dec-2016.) |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |