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

Theorem ac5 9299
Description: An Axiom of Choice equivalent: there exists a function 𝑓 (called a choice function) with domain 𝐴 that maps each nonempty member of the domain to an element of that member. Axiom AC of [BellMachover] p. 488. Note that the assertion that 𝑓 be a function is not necessary; see ac4 9297. (Contributed by NM, 29-Aug-1999.)
Hypothesis
Ref Expression
ac5.1 𝐴 ∈ V
Assertion
Ref Expression
ac5 𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥))
Distinct variable group:   𝑥,𝑓,𝐴

Proof of Theorem ac5
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ac5.1 . 2 𝐴 ∈ V
2 fneq2 5980 . . . 4 (𝑦 = 𝐴 → (𝑓 Fn 𝑦𝑓 Fn 𝐴))
3 raleq 3138 . . . 4 (𝑦 = 𝐴 → (∀𝑥𝑦 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥) ↔ ∀𝑥𝐴 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥)))
42, 3anbi12d 747 . . 3 (𝑦 = 𝐴 → ((𝑓 Fn 𝑦 ∧ ∀𝑥𝑦 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥)) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥))))
54exbidv 1850 . 2 (𝑦 = 𝐴 → (∃𝑓(𝑓 Fn 𝑦 ∧ ∀𝑥𝑦 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥)) ↔ ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥))))
6 dfac4 8945 . . 3 (CHOICE ↔ ∀𝑦𝑓(𝑓 Fn 𝑦 ∧ ∀𝑥𝑦 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥)))
76axaci 9290 . 2 𝑓(𝑓 Fn 𝑦 ∧ ∀𝑥𝑦 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥))
81, 5, 7vtocl 3259 1 𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥𝐴 (𝑥 ≠ ∅ → (𝑓𝑥) ∈ 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1483  wex 1704  wcel 1990  wne 2794  wral 2912  Vcvv 3200  c0 3915   Fn wfn 5883  cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-ac2 9285
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ac 8939
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator