Home Intuitionistic Logic ExplorerTheorem List (p. 57 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

Theorem List for Intuitionistic Logic Explorer - 5601-5700   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremisorel 5601 An isomorphism connects binary relations via its function values. (Contributed by NM, 27-Apr-2004.)

Theoremisoresbr 5602* A consequence of isomorphism on two relations for a function's restriction. (Contributed by Jim Kingdon, 11-Jan-2019.)

Theoremisoid 5603 Identity law for isomorphism. Proposition 6.30(1) of [TakeutiZaring] p. 33. (Contributed by NM, 27-Apr-2004.)

Theoremisocnv 5604 Converse law for isomorphism. Proposition 6.30(2) of [TakeutiZaring] p. 33. (Contributed by NM, 27-Apr-2004.)

Theoremisocnv2 5605 Converse law for isomorphism. (Contributed by Mario Carneiro, 30-Jan-2014.)

Theoremisores2 5606 An isomorphism from one well-order to another can be restricted on either well-order. (Contributed by Mario Carneiro, 15-Jan-2013.)

Theoremisores1 5607 An isomorphism from one well-order to another can be restricted on either well-order. (Contributed by Mario Carneiro, 15-Jan-2013.)

Theoremisores3 5608 Induced isomorphism on a subset. (Contributed by Stefan O'Rear, 5-Nov-2014.)

Theoremisotr 5609 Composition (transitive) law for isomorphism. Proposition 6.30(3) of [TakeutiZaring] p. 33. (Contributed by NM, 27-Apr-2004.) (Proof shortened by Mario Carneiro, 5-Dec-2016.)

Theoremiso0 5610 The empty set is an isomorphism from the empty set to the empty set. (Contributed by Steve Rodriguez, 24-Oct-2015.)

Theoremisoini 5611 Isomorphisms preserve initial segments. Proposition 6.31(2) of [TakeutiZaring] p. 33. (Contributed by NM, 20-Apr-2004.)

Theoremisoini2 5612 Isomorphisms are isomorphisms on their initial segments. (Contributed by Mario Carneiro, 29-Mar-2014.)

Theoremisoselem 5613* Lemma for isose 5614. (Contributed by Mario Carneiro, 23-Jun-2015.)
Se Se

Theoremisose 5614 An isomorphism preserves set-like relations. (Contributed by Mario Carneiro, 23-Jun-2015.)
Se Se

Theoremisopolem 5615 Lemma for isopo 5616. (Contributed by Stefan O'Rear, 16-Nov-2014.)

Theoremisopo 5616 An isomorphism preserves partial ordering. (Contributed by Stefan O'Rear, 16-Nov-2014.)

Theoremisosolem 5617 Lemma for isoso 5618. (Contributed by Stefan O'Rear, 16-Nov-2014.)

Theoremisoso 5618 An isomorphism preserves strict ordering. (Contributed by Stefan O'Rear, 16-Nov-2014.)

Theoremf1oiso 5619* Any one-to-one onto function determines an isomorphism with an induced relation . Proposition 6.33 of [TakeutiZaring] p. 34. (Contributed by NM, 30-Apr-2004.)

Theoremf1oiso2 5620* Any one-to-one onto function determines an isomorphism with an induced relation . (Contributed by Mario Carneiro, 9-Mar-2013.)

2.6.9  Restricted iota (description binder)

Syntaxcrio 5621 Extend class notation with restricted description binder.

Definitiondf-riota 5622 Define restricted description binder. In case there is no unique such that holds, it evaluates to the empty set. See also comments for df-iota 4993. (Contributed by NM, 15-Sep-2011.) (Revised by Mario Carneiro, 15-Oct-2016.) (Revised by NM, 2-Sep-2018.)

Theoremriotaeqdv 5623* Formula-building deduction for iota. (Contributed by NM, 15-Sep-2011.)

Theoremriotabidv 5624* Formula-building deduction for restricted iota. (Contributed by NM, 15-Sep-2011.)

Theoremriotaeqbidv 5625* Equality deduction for restricted universal quantifier. (Contributed by NM, 15-Sep-2011.)

Theoremriotaexg 5626* Restricted iota is a set. (Contributed by Jim Kingdon, 15-Jun-2020.)

Theoremriotav 5627 An iota restricted to the universe is unrestricted. (Contributed by NM, 18-Sep-2011.)

Theoremriotauni 5628 Restricted iota in terms of class union. (Contributed by NM, 11-Oct-2011.)

Theoremnfriota1 5629* The abstraction variable in a restricted iota descriptor isn't free. (Contributed by NM, 12-Oct-2011.) (Revised by Mario Carneiro, 15-Oct-2016.)

Theoremnfriotadxy 5630* Deduction version of nfriota 5631. (Contributed by Jim Kingdon, 12-Jan-2019.)

Theoremnfriota 5631* A variable not free in a wff remains so in a restricted iota descriptor. (Contributed by NM, 12-Oct-2011.)

Theoremcbvriota 5632* Change bound variable in a restricted description binder. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)

Theoremcbvriotav 5633* Change bound variable in a restricted description binder. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)

Theoremcsbriotag 5634* Interchange class substitution and restricted description binder. (Contributed by NM, 24-Feb-2013.)

Theoremriotacl2 5635 Membership law for "the unique element in such that ."

(Contributed by NM, 21-Aug-2011.) (Revised by Mario Carneiro, 23-Dec-2016.)

Theoremriotacl 5636* Closure of restricted iota. (Contributed by NM, 21-Aug-2011.)

Theoremriotasbc 5637 Substitution law for descriptions. (Contributed by NM, 23-Aug-2011.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)

Theoremriotabidva 5638* Equivalent wff's yield equal restricted class abstractions (deduction form). (rabbidva 2608 analog.) (Contributed by NM, 17-Jan-2012.)

Theoremriotabiia 5639 Equivalent wff's yield equal restricted iotas (inference form). (rabbiia 2605 analog.) (Contributed by NM, 16-Jan-2012.)

Theoremriota1 5640* Property of restricted iota. Compare iota1 5007. (Contributed by Mario Carneiro, 15-Oct-2016.)

Theoremriota1a 5641 Property of iota. (Contributed by NM, 23-Aug-2011.)

Theoremriota2df 5642* A deduction version of riota2f 5643. (Contributed by NM, 17-Feb-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)

Theoremriota2f 5643* 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.)

Theoremriota2 5644* 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.)

Theoremriotaprop 5645* Properties of a restricted definite description operator. Todo (df-riota 5622 update): can some uses of riota2f 5643 be shortened with this? (Contributed by NM, 23-Nov-2013.)

Theoremriota5f 5646* A method for computing restricted iota. (Contributed by NM, 16-Apr-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)

Theoremriota5 5647* A method for computing restricted iota. (Contributed by NM, 20-Oct-2011.) (Revised by Mario Carneiro, 6-Dec-2016.)

Theoremriotass2 5648* Restriction of a unique element to a smaller class. (Contributed by NM, 21-Aug-2011.) (Revised by NM, 22-Mar-2013.)

Theoremriotass 5649* Restriction of a unique element to a smaller class. (Contributed by NM, 19-Oct-2005.) (Revised by Mario Carneiro, 24-Dec-2016.)

Theoremmoriotass 5650* Restriction of a unique element to a smaller class. (Contributed by NM, 19-Feb-2006.) (Revised by NM, 16-Jun-2017.)

Theoremsnriota 5651 A restricted class abstraction with a unique member can be expressed as a singleton. (Contributed by NM, 30-May-2006.)

Theoremeusvobj2 5652* 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.)

Theoremeusvobj1 5653* 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.)

