Home | Metamath
Proof Explorer Theorem List (p. 83 of 325) | < Previous Next > |
Browser slow? Try the
Unicode version. |
Color key: | Metamath Proof Explorer
(1-22374) |
Hilbert Space Explorer
(22375-23897) |
Users' Mathboxes
(23898-32447) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | isfin32i 8201 | One half of isfin3-2 8203. (Contributed by Mario Carneiro, 3-Jun-2015.) |
Fin^{III} ^{*} | ||
Theorem | isf33lem 8202* | Lemma for isfin3-3 8204. (Contributed by Stefan O'Rear, 17-May-2015.) |
Fin^{III} | ||
Theorem | isfin3-2 8203 | Weakly Dedekind-infinite sets are exactly those which can be mapped onto . (Contributed by Stefan O'Rear, 6-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
Fin^{III} ^{*} | ||
Theorem | isfin3-3 8204* | Weakly Dedekind-infinite sets are exactly those with an -indexed descending chain of subsets. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Fin^{III} | ||
Theorem | fin33i 8205* | Inference from isfin3-3 8204. (This is actually a bit stronger than isfin3-3 8204 because it does not assume is a set and does not use the Axiom of Infinity either.) (Contributed by Mario Carneiro, 17-May-2015.) |
Fin^{III} | ||
Theorem | compsscnvlem 8206* | Lemma for compsscnv 8207. (Contributed by Mario Carneiro, 17-May-2015.) |
Theorem | compsscnv 8207* | Complementation on a power set lattice is an involution. (Contributed by Mario Carneiro, 17-May-2015.) |
Theorem | isf34lem1 8208* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | isf34lem2 8209* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | compssiso 8210* | Complementation is an antiautomorphism on power set lattices. (Contributed by Stefan O'Rear, 4-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
[] [] | ||
Theorem | isf34lem3 8211* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Theorem | compss 8212* | Express image under of the complementation isomorphism. (Contributed by Stefan O'Rear, 5-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
Theorem | isf34lem4 8213* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Theorem | isf34lem5 8214* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Theorem | isf34lem7 8215* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Fin^{III} | ||
Theorem | isf34lem6 8216* | Lemma for isfin3-4 8218. (Contributed by Stefan O'Rear, 7-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{III} | ||
Theorem | fin34i 8217* | Inference from isfin3-4 8218. (Contributed by Mario Carneiro, 17-May-2015.) |
Fin^{III} | ||
Theorem | isfin3-4 8218* | Weakly Dedekind-infinite sets are exactly those with an -indexed ascending chain of subsets. (Contributed by Stefan O'Rear, 7-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
Fin^{III} | ||
Theorem | fin11a 8219 | Every I-finite set is Ia-finite. (Contributed by Stefan O'Rear, 30-Oct-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{Ia} | ||
Theorem | enfin1ai 8220 | Ia-finiteness is a cardinal property. (Contributed by Mario Carneiro, 18-May-2015.) |
Fin^{Ia} Fin^{Ia} | ||
Theorem | isfin1-2 8221 | A set is finite in the usual sense iff the power set of its power set is Dedekind finite. (Contributed by Stefan O'Rear, 3-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{IV} | ||
Theorem | isfin1-3 8222 | A set is I-finite iff every system of subsets contains a maximal subset. Definition I of [Levy58] p. 2. (Contributed by Stefan O'Rear, 4-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
[] | ||
Theorem | isfin1-4 8223 | A set is I-finite iff every system of subsets contains a minimal subset. (Contributed by Stefan O'Rear, 4-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
[] | ||
Theorem | dffin1-5 8224 | Compact quantifier-free version of the standard definition df-fin 7072. (Contributed by Stefan O'Rear, 6-Jan-2015.) |
Theorem | fin23 8225 |
Every II-finite set (every chain of subsets has a maximal element) is
III-finite (has no denumerable collection of subsets). The proof here
is the only one I could find, from
http://matwbn.icm.edu.pl/ksiazki/fm/fm6/fm619.pdf
p.94 (writeup by
Tarski, credited to Kuratowski). Translated into English and modern
notation, the proof proceeds as follows (variables renamed for
uniqueness):
Suppose for a contradiction that is a set which is II-finite but not III-finite. For any countable sequence of distinct subsets of , we can form a decreasing sequence of non-empty subsets by taking finite intersections of initial segments of while skipping over any element of which would cause the intersection to be empty. By II-finiteness (as fin2i2 8154) this sequence contains its intersection, call it ; since by induction every subset in the sequence is non-empty, the intersection must be non-empty. Suppose that an element of has non-empty intersection with . Thus, said element has a non-empty intersection with the corresponding element of , therefore it was used in the construction of and all further elements of are subsets of , thus contains the . That is, all elements of either contain or are disjoint from it. Since there are only two cases, there must exist an infinite subset of which uniformly either contain or are disjoint from it. In the former case we can create an infinite set by subtracting from each element. In either case, call the result ; this is an infinite set of subsets of , each of which is disjoint from and contained in the union of ; the union of is strictly contained in the union of , because only the latter is a superset of the non-empty set . The preceeding four steps may be iterated a countable number of times starting from the assumed denumerable set of subsets to produce a denumerable sequence of the sets from each stage. Great caution is required to avoid ax-dc 8282 here; in particular an effective version of the pigeonhole principle (for aleph-null pigeons and 2 holes) is required. Since a denumerable set of subsets is assumed to exist, we can conclude without the axiom. This sequence is strictly decreasing, thus it has no minimum, contradicting the first assumption. (Contributed by Stefan O'Rear, 2-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
Fin^{II} Fin^{III} | ||
Theorem | fin34 8226 | Every III-finite set is IV-finite. (Contributed by Stefan O'Rear, 30-Oct-2014.) |
Fin^{III} Fin^{IV} | ||
Theorem | isfin5-2 8227 | Alternate definition of V-finite which emphasizes the idempotent behavior of V-infinite sets. (Contributed by Stefan O'Rear, 30-Oct-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{V} | ||
Theorem | fin45 8228 | Every IV-finite set is V-finite: if we can pack two copies of the set into itself, we can certainly leave space. (Contributed by Stefan O'Rear, 30-Oct-2014.) (Proof shortened by Mario Carneiro, 18-May-2015.) |
Fin^{IV} Fin^{V} | ||
Theorem | fin56 8229 | Every V-finite set is VI-finite because multiplication dominates addition for cardinals. (Contributed by Stefan O'Rear, 29-Oct-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{V} Fin^{VI} | ||
Theorem | fin17 8230 | Every I-finite set is VII-finite. (Contributed by Mario Carneiro, 17-May-2015.) |
Fin^{VII} | ||
Theorem | fin67 8231 | Every VI-finite set is VII-finite. (Contributed by Stefan O'Rear, 29-Oct-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{VI} Fin^{VII} | ||
Theorem | isfin7-2 8232 | A set is VII-finite iff it is non-well-orderable or finite. (Contributed by Mario Carneiro, 17-May-2015.) |
Fin^{VII} | ||
Theorem | fin71num 8233 | A well-orderable set is VII-finite iff it is I-finite. Thus, even without choice, on the class of well-orderable sets all eight definitions of finite set coincide. (Contributed by Mario Carneiro, 18-May-2015.) |
Fin^{VII} | ||
Theorem | dffin7-2 8234 | Class form of isfin7-2 8232. (Contributed by Mario Carneiro, 17-May-2015.) |
Fin^{VII} | ||
Theorem | dfacfin7 8235 | Axiom of Choice equivalent: the VII-finite sets are the same as I-finite sets. (Contributed by Mario Carneiro, 18-May-2015.) |
CHOICE Fin^{VII} | ||
Theorem | fin1a2lem1 8236 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | fin1a2lem2 8237 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | fin1a2lem3 8238 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | fin1a2lem4 8239 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | fin1a2lem5 8240 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | fin1a2lem6 8241 | Lemma for fin1a2 8251. Establish that can be broken into two equipollent pieces. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Theorem | fin1a2lem7 8242* | Lemma for fin1a2 8251. Split a III-infinite set in two pieces. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Fin^{III} Fin^{III} Fin^{III} | ||
Theorem | fin1a2lem8 8243* | Lemma for fin1a2 8251. Split a III-infinite set in two pieces. (Contributed by Stefan O'Rear, 7-Nov-2014.) |
Fin^{III} Fin^{III} Fin^{III} | ||
Theorem | fin1a2lem9 8244* | Lemma for fin1a2 8251. In a chain of finite sets, initial segments are finite. (Contributed by Stefan O'Rear, 8-Nov-2014.) |
[] | ||
Theorem | fin1a2lem10 8245 | Lemma for fin1a2 8251. A nonempty finite union of members of a chain is a member of the chain. (Contributed by Stefan O'Rear, 8-Nov-2014.) |
[] | ||
Theorem | fin1a2lem11 8246* | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 8-Nov-2014.) |
[] | ||
Theorem | fin1a2lem12 8247 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 8-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
[] Fin^{III} | ||
Theorem | fin1a2lem13 8248 | Lemma for fin1a2 8251. (Contributed by Stefan O'Rear, 8-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
[] Fin^{II} | ||
Theorem | fin12 8249 | Weak theorem which skips Ia but has a trivial proof, needed to prove fin1a2 8251. (Contributed by Stefan O'Rear, 8-Nov-2014.) (Revised by Mario Carneiro, 17-May-2015.) |
Fin^{II} | ||
Theorem | fin1a2s 8250* | An II-infinite set can have an I-infinite part broken off and remain II-infinite. (Contributed by Stefan O'Rear, 8-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
Fin^{II} Fin^{II} | ||
Theorem | fin1a2 8251 | Every Ia-finite set is II-finite. Theorem 1 of [Levy58], p. 3. (Contributed by Stefan O'Rear, 8-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.) |
Fin^{Ia} Fin^{II} | ||
Theorem | itunifval 8252* | Function value of iterated unions. EDITORIAL: The iterated unions and order types of ordered sets are split out here because they could concievably be independently useful. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | itunifn 8253* | Functionality of the iterated union. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | ituni0 8254* | A zero-fold iterated union. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | itunisuc 8255* | Successor iterated union. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | itunitc1 8256* | Each union iterate is a member of the transitive closure. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | itunitc 8257* | The union of all union iterates creates the transitive closure; compare trcl 7620. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | ituniiun 8258* | Unwrap an iterated union from the "other end". (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | hsmexlem7 8259* | Lemma for hsmex 8268. Properties of the recurrent sequence of ordinals. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
har har har | ||
Theorem | hsmexlem8 8260* | Lemma for hsmex 8268. Properties of the recurrent sequence of ordinals. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
har har har | ||
Theorem | hsmexlem9 8261* | Lemma for hsmex 8268. Properties of the recurrent sequence of ordinals. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
har har | ||
Theorem | hsmexlem1 8262 | Lemma for hsmex 8268. Bound the order type of a limited-cardinality set of ordinals. (Contributed by Stefan O'Rear, 14-Feb-2015.) (Revised by Mario Carneiro, 26-Jun-2015.) |
OrdIso ^{*} har | ||
Theorem | hsmexlem2 8263* | Lemma for hsmex 8268. Bound the order type of a union of sets of ordinals, each of limited order type. Vaguely reminiscent of unictb 8406 but use of order types allows to canonically choose the sub-bijections, removing the choice requirement. (Contributed by Stefan O'Rear, 14-Feb-2015.) (Revised by Mario Carneiro, 26-Jun-2015.) |
OrdIso OrdIso har | ||
Theorem | hsmexlem3 8264* | Lemma for hsmex 8268. Clear hypothesis and extend previous result by dominance. Note that this could be substantially strengthened, e.g. using the weak Hartogs function, but all we need here is that there be *some* dominating ordinal. (Contributed by Stefan O'Rear, 14-Feb-2015.) (Revised by Mario Carneiro, 26-Jun-2015.) |
OrdIso OrdIso ^{*} har | ||
Theorem | hsmexlem4 8265* | Lemma for hsmex 8268. The core induction, establishing bounds on the order types of iterated unions of the initial set. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
har har OrdIso | ||
Theorem | hsmexlem5 8266* | Lemma for hsmex 8268. Combining the above constraints, along with itunitc 8257 and tcrank 7764, gives an effective constraint on the rank of . (Contributed by Stefan O'Rear, 14-Feb-2015.) |
har har OrdIso har | ||
Theorem | hsmexlem6 8267* | Lemmr for hsmex 8268. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
har har OrdIso | ||
Theorem | hsmex 8268* | The collection of hereditarily size-limited well-founded sets comprise a set. The proof is that of Randall Holmes at http://math.boisestate.edu/~holmes/holmes/hereditary.pdf, with modifications to use Hartogs' theorem instead of the weak variant (inconsequentially weakening some intermediate results), and making the well-foundedness condition explicit to avoid a direct dependence on ax-reg 7516. (Contributed by Stefan O'Rear, 14-Feb-2015.) |
Theorem | hsmex2 8269* | The set of hereditary size-limited sets, assuming ax-reg 7516. (Contributed by Stefan O'Rear, 11-Feb-2015.) |
Theorem | hsmex3 8270* | The set of hereditary size-limited sets, assuming ax-reg 7516, using strict comparison (an easy corrolary by separation). (Contributed by Stefan O'Rear, 11-Feb-2015.) |
In this section we add the Axiom of Choice ax-ac 8295, as well as weaker forms such as the axiom of countable choice ax-cc 8271 and dependent choice ax-dc 8282. We introduce these weaker forms so that theorems that do not need the full power of the axiom of choice, but need more than simple ZF, can use these intermediate axioms instead. The combination of the Zermel-Fraenkel axioms and the axiom of choice is often abbreviated as ZFC. The axiom of choice is widely accepted, and ZFC is the most commonly-accepted fundamental set of axioms for mathematics. However, there have been and still are some lingering controversies about the Axiom of Choice. The axiom of choice does not satisfy those who wish to have a constructive proof (e.g., it will not satify intuitionist logic). Thus, we make it easy to identify which proofs depend on the axiom of choice or its weaker forms. | ||
Axiom | ax-cc 8271* | The axiom of countable choice (CC), also known as the axiom of denumerable choice. It is clearly a special case of ac5 8313, but is weak enough that it can be proven using DC (see axcc 8294). It is, however, strictly stronger than ZF and cannot be proven in ZF. It states that any countable collection of non-empty sets must have a choice function. (Contributed by Mario Carneiro, 9-Feb-2013.) |
Theorem | axcc2lem 8272* | Lemma for axcc2 8273. (Contributed by Mario Carneiro, 8-Feb-2013.) |
Theorem | axcc2 8273* | A possibly more useful version of ax-cc using sequences instead of countable sets. The Axiom of Infinity is needed to prove this, and indeed this implies the Axiom of Infinity. (Contributed by Mario Carneiro, 8-Feb-2013.) |
Theorem | axcc3 8274* | A possibly more useful version of ax-cc 8271 using sequences instead of countable sets. The Axiom of Infinity is needed to prove this, and indeed this implies the Axiom of Infinity. (Contributed by Mario Carneiro, 8-Feb-2013.) (Revised by Mario Carneiro, 26-Dec-2014.) |
Theorem | axcc4 8275* | A version of axcc3 8274 that uses wffs instead of classes. (Contributed by Mario Carneiro, 7-Apr-2013.) |
Theorem | acncc 8276 | An ax-cc 8271 equivalent: every set has choice sets of length . (Contributed by Mario Carneiro, 31-Aug-2015.) |
AC | ||
Theorem | axcc4dom 8277* | Relax the constraint on axcc4 8275 to dominance instead of equinumerosity. (Contributed by Mario Carneiro, 18-Jan-2014.) |
Theorem | domtriomlem 8278* | Lemma for domtriom 8279. (Contributed by Mario Carneiro, 9-Feb-2013.) |
Theorem | domtriom 8279 | Trichotomy of equinumerosity for , proven using CC. Equivalently, all Dedekind-finite sets (as in isfin4-2 8150) are finite in the usual sense and conversely. (Contributed by Mario Carneiro, 9-Feb-2013.) |
Theorem | fin41 8280 | Under countable choice, the IV-finite sets (Dedekind-finite) coincide with I-finite (finite in the usual sense) sets. (Contributed by Mario Carneiro, 16-May-2015.) |
Fin^{IV} | ||
Theorem | dominf 8281 | A nonempty set that is a subset of its union is infinite. This version is proved from ax-cc 8271. See dominfac 8404 for a version proved from ax-ac 8295. The axiom of Regularity is used for this proof, via inf3lem6 7544, and its use is necessary: otherwise the set or (where the second example even has nonempty well-founded part) provides a counterexample. (Contributed by Mario Carneiro, 9-Feb-2013.) |
Axiom | ax-dc 8282* | Dependent Choice. Axiom DC1 of [Schechter] p. 149. This theorem is weaker than the Axiom of Choice but is stronger than Countable Choice. It shows the existence of a sequence whose values can only be shown to exist (but cannot be constructed explicitly) and also depend on earlier values in the sequence. Dependent choice is equivalent to the statement that every (nonempty) pruned tree has a branch. This axiom is redundant in ZFC; see axdc 8357. But ZF+DC is strictly weaker than ZF+AC, so this axiom provides for theorems that do not need the full power of AC. (Contributed by Mario Carneiro, 25-Jan-2013.) |
Theorem | dcomex 8283 | The Axiom of Dependent Choice implies Infinity, the way we have stated it. Thus, we have Inf+AC implies DC and DC implies Inf, but AC does not imply Inf. (Contributed by Mario Carneiro, 25-Jan-2013.) |
Theorem | axdc2lem 8284* | Lemma for axdc2 8285. We construct a relation based on such that iff , and show that the "function" described by ax-dc 8282 can be restricted so that it is a real function (since the stated properties only show that it is the superset of a function). (Contributed by Mario Carneiro, 25-Jan-2013.) (Revised by Mario Carneiro, 26-Jun-2015.) |
Theorem | axdc2 8285* | An apparent strengthening of ax-dc 8282 (but derived from it) which shows that there is a denumerable sequence for any function that maps elements of a set to nonempty subsets of such that for all . The finitistic version of this can be proven by induction, but the infinite version requires this new axiom. (Contributed by Mario Carneiro, 25-Jan-2013.) |
Theorem | axdc3lem 8286* | The class of finite approximations to the DC sequence is a set. (We derive here the stronger statement that is a subset of a specific set, namely .) (Unnecessary distinct variable restrictions were removed by David Abernethy, 18-Mar-2014.) (Contributed by Mario Carneiro, 27-Jan-2013.) (Revised by Mario Carneiro, 18-Mar-2014.) |
Theorem | axdc3lem2 8287* | Lemma for axdc3 8290. We have constructed a "candidate set" , which consists of all finite sequences that satisfy our property of interest, namely on its domain, but with the added constraint that . These sets are possible "initial segments" of the infinite sequence satisfying these constraints, but we can leverage the standard ax-dc 8282 (with no initial condition) to select a sequence of ever-lengthening finite sequences, namely (for some integer ). We let our "choice" function select a sequence whose domain is one more than the last one, and agrees with the previous one on its domain. Thus, the application of vanilla ax-dc 8282 yields a sequence of sequences whose domains increase without bound, and whose union is a function which has all the properties we want. In this lemma, we show that given the sequence , we can construct the sequence that we are after. (Contributed by Mario Carneiro, 30-Jan-2013.) |
Theorem | axdc3lem3 8288* | Simple substitution lemma for axdc3 8290. (Contributed by Mario Carneiro, 27-Jan-2013.) |
Theorem | axdc3lem4 8289* | Lemma for axdc3 8290. We have constructed a "candidate set" , which consists of all finite sequences that satisfy our property of interest, namely on its domain, but with the added constraint that . These sets are possible "initial segments" of the infinite sequence satisfying these constraints, but we can leverage the standard ax-dc 8282 (with no initial condition) to select a sequence of ever-lengthening finite sequences, namely (for some integer ). We let our "choice" function select a sequence whose domain is one more than the last one, and agrees with the previous one on its domain. Thus, the application of vanilla ax-dc 8282 yields a sequence of sequences whose domains increase without bound, and whose union is a function which has all the properties we want. In this lemma, we show that is nonempty, and that always maps to a nonempty subset of , so that we can apply axdc2 8285. See axdc3lem2 8287 for the rest of the proof. (Contributed by Mario Carneiro, 27-Jan-2013.) |
Theorem | axdc3 8290* | Dependent Choice. Axiom DC1 of [Schechter] p. 149, with the addition of an initial value . This theorem is weaker than the Axiom of Choice but is stronger than Countable Choice. It shows the existence of a sequence whose values can only be shown to exist (but cannot be constructed explicitly) and also depend on earlier values in the sequence. (Contributed by Mario Carneiro, 27-Jan-2013.) |
Theorem | axdc4lem 8291* | Lemma for axdc4 8292. (Contributed by Mario Carneiro, 31-Jan-2013.) (Revised by Mario Carneiro, 16-Nov-2013.) |
Theorem | axdc4 8292* | A more general version of axdc3 8290 that allows the function to vary with . (Contributed by Mario Carneiro, 31-Jan-2013.) |
Theorem | axcclem 8293* | Lemma for axcc 8294. (Contributed by Mario Carneiro, 2-Feb-2013.) (Revised by Mario Carneiro, 16-Nov-2013.) |
Theorem | axcc 8294* | Although CC can be proven trivially using ac5 8313, we prove it here using DC. (New usage is discouraged.) (Contributed by Mario Carneiro, 2-Feb-2013.) |
Axiom | ax-ac 8295* |
Axiom of Choice. The Axiom of Choice (AC) is usually considered an
extension of ZF set theory rather than a proper part of it. It is
sometimes considered philosophically controversial because it asserts
the existence of a set without telling us what the set is. ZF set
theory that includes AC is called ZFC.
The unpublished version given here says that given any set , there exists a that is a collection of unordered pairs, one pair for each non-empty member of . One entry in the pair is the member of , and the other entry is some arbitrary member of that member of . See the rewritten version ac3 8298 for a more detailed explanation. Theorem ac2 8297 shows an equivalent written compactly with restricted quantifiers. This version was specifically crafted to be short when expanded to primitives. Kurt Maes' 5-quantifier version ackm 8301 is slightly shorter when the biconditional of ax-ac 8295 is expanded into implication and negation. In axac3 8300 we allow the constant CHOICE to represent the Axiom of Choice; this simplifies the representation of theorems like gchac 8504 (the Generalized Continuum Hypothesis implies the Axiom of Choice). Standard textbook versions of AC are derived as ac8 8328, ac5 8313, and ac7 8309. The Axiom of Regularity ax-reg 7516 (among others) is used to derive our version from the standard ones; this reverse derivation is shown as theorem dfac2 7967. Equivalents to AC are the well-ordering theorem weth 8331 and Zorn's lemma zorn 8343. See ac4 8311 for comments about stronger versions of AC. In order to avoid uses of ax-reg 7516 for derivation of AC equivalents, we provide ax-ac2 8299 (due to Kurt Maes), which is equivalent to the standard AC of textbooks. The derivation of ax-ac2 8299 from ax-ac 8295 is shown by theorem axac2 8302, and the reverse derivation by axac 8303. Therefore, new proofs should normally use ax-ac2 8299 instead. (New usage is discouraged.) (Contributed by NM, 18-Jul-1996.) |
Theorem | zfac 8296* | Axiom of Choice expressed with the fewest number of different variables. The penultimate step shows the logical equivalence to ax-ac 8295. (New usage is discouraged.) (Contributed by NM, 14-Aug-2003.) |
Theorem | ac2 8297* | Axiom of Choice equivalent. By using restricted quantifiers, we can express the Axiom of Choice with a single explicit conjunction. (If you want to figure it out, the rewritten equivalent ac3 8298 is easier to understand.) Note: aceq0 7955 shows the logical equivalence to ax-ac 8295. (New usage is discouraged.) (Contributed by NM, 18-Jul-1996.) |
Theorem | ac3 8298* |
Axiom of Choice using abbreviations. The logical equivalence to ax-ac 8295
can be established by chaining aceq0 7955 and aceq2 7956. A standard
textbook version of AC is derived from this one in dfac2a 7966, and this
version of AC is derived from the textbook version in dfac2 7967.
The following sketch will help you understand this version of the axiom. Given any set , the axiom says that there exists a that is a collection of unordered pairs, one pair for each non-empty member of . One entry in the pair is the member of , and the other entry is some arbitrary member of that member of . Using the Axiom of Regularity, we can show that is really a set of ordered pairs, very similar to the ordered pair construction opthreg 7529. The key theorem for this (used in the proof of dfac2 7967) is preleq 7528. With this modified definition of ordered pair, it can be seen that is actually a choice function on the members of . For example, suppose . Let us try . For the member (of ) , the only assignment to and that satisfies the axiom is and , so there is exactly one as required. We verify the other two members of similarly. Thus, satisfies the axiom. Using our modified ordered pair definition, we can say that corresponds to the choice function . Of course other choices for will also satisfy the axiom, for example . What AC tells us is that there exists at least one such , but it doesn't tell us which one. (New usage is discouraged.) (Contributed by NM, 19-Jul-1996.) |
Axiom | ax-ac2 8299* | In order to avoid uses of ax-reg 7516 for derivation of AC equivalents, we provide ax-ac2 8299, which is equivalent to the standard AC of textbooks. This appears to be the shortest known equivalent to the standard AC when expressed in terms of set theory primitives. It was found by Kurt Maes as theorem ackm 8301. We removed the leading quantifier to make it slightly shorter, since we have ax-gen 1552 available. The derivation of ax-ac2 8299 from ax-ac 8295 is shown by theorem axac2 8302, and the reverse derivation by axac 8303. Note that we use ax-reg 7516 to derive ax-ac 8295 from ax-ac2 8299, but not to derive ax-ac2 8299 from ax-ac 8295. (Contributed by NM, 19-Dec-2016.) |
Theorem | axac3 8300 | This theorem asserts that the constant CHOICE is a theorem, thus eliminating it as a hypothesis while assuming ax-ac2 8299 as an axiom. (Contributed by Mario Carneiro, 6-May-2015.) (Revised by NM, 20-Dec-2016.) (Proof modification is discouraged.) |
CHOICE |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |