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

Theorem ac4 9180
Description: Equivalent of Axiom of Choice. We do not insist that 𝑓 be a function. However, theorem ac5 9182, 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 9196. (Contributed by NM, 21-Jul-1996.)

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

Proof of Theorem ac4
StepHypRef Expression
1 dfac3 8827 . 2 (CHOICE ↔ ∀𝑥𝑓𝑧𝑥 (𝑧 ≠ ∅ → (𝑓𝑧) ∈ 𝑧))
21axaci 9173 1 𝑓𝑧𝑥 (𝑧 ≠ ∅ → (𝑓𝑧) ∈ 𝑧)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wex 1695  wcel 1977  wne 2780  wral 2896  c0 3874  cfv 5804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-ac2 9168
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ac 8822
This theorem is referenced by:  ac4c  9181
  Copyright terms: Public domain W3C validator