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

Theorem ac2 10499
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 10500 is easier to understand.) Note: aceq0 10156 shows the logical equivalence to ax-ac 10497. (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 10497 . 2 𝑦𝑧𝑤((𝑧𝑤𝑤𝑥) → ∃𝑣𝑢(∃𝑡((𝑢𝑤𝑤𝑡) ∧ (𝑢𝑡𝑡𝑦)) ↔ 𝑢 = 𝑣))
2 aceq0 10156 . 2 (∃𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢) ↔ ∃𝑦𝑧𝑤((𝑧𝑤𝑤𝑥) → ∃𝑣𝑢(∃𝑡((𝑢𝑤𝑤𝑡) ∧ (𝑢𝑡𝑡𝑦)) ↔ 𝑢 = 𝑣)))
31, 2mpbir 231 1 𝑦𝑧𝑥𝑤𝑧 ∃!𝑣𝑧𝑢𝑦 (𝑧𝑢𝑣𝑢)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wal 1535  wex 1776  wral 3059  wrex 3068  ∃!wreu 3376
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-ac 10497
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1777  df-nf 1781  df-mo 2538  df-eu 2567  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379
This theorem is referenced by:  ac3  10500
  Copyright terms: Public domain W3C validator