Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ac3 Structured version   Unicode version

Theorem ac3 8347
 Description: Axiom of Choice using abbreviations. The logical equivalence to ax-ac 8344 can be established by chaining aceq0 8004 and aceq2 8005. A standard textbook version of AC is derived from this one in dfac2a 8015, and this version of AC is derived from the textbook version in dfac2 8016. 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 7576. The key theorem for this (used in the proof of dfac2 8016) is preleq 7575. 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.)
Assertion
Ref Expression
ac3
Distinct variable group:   ,,,,

Proof of Theorem ac3
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 ac2 8346 . 2
2 aceq2 8005 . 2
31, 2mpbi 201 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 360  wex 1551   wne 2601  wral 2707  wrex 2708  wreu 2709  c0 3630 This theorem is referenced by:  axac2  8351 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-ac 8344 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-reu 2714  df-v 2960  df-dif 3325  df-nul 3631
 Copyright terms: Public domain W3C validator