Theoremf1ofveu 5654* There is one domain element for each value of a one-to-one onto function. (Contributed by NM, 26-May-2006.)

Theoremf1ocnvfv3 5655* 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.)

Theoremriotaund 5656* 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.)

Theoremacexmidlema 5657* Lemma for acexmid 5665. (Contributed by Jim Kingdon, 6-Aug-2019.)

Theoremacexmidlemb 5658* Lemma for acexmid 5665. (Contributed by Jim Kingdon, 6-Aug-2019.)

Theoremacexmidlemph 5659* Lemma for acexmid 5665. (Contributed by Jim Kingdon, 6-Aug-2019.)

Theoremacexmidlemab 5660* Lemma for acexmid 5665. (Contributed by Jim Kingdon, 6-Aug-2019.)

Theoremacexmidlemcase 5661* Lemma for acexmid 5665. 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 5030.

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.)

Theoremacexmidlem1 5662* Lemma for acexmid 5665. List the cases identified in acexmidlemcase 5661 and hook them up to the lemmas which handle each case. (Contributed by Jim Kingdon, 7-Aug-2019.)

Theoremacexmidlem2 5663* Lemma for acexmid 5665. This builds on acexmidlem1 5662 by noting that every element of is inhabited.

(Note that is not quite a function in the df-fun 5030 sense because it uses ordered pairs as described in opthreg 4385 rather than df-op 3459).

The set is also found in onsucelsucexmidlem 4358.

