Home | Intuitionistic Logic Explorer Theorem List (p. 56 of 108) | < 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 | riotacl2 5501 |
Membership law for "the unique element in such that ."
(Contributed by NM, 21-Aug-2011.) (Revised by Mario Carneiro, 23-Dec-2016.) |
Theorem | riotacl 5502* | Closure of restricted iota. (Contributed by NM, 21-Aug-2011.) |
Theorem | riotasbc 5503 | Substitution law for descriptions. (Contributed by NM, 23-Aug-2011.) (Proof shortened by Mario Carneiro, 24-Dec-2016.) |
Theorem | riotabidva 5504* | Equivalent wff's yield equal restricted class abstractions (deduction rule). (rabbidva 2592 analog.) (Contributed by NM, 17-Jan-2012.) |
Theorem | riotabiia 5505 | Equivalent wff's yield equal restricted iotas (inference rule). (rabbiia 2591 analog.) (Contributed by NM, 16-Jan-2012.) |
Theorem | riota1 5506* | Property of restricted iota. Compare iota1 4901. (Contributed by Mario Carneiro, 15-Oct-2016.) |
Theorem | riota1a 5507 | Property of iota. (Contributed by NM, 23-Aug-2011.) |
Theorem | riota2df 5508* | A deduction version of riota2f 5509. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Theorem | riota2f 5509* | This theorem shows a condition that allows us to represent a descriptor with a class expression . (Contributed by NM, 23-Aug-2011.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Theorem | riota2 5510* | This theorem shows a condition that allows us to represent a descriptor with a class expression . (Contributed by NM, 23-Aug-2011.) (Revised by Mario Carneiro, 10-Dec-2016.) |
Theorem | riotaprop 5511* | Properties of a restricted definite description operator. Todo (df-riota 5488 update): can some uses of riota2f 5509 be shortened with this? (Contributed by NM, 23-Nov-2013.) |
Theorem | riota5f 5512* | A method for computing restricted iota. (Contributed by NM, 16-Apr-2013.) (Revised by Mario Carneiro, 15-Oct-2016.) |
Theorem | riota5 5513* | A method for computing restricted iota. (Contributed by NM, 20-Oct-2011.) (Revised by Mario Carneiro, 6-Dec-2016.) |
Theorem | riotass2 5514* | Restriction of a unique element to a smaller class. (Contributed by NM, 21-Aug-2011.) (Revised by NM, 22-Mar-2013.) |
Theorem | riotass 5515* | Restriction of a unique element to a smaller class. (Contributed by NM, 19-Oct-2005.) (Revised by Mario Carneiro, 24-Dec-2016.) |
Theorem | moriotass 5516* | Restriction of a unique element to a smaller class. (Contributed by NM, 19-Feb-2006.) (Revised by NM, 16-Jun-2017.) |
Theorem | snriota 5517 | A restricted class abstraction with a unique member can be expressed as a singleton. (Contributed by NM, 30-May-2006.) |
Theorem | eusvobj2 5518* | Specify the same property in two ways when class is single-valued. (Contributed by NM, 1-Nov-2010.) (Proof shortened by Mario Carneiro, 24-Dec-2016.) |
Theorem | eusvobj1 5519* | Specify the same object in two ways when class is single-valued. (Contributed by NM, 1-Nov-2010.) (Proof shortened by Mario Carneiro, 19-Nov-2016.) |
Theorem | f1ofveu 5520* | There is one domain element for each value of a one-to-one onto function. (Contributed by NM, 26-May-2006.) |
Theorem | f1ocnvfv3 5521* | Value of the converse of a one-to-one onto function. (Contributed by NM, 26-May-2006.) (Proof shortened by Mario Carneiro, 24-Dec-2016.) |
Theorem | riotaund 5522* | Restricted iota equals the empty set when not meaningful. (Contributed by NM, 16-Jan-2012.) (Revised by Mario Carneiro, 15-Oct-2016.) (Revised by NM, 13-Sep-2018.) |
Theorem | acexmidlema 5523* | Lemma for acexmid 5531. (Contributed by Jim Kingdon, 6-Aug-2019.) |
Theorem | acexmidlemb 5524* | Lemma for acexmid 5531. (Contributed by Jim Kingdon, 6-Aug-2019.) |
Theorem | acexmidlemph 5525* | Lemma for acexmid 5531. (Contributed by Jim Kingdon, 6-Aug-2019.) |
Theorem | acexmidlemab 5526* | Lemma for acexmid 5531. (Contributed by Jim Kingdon, 6-Aug-2019.) |
Theorem | acexmidlemcase 5527* |
Lemma for acexmid 5531. Here we divide the proof into cases (based
on the
disjunction implicit in an unordered pair, not the sort of case
elimination which relies on excluded middle).
The cases are (1) the choice function evaluated at equals , (2) the choice function evaluated at equals , and (3) the choice function evaluated at equals and the choice function evaluated at equals . Because of the way we represent the choice function , the choice function evaluated at is and the choice function evaluated at is . Other than the difference in notation these work just as and would if were a function as defined by df-fun 4924. Although it isn't exactly about the division into cases, it is also convenient for this lemma to also include the step that if the choice function evaluated at equals , then and likewise for . (Contributed by Jim Kingdon, 7-Aug-2019.) |
Theorem | acexmidlem1 5528* | Lemma for acexmid 5531. List the cases identified in acexmidlemcase 5527 and hook them up to the lemmas which handle each case. (Contributed by Jim Kingdon, 7-Aug-2019.) |
Theorem | acexmidlem2 5529* |
Lemma for acexmid 5531. This builds on acexmidlem1 5528 by noting that every
element of is
inhabited.
(Note that is not quite a function in the df-fun 4924 sense because it uses ordered pairs as described in opthreg 4299 rather than df-op 3407). The set is also found in onsucelsucexmidlem 4272. (Contributed by Jim Kingdon, 5-Aug-2019.) |
Theorem | acexmidlemv 5530* |
Lemma for acexmid 5531.
This is acexmid 5531 with additional distinct variable constraints, most notably between and . (Contributed by Jim Kingdon, 6-Aug-2019.) |
Theorem | acexmid 5531* |
The axiom of choice implies excluded middle. Theorem 1.3 in [Bauer]
p. 483.
The statement of the axiom of choice given here is ac2 in the Metamath Proof Explorer (version of 3-Aug-2019). In particular, note that the choice function provides a value when is inhabited (as opposed to non-empty as in some statements of the axiom of choice). Essentially the same proof can also be found at "The axiom of choice implies instances of EM", [Crosilla], p. "Set-theoretic principles incompatible with intuitionistic logic". Often referred to as Diaconescu's theorem, or Diaconescu-Goodman-Myhill theorem, after Radu Diaconescu who discovered it in 1975 in the framework of topos theory and N. D. Goodman and John Myhill in 1978 in the framework of set theory (although it already appeared as an exercise in Errett Bishop's book Foundations of Constructive Analysis from 1967). (Contributed by Jim Kingdon, 4-Aug-2019.) |
Syntax | co 5532 | Extend class notation to include the value of an operation (such as + ) for two arguments and . Note that the syntax is simply three class symbols in a row surrounded by parentheses. Since operation values are the only possible class expressions consisting of three class expressions in a row surrounded by parentheses, the syntax is unambiguous. |
Syntax | coprab 5533 | Extend class notation to include class abstraction (class builder) of nested ordered pairs. |
Syntax | cmpt2 5534 | Extend the definition of a class to include maps-to notation for defining an operation via a rule. |
Definition | df-ov 5535 | Define the value of an operation. Definition of operation value in [Enderton] p. 79. Note that the syntax is simply three class expressions in a row bracketed by parentheses. There are no restrictions of any kind on what those class expressions may be, although only certain kinds of class expressions - a binary operation and its arguments and - will be useful for proving meaningful theorems. For example, if class is the operation + and arguments and are 3 and 2 , the expression ( 3 + 2 ) can be proved to equal 5 . This definition is well-defined, although not very meaningful, when classes and/or are proper classes (i.e. are not sets); see ovprc1 5561 and ovprc2 5562. On the other hand, we often find uses for this definition when is a proper class. is normally equal to a class of nested ordered pairs of the form defined by df-oprab 5536. (Contributed by NM, 28-Feb-1995.) |
Definition | df-oprab 5536* | Define the class abstraction (class builder) of a collection of nested ordered pairs (for use in defining operations). This is a special case of Definition 4.16 of [TakeutiZaring] p. 14. Normally , , and are distinct, although the definition doesn't strictly require it. See df-ov 5535 for the value of an operation. The brace notation is called "class abstraction" by Quine; it is also called a "class builder" in the literature. The value of the most common operation class builder is given by ovmpt2 5656. (Contributed by NM, 12-Mar-1995.) |
Definition | df-mpt2 5537* | Define maps-to notation for defining an operation via a rule. Read as "the operation defined by the map from (in ) to ." An extension of df-mpt 3841 for two arguments. (Contributed by NM, 17-Feb-2008.) |
Theorem | oveq 5538 | Equality theorem for operation value. (Contributed by NM, 28-Feb-1995.) |
Theorem | oveq1 5539 | Equality theorem for operation value. (Contributed by NM, 28-Feb-1995.) |
Theorem | oveq2 5540 | Equality theorem for operation value. (Contributed by NM, 28-Feb-1995.) |
Theorem | oveq12 5541 | Equality theorem for operation value. (Contributed by NM, 16-Jul-1995.) |
Theorem | oveq1i 5542 | Equality inference for operation value. (Contributed by NM, 28-Feb-1995.) |
Theorem | oveq2i 5543 | Equality inference for operation value. (Contributed by NM, 28-Feb-1995.) |
Theorem | oveq12i 5544 | Equality inference for operation value. (Contributed by NM, 28-Feb-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
Theorem | oveqi 5545 | Equality inference for operation value. (Contributed by NM, 24-Nov-2007.) |
Theorem | oveq123i 5546 | Equality inference for operation value. (Contributed by FL, 11-Jul-2010.) |
Theorem | oveq1d 5547 | Equality deduction for operation value. (Contributed by NM, 13-Mar-1995.) |
Theorem | oveq2d 5548 | Equality deduction for operation value. (Contributed by NM, 13-Mar-1995.) |
Theorem | oveqd 5549 | Equality deduction for operation value. (Contributed by NM, 9-Sep-2006.) |
Theorem | oveq12d 5550 | Equality deduction for operation value. (Contributed by NM, 13-Mar-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
Theorem | oveqan12d 5551 | Equality deduction for operation value. (Contributed by NM, 10-Aug-1995.) |
Theorem | oveqan12rd 5552 | Equality deduction for operation value. (Contributed by NM, 10-Aug-1995.) |
Theorem | oveq123d 5553 | Equality deduction for operation value. (Contributed by FL, 22-Dec-2008.) |
Theorem | nfovd 5554 | Deduction version of bound-variable hypothesis builder nfov 5555. (Contributed by NM, 13-Dec-2005.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
Theorem | nfov 5555 | Bound-variable hypothesis builder for operation value. (Contributed by NM, 4-May-2004.) |
Theorem | oprabidlem 5556* | Slight elaboration of exdistrfor 1721. A lemma for oprabid 5557. (Contributed by Jim Kingdon, 15-Jan-2019.) |
Theorem | oprabid 5557 | The law of concretion. Special case of Theorem 9.5 of [Quine] p. 61. Although this theorem would be useful with a distinct variable constraint between , , and , we use ax-bndl 1439 to eliminate that constraint. (Contributed by Mario Carneiro, 20-Mar-2013.) |
Theorem | fnovex 5558 | The result of an operation is a set. (Contributed by Jim Kingdon, 15-Jan-2019.) |
Theorem | ovexg 5559 | Evaluating a set operation at two sets gives a set. (Contributed by Jim Kingdon, 19-Aug-2021.) |
Theorem | ovprc 5560 | The value of an operation when the one of the arguments is a proper class. Note: this theorem is dependent on our particular definitions of operation value, function value, and ordered pair. (Contributed by Mario Carneiro, 26-Apr-2015.) |
Theorem | ovprc1 5561 | The value of an operation when the first argument is a proper class. (Contributed by NM, 16-Jun-2004.) |
Theorem | ovprc2 5562 | The value of an operation when the second argument is a proper class. (Contributed by Mario Carneiro, 26-Apr-2015.) |
Theorem | csbov123g 5563 | Move class substitution in and out of an operation. (Contributed by NM, 12-Nov-2005.) (Proof shortened by Mario Carneiro, 5-Dec-2016.) |
Theorem | csbov12g 5564* | Move class substitution in and out of an operation. (Contributed by NM, 12-Nov-2005.) |
Theorem | csbov1g 5565* | Move class substitution in and out of an operation. (Contributed by NM, 12-Nov-2005.) |
Theorem | csbov2g 5566* | Move class substitution in and out of an operation. (Contributed by NM, 12-Nov-2005.) |
Theorem | rspceov 5567* | A frequently used special case of rspc2ev 2715 for operation values. (Contributed by NM, 21-Mar-2007.) |
Theorem | fnotovb 5568 | Equivalence of operation value and ordered triple membership, analogous to fnopfvb 5236. (Contributed by NM, 17-Dec-2008.) (Revised by Mario Carneiro, 28-Apr-2015.) |
Theorem | opabbrex 5569* | A collection of ordered pairs with an extension of a binary relation is a set. (Contributed by Alexander van der Vekens, 1-Nov-2017.) |
Theorem | 0neqopab 5570 | The empty set is never an element in an ordered-pair class abstraction. (Contributed by Alexander van der Vekens, 5-Nov-2017.) |
Theorem | brabvv 5571* | If two classes are in a relationship given by an ordered-pair class abstraction, the classes are sets. (Contributed by Jim Kingdon, 16-Jan-2019.) |
Theorem | dfoprab2 5572* | Class abstraction for operations in terms of class abstraction of ordered pairs. (Contributed by NM, 12-Mar-1995.) |
Theorem | reloprab 5573* | An operation class abstraction is a relation. (Contributed by NM, 16-Jun-2004.) |
Theorem | nfoprab1 5574 | The abstraction variables in an operation class abstraction are not free. (Contributed by NM, 25-Apr-1995.) (Revised by David Abernethy, 19-Jun-2012.) |
Theorem | nfoprab2 5575 | The abstraction variables in an operation class abstraction are not free. (Contributed by NM, 25-Apr-1995.) (Revised by David Abernethy, 30-Jul-2012.) |
Theorem | nfoprab3 5576 | The abstraction variables in an operation class abstraction are not free. (Contributed by NM, 22-Aug-2013.) |
Theorem | nfoprab 5577* | Bound-variable hypothesis builder for an operation class abstraction. (Contributed by NM, 22-Aug-2013.) |
Theorem | oprabbid 5578* | Equivalent wff's yield equal operation class abstractions (deduction rule). (Contributed by NM, 21-Feb-2004.) (Revised by Mario Carneiro, 24-Jun-2014.) |
Theorem | oprabbidv 5579* | Equivalent wff's yield equal operation class abstractions (deduction rule). (Contributed by NM, 21-Feb-2004.) |
Theorem | oprabbii 5580* | Equivalent wff's yield equal operation class abstractions. (Contributed by NM, 28-May-1995.) (Revised by David Abernethy, 19-Jun-2012.) |
Theorem | ssoprab2 5581 | Equivalence of ordered pair abstraction subclass and implication. Compare ssopab2 4030. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 11-Dec-2016.) |
Theorem | ssoprab2b 5582 | Equivalence of ordered pair abstraction subclass and implication. Compare ssopab2b 4031. (Contributed by FL, 6-Nov-2013.) (Proof shortened by Mario Carneiro, 11-Dec-2016.) |
Theorem | eqoprab2b 5583 | Equivalence of ordered pair abstraction subclass and biconditional. Compare eqopab2b 4034. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Theorem | mpt2eq123 5584* | An equality theorem for the maps to notation. (Contributed by Mario Carneiro, 16-Dec-2013.) (Revised by Mario Carneiro, 19-Mar-2015.) |
Theorem | mpt2eq12 5585* | An equality theorem for the maps to notation. (Contributed by Mario Carneiro, 16-Dec-2013.) |
Theorem | mpt2eq123dva 5586* | An equality deduction for the maps to notation. (Contributed by Mario Carneiro, 26-Jan-2017.) |
Theorem | mpt2eq123dv 5587* | An equality deduction for the maps to notation. (Contributed by NM, 12-Sep-2011.) |
Theorem | mpt2eq123i 5588 | An equality inference for the maps to notation. (Contributed by NM, 15-Jul-2013.) |
Theorem | mpt2eq3dva 5589* | Slightly more general equality inference for the maps to notation. (Contributed by NM, 17-Oct-2013.) |
Theorem | mpt2eq3ia 5590 | An equality inference for the maps to notation. (Contributed by Mario Carneiro, 16-Dec-2013.) |
Theorem | nfmpt21 5591 | Bound-variable hypothesis builder for an operation in maps-to notation. (Contributed by NM, 27-Aug-2013.) |
Theorem | nfmpt22 5592 | Bound-variable hypothesis builder for an operation in maps-to notation. (Contributed by NM, 27-Aug-2013.) |
Theorem | nfmpt2 5593* | Bound-variable hypothesis builder for the maps-to notation. (Contributed by NM, 20-Feb-2013.) |
Theorem | mpt20 5594 | A mapping operation with empty domain. (Contributed by Stefan O'Rear, 29-Jan-2015.) (Revised by Mario Carneiro, 15-May-2015.) |
Theorem | oprab4 5595* | Two ways to state the domain of an operation. (Contributed by FL, 24-Jan-2010.) |
Theorem | cbvoprab1 5596* | Rule used to change first bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 20-Dec-2008.) (Revised by Mario Carneiro, 5-Dec-2016.) |
Theorem | cbvoprab2 5597* | Change the second bound variable in an operation abstraction. (Contributed by Jeff Madsen, 11-Jun-2010.) (Revised by Mario Carneiro, 11-Dec-2016.) |
Theorem | cbvoprab12 5598* | Rule used to change first two bound variables in an operation abstraction, using implicit substitution. (Contributed by NM, 21-Feb-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
Theorem | cbvoprab12v 5599* | Rule used to change first two bound variables in an operation abstraction, using implicit substitution. (Contributed by NM, 8-Oct-2004.) |
Theorem | cbvoprab3 5600* | Rule used to change the third bound variable in an operation abstraction, using implicit substitution. (Contributed by NM, 22-Aug-2013.) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |