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

Theorem ac4 10455
Description: Equivalent of Axiom of Choice. We do not insist that 𝑓 be a function. However, Theorem ac5 10457, derived from this one, shows that this form of the axiom does imply that at least one such set 𝑓 whose existence we assert is in fact a function. Axiom of Choice of [TakeutiZaring] p. 83.

Takeuti and Zaring call this "weak choice" in contrast to "strong choice" 𝐹𝑧(𝑧 ≠ ∅ → (𝐹𝑧) ∈ 𝑧), which asserts the existence of a universal choice function but requires second-order quantification on (proper) class variable 𝐹 and thus cannot be expressed in our first-order formalization. However, it has been shown that ZF plus strong choice is a conservative extension of ZF plus weak choice. See Ulrich Felgner, "Comparison of the axioms of local and universal choice", Fundamenta Mathematica, 71, 43-62 (1971).

Weak choice can be strengthened in a different direction to choose from a collection of proper classes; see ac6s5 10471. (Contributed by NM, 21-Jul-1996.)

Assertion
Ref Expression
ac4 𝑓𝑧𝑥 (𝑧 ≠ ∅ → (𝑓𝑧) ∈ 𝑧)
Distinct variable group:   𝑥,𝑧,𝑓

Proof of Theorem ac4
StepHypRef Expression
1 dfac3 10101 . 2 (CHOICE ↔ ∀𝑥𝑓𝑧𝑥 (𝑧 ≠ ∅ → (𝑓𝑧) ∈ 𝑧))
21axaci 10448 1 𝑓𝑧𝑥 (𝑧 ≠ ∅ → (𝑓𝑧) ∈ 𝑧)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wex 1806  wcel 2149  wne 2964  wral 3085  c0 4294  cfv 6534
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730  ax-ac2 10443
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6490  df-fun 6536  df-fn 6537  df-f 6538  df-fv 6542  df-ac 10096
This theorem is referenced by:  ac4c  10456
  Copyright terms: Public domain W3C validator