(Contributed by Jim Kingdon, 5-Aug-2019.)

Theoremacexmidlemv 5664* Lemma for acexmid 5665.

This is acexmid 5665 with additional distinct variable constraints, most notably between and .

(Contributed by Jim Kingdon, 6-Aug-2019.)

Theoremacexmid 5665* 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 nonempty 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.)

2.6.10  Operations

Syntaxco 5666 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.

Syntaxcoprab 5667 Extend class notation to include class abstraction (class builder) of nested ordered pairs.

Syntaxcmpt2 5668 Extend the definition of a class to include maps-to notation for defining an operation via a rule.

Definitiondf-ov 5669 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 5699 and ovprc2 5700. 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 5670. (Contributed by NM, 28-Feb-1995.)

Definitiondf-oprab 5670* 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 5669 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 5794. (Contributed by NM, 12-Mar-1995.)

Definitiondf-mpt2 5671* 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 3907 for two arguments. (Contributed by NM, 17-Feb-2008.)

Theoremoveq 5672 Equality theorem for operation value. (Contributed by NM, 28-Feb-1995.)

Theoremoveq1 5673 Equality theorem for operation value. (Contributed by NM, 28-Feb-1995.)

Theoremoveq2 5674 Equality theorem for operation value. (Contributed by NM, 28-Feb-1995.)

Theoremoveq12 5675 Equality theorem for operation value. (Contributed by NM, 16-Jul-1995.)

Theoremoveq1i 5676 Equality inference for operation value. (Contributed by NM, 28-Feb-1995.)

Theoremoveq2i 5677 Equality inference for operation value. (Contributed by NM, 28-Feb-1995.)

Theoremoveq12i 5678 Equality inference for operation value. (Contributed by NM, 28-Feb-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)

Theoremoveqi 5679 Equality inference for operation value. (Contributed by NM, 24-Nov-2007.)

Theoremoveq123i 5680 Equality inference for operation value. (Contributed by FL, 11-Jul-2010.)

Theoremoveq1d 5681 Equality deduction for operation value. (Contributed by NM, 13-Mar-1995.)

Theoremoveq2d 5682 Equality deduction for operation value. (Contributed by NM, 13-Mar-1995.)

Theoremoveqd 5683 Equality deduction for operation value. (Contributed by NM, 9-Sep-2006.)

Theoremoveq12d 5684 Equality deduction for operation value. (Contributed by NM, 13-Mar-1995.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)

Theoremoveqan12d 5685 Equality deduction for operation value. (Contributed by NM, 10-Aug-1995.)

Theoremoveqan12rd 5686 Equality deduction for operation value. (Contributed by NM, 10-Aug-1995.)

Theoremoveq123d 5687 Equality deduction for operation value. (Contributed by FL, 22-Dec-2008.)

Theoremfvoveq1d 5688 Equality deduction for nested function and operation value. (Contributed by AV, 23-Jul-2022.)

Theoremfvoveq1 5689 Equality theorem for nested function and operation value. Closed form of fvoveq1d 5688. (Contributed by AV, 23-Jul-2022.)

Theoremovanraleqv 5690* Equality theorem for a conjunction with an operation values within a restricted universal quantification. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 13-Aug-2022.)

Theoremimbrov2fvoveq 5691 Equality theorem for nested function and operation value in an implication for a binary relation. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 17-Aug-2022.)

Theoremnfovd 5692 Deduction version of bound-variable hypothesis builder nfov 5693. (Contributed by NM, 13-Dec-2005.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)

Theoremnfov 5693 Bound-variable hypothesis builder for operation value. (Contributed by NM, 4-May-2004.)

Theoremoprabidlem 5694* Slight elaboration of exdistrfor 1729. A lemma for oprabid 5695. (Contributed by Jim Kingdon, 15-Jan-2019.)

Theoremoprabid 5695 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 1445 to eliminate that constraint. (Contributed by Mario Carneiro, 20-Mar-2013.)

Theoremfnovex 5696 The result of an operation is a set. (Contributed by Jim Kingdon, 15-Jan-2019.)

Theoremovexg 5697 Evaluating a set operation at two sets gives a set. (Contributed by Jim Kingdon, 19-Aug-2021.)

Theoremovprc 5698 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.)

Theoremovprc1 5699 The value of an operation when the first argument is a proper class. (Contributed by NM, 16-Jun-2004.)

Theoremovprc2 5700 The value of an operation when the second argument is a proper class. (Contributed by Mario Carneiro, 26-Apr-2015.)

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12199
 Copyright terms: Public domain < Previous  Next >