Home | Metamath
Proof Explorer Theorem List (p. 336 of 386) | < Previous Next > |
Browser slow? Try the
Unicode version. |
||
Mirrors > Metamath Home Page > MPE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
Color key: | Metamath Proof Explorer
(1-25952) |
Hilbert Space Explorer
(25953-27476) |
Users' Mathboxes
(27477-38550) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | dpcl 33501 | Prove that the closure of the decimal point is as we have defined it. See df-dp 33498. (Contributed by David A. Wheeler, 15-May-2015.) |
Theorem | dpfrac1 33502 | Prove a simple equivalence involving the decimal point. See df-dp 33498 and dpcl 33501. (Contributed by David A. Wheeler, 15-May-2015.) |
; | ||
Most of this subsection was moved to main set.mm, section "Logarithms to an arbitrary base". | ||
Theorem | logb2aval 33503 | Define the value of the log_{b} function, the logarithm generalized to an arbitrary base, when used in the 2-argument form log_{b} (Contributed by David A. Wheeler, 21-Jan-2017.) (Revised by David A. Wheeler, 16-Jul-2017.) |
log_{b} | ||
Define "log using an arbitrary base" function and then prove some of its properties. This builds on previous work by Stefan O'Rear. This supports the notational form log_; that looks a little more like traditional notation, but is different from other 2-parameter functions. E.G., log_;; This form is less convenient to work with inside metamath as compared to the log_{b} form defined separately. | ||
Syntax | clog- 33504 | Extend class notation to include the logarithm generalized to an arbitrary base. |
log_ | ||
Definition | df-logbALT 33505* | Define the log_ operator. This is the logarithm generalized to an arbitrary base. It can be used as log_ for "log base B of X". This formulation suggested by Mario Carneiro. (Contributed by David A. Wheeler, 14-Jul-2017.) (New usage is discouraged.) |
log_ | ||
EXPERIMENTAL. Several terms are used in comments but not directly defined in set.mm. For example, there are proofs that a number of specific relationships are reflexive, but there is no formal definition of what being reflexive actually *means*. Stating the relationships directly, instead of defining a broader test such as being reflexive, can reduce proof size (because the definition of does not need to be expanded later). A disadvantage, however, is that there are several terms that are widely used in comments but do not have a clear formal definition. Here we define wffs that formally define some of these key terms. The intent isn't to use these directly, but to instead provide a clear formal definition of widely-used mathematical terminology (we even use this terminology within the comments of set.mm itself). We could define these using extensible structures, but doing so appears overly restrictive. These definitions don't require the use of extensible structures; requiring something to be in an extensible structure to use them is too restrictive. Even if an extensible structure is already in use, it may in use for other things. For example, in geometry, there is a "less-than" relation, but while the geometry itself is an extensible structure, we would have to build a new structure to state "the geometric less-than relation is transitive" (which is more work than it's probably worth). By creating definitions that aren't tied to extensible structures we create definitions that can be applied to anything, including extensible structures, in whatever whatever way we'd like. Benoit suggests that it might be better to define these as functions. There are many advantages to doing that, but then they it won't work for proper classes. I'm currently trying to also support proper classes, so I have not taken that approach, but if that turns out to be unreasonable then Benoit's approach is very much worth considering. Examples would be: BinRel = , ReflBinRel = BinRel Diag , and IrreflBinRel = BinRel Diag . For more discussion see: https://github.com/metamath/set.mm/pull/1286 | ||
Syntax | wreflexive 33506 | Extend wff definition to include "Reflexive" applied to a class, which is true iff class R is a reflexive relationship over the set A. See df-reflexive 33507. (Contributed by David A. Wheeler, 1-Dec-2019.) |
Reflexive | ||
Definition | df-reflexive 33507* | Define relexive relationship; relation R is reflexive over the set A iff . (Contributed by David A. Wheeler, 1-Dec-2019.) |
Reflexive | ||
Syntax | wirreflexive 33508 | Extend wff definition to include "Irreflexive" applied to a class, which is true iff class R is an irreflexive relationship over the set A. See df-irreflexive 33509. (Contributed by David A. Wheeler, 1-Dec-2019.) |
Irreflexive | ||
Definition | df-irreflexive 33509* | Define irrelexive relationship; relation R is irreflexive over the set A iff . Note that a relationship can be neither reflexive nor irreflexive. (Contributed by David A. Wheeler, 1-Dec-2019.) |
Irreflexive | ||
This is an experimental approach to make it clearer (and easier) to do basic algebra in set.mm. These little theorems support basic algebra on equations at a slightly higher conceptual level. Instead of always having to "build up" equivalent expressions for one side of an equation, these theorems allow you to directly manipulate an equality. These higher-level steps lead to easier to understand proofs when they can be used, as well as proofs that are slightly shorter (when measured in steps). There are disadvantages. In particular, this approach requires many theorems (for many permutations to provide all of the operations). It can also only handle certain cases; more complex approaches must still be approached by "building up" equalities as is done today. However, I expect that we can create enough theorems to make it worth doing. I'm trying this out to see if this is helpful and if the number of permutations is manageable. To commute LHS for addition, use addcomli 9683. We might want to switch to a naming convention like addcomli 9683. | ||
Theorem | comraddd 33510 | Commute RHS addition, in deduction form. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | comraddi 33511 | Commute RHS addition. See addcomli 9683 to commute addition on LHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | mvlladdd 33512 | Move LHS left addition to RHS. (Contributed by David A. Wheeler, 15-Oct-2018.) |
Theorem | mvlraddd 33513 | Move LHS right addition to RHS. (Contributed by David A. Wheeler, 15-Oct-2018.) |
Theorem | mvlraddi 33514 | Move LHS right addition to RHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | mvrladdd 33515 | Move RHS left addition to LHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | mvrladdi 33516 | Move RHS left addition to LHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | mvrraddd 33517 | Move RHS right addition to LHS. (Contributed by David A. Wheeler, 15-Oct-2018.) |
Theorem | mvrraddi 33518 | Move RHS right addition to LHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | assraddsubd 33519 | Associate RHS addition-subtraction. (Contributed by David A. Wheeler, 15-Oct-2018.) |
Theorem | assraddsubi 33520 | Associate RHS addition-subtraction. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | joinlmuladdmuld 33521 | Join AB+CB into (A+C) on LHS. (Contributed by David A. Wheeler, 26-Oct-2019.) |
Theorem | joinlmuladdmuli 33522 | Join AB+CB into (A+C) on LHS. (Contributed by David A. Wheeler, 26-Oct-2019.) |
Theorem | joinlmulsubmuld 33523 | Join AB-CB into (A-C) on LHS. (Contributed by David A. Wheeler, 15-Oct-2018.) |
Theorem | joinlmulsubmuli 33524 | Join AB-CB into (A-C) on LHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | mvlrmuld 33525 | Move LHS right multiplication to RHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | mvlrmuli 33526 | Move LHS right multiplication to RHS. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Examples using the algebra helpers. | ||
Theorem | i2linesi 33527 | Solve for the intersection of two lines expressed in Y = MX+B form (note that the lines cannot be vertical). Here we use inference form. We just solve for X, since Y can be trivially found by using X. This is an example of how to use the algebra helpers. Notice that because this proof uses algebra helpers, the main steps of the proof are higher level and easier to follow by a human reader. (Contributed by David A. Wheeler, 11-Oct-2018.) |
Theorem | i2linesd 33528 | Solve for the intersection of two lines expressed in Y = MX+B form (note that the lines cannot be vertical). Here we use deduction form. We just solve for X, since Y can be trivially found by using X. This is an example of how to use the algebra helpers. Notice that because this proof uses algebra helpers, the main steps of the proof are higher level and easier to follow by a human reader. (Contributed by David A. Wheeler, 15-Oct-2018.) |
Prove that some formal expressions using classical logic have meanings that might not be obvious to some lay readers. I find these are common mistakes and are worth pointing out to new people. In particular we prove alimp-surprise 33529, empty-surprise 33531, and eximp-surprise 33533. | ||
Theorem | alimp-surprise 33529 |
Demonstrate that when using "for all" and material implication the
consequent can be both always true and always false if there is no case
where the antecedent is true.
Those inexperienced with formal notations of classical logic can be surprised with what "for all" and material implication do together when the implication's antecedent is never true. This can happen, for example, when the antecedent is set membership but the set is the empty set (e.g., and ). This is perhaps best explained using an example. The sentence "All Martians are green" would typically be represented formally using the expression . In this expression is true iff is a Martian and is true iff is green. Similarly, "All Martians are not green" would typically be represented as . However, if there are no Martians ( ), then both of those expressions are true. That is surprising to the inexperienced, because the two expressions seem to be the opposite of each other. The reason this occurs is because in classical logic the implication is equivalent to (as proven in imor 410). When is always false, is always true, and an or with true is always true. Here are a few technical notes. In this notation, and are predicates that return a true or false value and may depend on . We only say may because it actually doesn't matter for our proof. In metamath this simply means that we do not require that , , and be distinct (so can be part of or ). In natural language the term "implies" often presumes that the antecedent can occur in at one least circumstance and that there is some sort of causality. However, exactly what causality means is complex and situation-dependent. Modern logic typically uses material implication instead; this has a rigorous definition, but it is important for new users of formal notation to precisely understand it. There are ways to solve this, e.g., expressly stating that the antecedent exists (see alimp-no-surprise 33530) or using the allsome quantifier (df-alsi 33537) . For other "surprises" for new users of classical logic, see empty-surprise 33531 and eximp-surprise 33533. (Contributed by David A. Wheeler, 17-Oct-2018.) |
Theorem | alimp-no-surprise 33530 | There is no "surprise" in a for-all with implication if there exists a value where the antecedent is true. This is one way to prevent for-all with implication from allowing anything. For a contrast, see alimp-surprise 33529. The allsome quantifier also counters this problem, see df-alsi 33537. (Contributed by David A. Wheeler, 27-Oct-2018.) |
Theorem | empty-surprise 33531 |
Demonstrate that when using restricted "for all" over a class the
expression can be both always true and always false if the class is
empty.
Those inexperienced with formal notations of classical logic can be surprised with what restricted "for all" does over an empty set. It is important to note that is simply an abbreviation for (per df-ral 2737). Thus, if is the empty set, this expression is always true regardless of the value of (see alimp-surprise 33529). If you want the expression to not be vacuously true, you need to ensure that set is inhabited (e.g., ). (Technical note: You can also assert that ; this is an equivalent claim in classical logic as proven in n0 3721, but in intuitionistic logic the statement is a weaker claim than .) Some materials on logic (particularly those that discuss "syllogisms") are based on the much older work by Aristotle, but Aristotle expressly excluded empty sets from his system. Aristotle had a specific goal; he was trying to develop a "companion-logic" for science. He relegates fictions like fairy godmothers and mermaids and unicorns to the realms of poetry and literature... This is why he leaves no room for such non-existent entities in his logic." (Groarke, "Aristotle: Logic", section 7. (Existential Assumptions), Internet Encyclopedia of Philosophy, http://www.iep.utm.edu/aris-log/). While this made sense for his purposes, it is less flexible than modern (classical) logic which does permit empty sets. If you wish to make claims that require a nonempty set, you must expressly include that requirement, e.g., by stating . Examples of proofs that do this include barbari 2325, celaront 2326, and cesaro 2331. For another "surprise" for new users of classical logic, see alimp-surprise 33529 and eximp-surprise 33533. (Contributed by David A. Wheeler, 20-Oct-2018.) |
Theorem | empty-surprise2 33532 |
"Prove" that false is true when using a restricted "for
all" over the
empty set, to demonstrate that the expression is always true if the
value ranges over the empty set.
Those inexperienced with formal notations of classical logic can be surprised with what restricted "for all" does over an empty set. We proved the general case in empty-surprise 33531. Here we prove an extreme example: we "prove" that false is true. Of course, we actually do no such thing (see notfal 1436); the problem is that restricted "for all" works in ways that might seem counterintuitive to the inexperienced when given an empty set. Solutions to this can include requiring that the set not be empty or by using the allsome quantifier df-alsc 33538. (Contributed by David A. Wheeler, 20-Oct-2018.) |
Theorem | eximp-surprise 33533 |
Show what implication inside "there exists" really expands to (using
implication directly inside "there exists" is usually a
mistake).
Those inexperienced with formal notations of classical logic may use expressions combining "there exists" with implication. That is usually a mistake, because as proven using imor 410, such an expression can be rewritten using not with or - and that is often not what the author intended. New users of formal notation who use "there exists" with an implication should consider if they meant "and" instead of "implies". A stark example is shown in eximp-surprise2 33534. See also alimp-surprise 33529 and empty-surprise 33531. (Contributed by David A. Wheeler, 17-Oct-2018.) |
Theorem | eximp-surprise2 33534 |
Show that "there exists" with an implication is always true if there
exists a situation where the antecedent is false.
Those inexperienced with formal notations of classical logic may use expressions combining "there exists" with implication. This is usually a mistake, because that combination does not mean what an inexperienced person might think it means. For example, if there is some object that does not meet the precondition , then the expression as a whole is always true, no matter what is ( could even be false, ). New users of formal notation who use "there exists" with an implication should consider if they meant "and" instead of "implies". See eximp-surprise 33533, which shows what implication really expands to. See also empty-surprise 33531. (Contributed by David A. Wheeler, 18-Oct-2018.) |
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. See alimp-surprise 33529 and empty-surprise 33531 as examples of the problem. 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 33535 | 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.) |
! | ||
Syntax | walsc 33536 | 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.) |
! | ||
Definition | df-alsi 33537 | 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 33538 | 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 33539 | There is an equivalence between the two "all some" forms. (Contributed by David A. Wheeler, 22-Oct-2018.) |
! ! | ||
Theorem | alsi1d 33540 | 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 33541 | 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 33542 | 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 33543 | Deduction rule: Given "all some" applied to a class, you can extract the "there exists" part. (Contributed by David A. Wheeler, 20-Oct-2018.) |
! | ||
Theorem | alscn0d 33544* | Deduction rule: Given "all some" applied to a class, the class is not the empty set. (Contributed by David A. Wheeler, 23-Oct-2018.) |
! | ||
Theorem | alsi-no-surprise 33545 | Demonstrate that there is never a "surprise" when using the allsome quantifier, that is, it is never possible for the consequent to be both always true and always false. This uses the definition of df-alsi 33537; the proof itself builds on alimp-no-surprise 33530. For a contrast, see alimp-surprise 33529. (Contributed by David A. Wheeler, 27-Oct-2018.) |
! ! | ||
Miscellaneous proofs. | ||
Theorem | 5m4e1 33546 | Prove that 5 - 4 = 1. (Contributed by David A. Wheeler, 31-Jan-2017.) |
Theorem | 2p2ne5 33547 | Prove that . In George Orwell's "1984", Part One, Chapter Seven, the protagonist Winston notes that, "In the end the Party would announce that two and two made five, and you would have to believe it." http://www.sparknotes.com/lit/1984/section4.rhtml. More generally, the phrase has come to represent an obviously false dogma one may be required to believe. See the Wikipedia article for more about this: https://en.wikipedia.org/wiki/2_%2B_2_%3D_5. Unsurprisingly, we can easily prove that this claim is false. (Contributed by David A. Wheeler, 31-Jan-2017.) |
Theorem | resolution 33548 | Resolution rule. This is the primary inference rule in some automated theorem provers such as prover9. The resolution rule can be traced back to Davis and Putnam (1960). (Contributed by David A. Wheeler, 9-Feb-2017.) |
Theorem | testable 33549 | In classical logic all wffs are testable, that is, it is always true that . This is not necessarily true in intuitionistic logic. In intuitionistic logic, if this statement is true for some , then is testable. The proof is trivial because it's simply a special case of the law of the excluded middle, which is true in classical logic but not necessarily true in intuitionisic logic. (Contributed by David A. Wheeler, 5-Dec-2018.) |
Theorem | aacllem 33550* | Lemma for other theorems about . (Contributed by Brendan Leahy, 3-Jan-2020.) (Revised by Alexander van der Vekens and David A. Wheeler, 25-Apr-2020.) |
We are sad to report the passing of long-time contributor Alan Sare (Nov. 9, 1954 - Mar. 23, 2019). Alan's first contribution to Metamath was a shorter proof for tfrlem8 6971 in 2008. He developed a tool called "completeusersproof" that assists developing proofs using his "virtual deduction" method: http://us.metamath.org/other.html#completeusersproof. His virtual deduction method is explained in the comment for wvd1 33686. Below are some excerpts from his first emails to NM in 2007: ...I have been interested in proving set theory theorems for many years for mental exercise. I enjoy it. I have used a book by Martin Zuckerman. It is informal. I am interested in completely and perfectly proving theorems. Mr. Zuckerman leaves out most of the steps of a proof, of course, like most authors do, as you have noted. A complete proof for higher theorems would require a volume of writing similar to the metamath documents. So I am frustrated when I am not capable of constructing a proof and Zuckerman leaves out steps I do not understand. I could search for the steps in other texts, but I don't do that too much. Metamath may be the answer for me.... ...If we go beyond mathematics, I believe that it is possible to write down all human knowledge in a way similar to the way you have explicated large areas of mathematics. Of course, that would be a much, much more difficult job. For example, it is possible to take a hard science like physics construct axioms based on experimental results and to cast all of physics into a collection of axioms and theorems. Maybe his has already been attempted, although I am not familiar with it. When one then moves on to the soft sciences such as social science, this job gets much more difficult. The key is: All human thought consists of logical operations on abstract objects. Usually, these logical operations are done informally. There is no reason why one cannot take any subject and explicate it and take it down to the indivisible postulates in a formal rigorous way.... ...When I read a math book or an engineering book I come across something I don't understand and I am compelled to understand it. But, often it is hopeless. I don't have the time. Or, I would have to read the same thing by multiple authors in the hope that different authors would give parts of the working proof that others have omitted. It is very inefficient. Because I have always been inclined to "get to the bottom" for a 100% fully understood proof.... | ||
Theorem | idiALT 33551 | Placeholder for idi 2. Though unnecessary, this theorem is sometimes used in proofs in this mathbox for pedagogical purposes. (Contributed by Alan Sare, 31-Dec-2011.) (Proof modification is discouraged.) (New usage is discouraged.) |
Theorem | exbir 33552 | Exportation implication also converting the consequent from a biconditional to an implication. Derived automatically from exbirVD 33999. (Contributed by Alan Sare, 31-Dec-2011.) |
Theorem | 3impexp 33553 | Version of impexp 444 for a triple conjunction. Derived automatically from 3impexpVD 34002. (Contributed by Alan Sare, 31-Dec-2011.) |
Theorem | 3impexpbicom 33554 | Version of 3impexp 33553 where in addition the consequent is commuted. (Contributed by Alan Sare, 31-Dec-2011.) |
Theorem | 3impexpbicomi 33555 | Inference associated with 3impexpbicom 33554. Derived automatically from 3impexpbicomiVD 34004. (Contributed by Alan Sare, 31-Dec-2011.) |
Theorem | ee02 33556 | Proof of e02 33823 without virtual deductions. (Contributed by Alan Sare, 22-Jul-2012.) |
Theorem | ad4ant13 33557 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant14 33558 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant123 33559 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant124 33560 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant134 33561 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant23 33562 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant24 33563 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad4ant234 33564 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant12 33565 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant13 33566 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant14 33567 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant15 33568 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant23 33569 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant24 33570 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant25 33571 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant245 33572 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant234 33573 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant235 33574 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant123 33575 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant124 33576 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant125 33577 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant134 33578 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant135 33579 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant145 33580 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant1345 33581 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | ad5ant2345 33582 | Deduction adding conjuncts to antecedent. (Contributed by Alan Sare, 17-Oct-2017.) |
Theorem | biimp 33583 | Importation inference similar to imp 427, except the outermost implication of the hypothesis is a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi2imp 33584 | Importation inference similar to imp 427, except the both implications of the hypothesis are biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi3impb 33585 | Similar to 3impb 1190 with implication in hypothesis replaced by biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi3impa 33586 | Similar to 3impa 1189 with implication in hypothesis replaced by biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi23impib 33587 | 3impib 1192 with the inner implication of the hypothesis a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi13impib 33588 | 3impib 1192 with the outer implication of the hypothesis a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi123impib 33589 | 3impib 1192 with the implications of the hypothesis biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi13impia 33590 | 3impia 1191 with the outer implication of the hypothesis a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi123impia 33591 | 3impia 1191 with the implications of the hypothesis biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi33imp12 33592 | 3imp 1188 with innermost implication of the hypothesis a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi23imp13 33593 | 3imp 1188 with middle implication of the hypothesis a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi13imp23 33594 | 3imp 1188 with outermost implication of the hypothesis a biconditional. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi13imp2 33595 | Similar to 3imp 1188 except the outermost and innermost implications are biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi12imp3 33596 | Similar to 3imp 1188 except all but innermost implication are biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi23imp1 33597 | Similar to 3imp 1188 except all but outermost implication are biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | bi123imp0 33598 | Similar to 3imp 1188 except all implications are biconditionals. (Contributed by Alan Sare, 6-Nov-2017.) |
Theorem | 4animp1 33599 | A single hypothesis unification deduction with an assertion which is an implication with a 4-right-nested conjunction antecedent. (Contributed by Alan Sare, 30-May-2018.) |
Theorem | 4an31 33600 | A rearrangement of conjuncts for a 4-right-nested conjunction. (Contributed by Alan Sare, 30-May-2018.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |