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

Theorem ac3 9862
Description: Axiom of Choice using abbreviations. The logical equivalence to ax-ac 9859 can be established by chaining aceq0 9522 and aceq2 9523. A standard textbook version of AC is derived from this one in dfac2a 9533, and this version of AC is derived from the textbook version in dfac2b 9534, showing their logical equivalence (see dfac2 9535).

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 nonempty 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 9059. The key theorem for this (used in the proof of dfac2b 9534) is preleq 9057. With this modified definition of ordered pair, it can be seen that 𝑦 is actually a choice function on the members of 𝑥.

For example, suppose 𝑥 = {{1, 2}, {1, 3}, {2, 3, 4}}. Let us try 𝑦 = {{{1, 2}, 1}, {{1, 3}, 1}, {{2, 3, 4}, 2}}. For the member (of 𝑥) 𝑧 = {1, 2}, the only assignment to 𝑤 and 𝑣 that satisfies the axiom is 𝑤 = 1 and 𝑣 = {{1, 2}, 1}, 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 {⟨{1, 2}, 1⟩, ⟨{1, 3}, 1⟩, ⟨{2, 3, 4}, 2⟩}. Of course other choices for 𝑦 will also satisfy the axiom, for example 𝑦 = {{{1, 2}, 2}, {{1, 3}, 1}, {{2, 3, 4}, 4}}. 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 9861 . 2 𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
2 aceq2 9523 . 2 (∃𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) ↔ ∃𝑦𝑧𝑥 (𝑧 ≠ ∅ → ∃!𝑤𝑧𝑣𝑦 (𝑧𝑣𝑤𝑣)))
31, 2mpbi 232 1 𝑦𝑧𝑥 (𝑧 ≠ ∅ → ∃!𝑤𝑧𝑣𝑦 (𝑧𝑣𝑤𝑣))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wex 1780  wne 3006  wral 3125  wrex 3126  ∃!wreu 3127  c0 4269
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-ac 9859
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-ral 3130  df-rex 3131  df-reu 3132  df-dif 3916  df-nul 4270
This theorem is referenced by:  axac2  9866
  Copyright terms: Public domain W3C validator