![]() |
Intuitionistic Logic Explorer Theorem List (p. 148 of 148) | < Previous Wrap > |
Bad symbols? Try the
GIF version. |
||
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | inffz 14701 | The infimum of a finite sequence of integers. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Jim Kingdon, 15-Oct-2022.) |
โข (๐ โ (โคโฅโ๐) โ inf((๐...๐), โค, < ) = ๐) | ||
Theorem | taupi 14702 | Relationship between ฯ and ฯ. This can be seen as connecting the ratio of a circle's circumference to its radius and the ratio of a circle's circumference to its diameter. (Contributed by Jim Kingdon, 19-Feb-2019.) (Revised by AV, 1-Oct-2020.) |
โข ฯ = (2 ยท ฯ) | ||
Theorem | ax1hfs 14703 | Heyting's formal system Axiom #1 from [Heyting] p. 127. (Contributed by MM, 11-Aug-2018.) |
โข (๐ โ (๐ โง ๐)) | ||
Theorem | dftest 14704 |
A proposition is testable iff its negative or double-negative is true.
See Chapter 2 [Moschovakis] p. 2.
We do not formally define testability with a new token, but instead use DECID ยฌ before the formula in question. For example, DECID ยฌ ๐ฅ = ๐ฆ corresponds to "๐ฅ = ๐ฆ is testable". (Contributed by David A. Wheeler, 13-Aug-2018.) For statements about testable propositions, search for the keyword "testable" in the comments of statements, for instance using the Metamath command "MM> SEARCH * "testable" / COMMENTS". (New usage is discouraged.) |
โข (DECID ยฌ ๐ โ (ยฌ ๐ โจ ยฌ ยฌ ๐)) | ||
These are definitions and proofs involving an experimental "allsome" quantifier (aka "all some"). In informal language, statements like "All Martians are green" imply that there is at least one Martian. But it's easy to mistranslate informal language into formal notations because similar statements like โ๐ฅ๐ โ ๐ do not imply that ๐ is ever true, leading to vacuous truths. Some systems include a mechanism to counter this, e.g., PVS allows types to be appended with "+" to declare that they are nonempty. This section presents a different solution to the same problem. The "allsome" quantifier expressly includes the notion of both "all" and "there exists at least one" (aka some), and is defined to make it easier to more directly express both notions. The hope is that if a quantifier more directly expresses this concept, it will be used instead and reduce the risk of creating formal expressions that look okay but in fact are mistranslations. The term "allsome" was chosen because it's short, easy to say, and clearly hints at the two concepts it combines. I do not expect this to be used much in metamath, because in metamath there's a general policy of avoiding the use of new definitions unless there are very strong reasons to do so. Instead, my goal is to rigorously define this quantifier and demonstrate a few basic properties of it. The syntax allows two forms that look like they would be problematic, but they are fine. When applied to a top-level implication we allow โ!๐ฅ(๐ โ ๐), and when restricted (applied to a class) we allow โ!๐ฅ โ ๐ด๐. The first symbol after the setvar variable must always be โ if it is the form applied to a class, and since โ cannot begin a wff, it is unambiguous. The โ looks like it would be a problem because ๐ or ๐ might include implications, but any implication arrow โ within any wff must be surrounded by parentheses, so only the implication arrow of โ! can follow the wff. The implication syntax would work fine without the parentheses, but I added the parentheses because it makes things clearer inside larger complex expressions, and it's also more consistent with the rest of the syntax. For more, see "The Allsome Quantifier" by David A. Wheeler at https://dwheeler.com/essays/allsome.html I hope that others will eventually agree that allsome is awesome. | ||
Syntax | walsi 14705 | Extend wff definition to include "all some" applied to a top-level implication, which means ๐ is true whenever ๐ is true, and there is at least least one ๐ฅ where ๐ is true. (Contributed by David A. Wheeler, 20-Oct-2018.) |
wff โ!๐ฅ(๐ โ ๐) | ||
Syntax | walsc 14706 | Extend wff definition to include "all some" applied to a class, which means ๐ is true for all ๐ฅ in ๐ด, and there is at least one ๐ฅ in ๐ด. (Contributed by David A. Wheeler, 20-Oct-2018.) |
wff โ!๐ฅ โ ๐ด๐ | ||
Definition | df-alsi 14707 | Define "all some" applied to a top-level implication, which means ๐ is true whenever ๐ is true and there is at least one ๐ฅ where ๐ is true. (Contributed by David A. Wheeler, 20-Oct-2018.) |
โข (โ!๐ฅ(๐ โ ๐) โ (โ๐ฅ(๐ โ ๐) โง โ๐ฅ๐)) | ||
Definition | df-alsc 14708 | Define "all some" applied to a class, which means ๐ is true for all ๐ฅ in ๐ด and there is at least one ๐ฅ in ๐ด. (Contributed by David A. Wheeler, 20-Oct-2018.) |
โข (โ!๐ฅ โ ๐ด๐ โ (โ๐ฅ โ ๐ด ๐ โง โ๐ฅ ๐ฅ โ ๐ด)) | ||
Theorem | alsconv 14709 | There is an equivalence between the two "all some" forms. (Contributed by David A. Wheeler, 22-Oct-2018.) |
โข (โ!๐ฅ(๐ฅ โ ๐ด โ ๐) โ โ!๐ฅ โ ๐ด๐) | ||
Theorem | alsi1d 14710 | Deduction rule: Given "all some" applied to a top-level inference, you can extract the "for all" part. (Contributed by David A. Wheeler, 20-Oct-2018.) |
โข (๐ โ โ!๐ฅ(๐ โ ๐)) โ โข (๐ โ โ๐ฅ(๐ โ ๐)) | ||
Theorem | alsi2d 14711 | Deduction rule: Given "all some" applied to a top-level inference, you can extract the "exists" part. (Contributed by David A. Wheeler, 20-Oct-2018.) |
โข (๐ โ โ!๐ฅ(๐ โ ๐)) โ โข (๐ โ โ๐ฅ๐) | ||
Theorem | alsc1d 14712 | Deduction rule: Given "all some" applied to a class, you can extract the "for all" part. (Contributed by David A. Wheeler, 20-Oct-2018.) |
โข (๐ โ โ!๐ฅ โ ๐ด๐) โ โข (๐ โ โ๐ฅ โ ๐ด ๐) | ||
Theorem | alsc2d 14713 | Deduction rule: Given "all some" applied to a class, you can extract the "there exists" part. (Contributed by David A. Wheeler, 20-Oct-2018.) |
โข (๐ โ โ!๐ฅ โ ๐ด๐) โ โข (๐ โ โ๐ฅ ๐ฅ โ ๐ด) |
< Previous Wrap > |
Copyright terms: Public domain | < Previous Wrap > |