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

Theorem ac2 9860
 Description: 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 9861 is easier to understand.) Note: aceq0 9521 shows the logical equivalence to ax-ac 9858. (New usage is discouraged.) (Contributed by NM, 18-Jul-1996.)
Assertion
Ref Expression
ac2 𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢

Proof of Theorem ac2
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 ax-ac 9858 . 2 𝑦𝑧𝑤((𝑧𝑤𝑤𝑥) → ∃𝑣𝑢(∃𝑡((𝑢𝑤𝑤𝑡) ∧ (𝑢𝑡𝑡𝑦)) ↔ 𝑢 = 𝑣))
2 aceq0 9521 . 2 (∃𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) ↔ ∃𝑦𝑧𝑤((𝑧𝑤𝑤𝑥) → ∃𝑣𝑢(∃𝑡((𝑢𝑤𝑤𝑡) ∧ (𝑢𝑡𝑡𝑦)) ↔ 𝑢 = 𝑣)))
31, 2mpbir 234 1 𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536  ∃wex 1781  ∀wral 3126  ∃wrex 3127  ∃!wreu 3128 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-ac 9858 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-cleq 2814  df-clel 2892  df-ral 3131  df-rex 3132  df-reu 3133 This theorem is referenced by:  ac3  9861
 Copyright terms: Public domain W3C validator