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

Theorem zfac 9535
Description: Axiom of Choice expressed with the fewest number of different variables. The penultimate step shows the logical equivalence to ax-ac 9534. (New usage is discouraged.) (Contributed by NM, 14-Aug-2003.)
Assertion
Ref Expression
zfac 𝑥𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤))
Distinct variable group:   𝑥,𝑦,𝑧,𝑤

Proof of Theorem zfac
Dummy variables 𝑣 𝑢 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ax-ac 9534 . 2 𝑥𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑣𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣))
2 equequ2 2123 . . . . . . . . . 10 (𝑣 = 𝑤 → (𝑢 = 𝑣𝑢 = 𝑤))
32bibi2d 333 . . . . . . . . 9 (𝑣 = 𝑤 → ((∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣) ↔ (∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑤)))
4 elequ2 2169 . . . . . . . . . . . . 13 (𝑡 = 𝑤 → (𝑧𝑡𝑧𝑤))
54anbi2d 622 . . . . . . . . . . . 12 (𝑡 = 𝑤 → ((𝑢𝑧𝑧𝑡) ↔ (𝑢𝑧𝑧𝑤)))
6 elequ2 2169 . . . . . . . . . . . . 13 (𝑡 = 𝑤 → (𝑢𝑡𝑢𝑤))
7 elequ1 2162 . . . . . . . . . . . . 13 (𝑡 = 𝑤 → (𝑡𝑥𝑤𝑥))
86, 7anbi12d 624 . . . . . . . . . . . 12 (𝑡 = 𝑤 → ((𝑢𝑡𝑡𝑥) ↔ (𝑢𝑤𝑤𝑥)))
95, 8anbi12d 624 . . . . . . . . . . 11 (𝑡 = 𝑤 → (((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ ((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥))))
109cbvexvw 2137 . . . . . . . . . 10 (∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ ∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)))
1110bibi1i 329 . . . . . . . . 9 ((∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑤) ↔ (∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ 𝑢 = 𝑤))
123, 11syl6bb 278 . . . . . . . 8 (𝑣 = 𝑤 → ((∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣) ↔ (∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ 𝑢 = 𝑤)))
1312albidv 2015 . . . . . . 7 (𝑣 = 𝑤 → (∀𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣) ↔ ∀𝑢(∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ 𝑢 = 𝑤)))
14 elequ1 2162 . . . . . . . . . . . 12 (𝑢 = 𝑦 → (𝑢𝑧𝑦𝑧))
1514anbi1d 623 . . . . . . . . . . 11 (𝑢 = 𝑦 → ((𝑢𝑧𝑧𝑤) ↔ (𝑦𝑧𝑧𝑤)))
16 elequ1 2162 . . . . . . . . . . . 12 (𝑢 = 𝑦 → (𝑢𝑤𝑦𝑤))
1716anbi1d 623 . . . . . . . . . . 11 (𝑢 = 𝑦 → ((𝑢𝑤𝑤𝑥) ↔ (𝑦𝑤𝑤𝑥)))
1815, 17anbi12d 624 . . . . . . . . . 10 (𝑢 = 𝑦 → (((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ ((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥))))
1918exbidv 2016 . . . . . . . . 9 (𝑢 = 𝑦 → (∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ ∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥))))
20 equequ1 2122 . . . . . . . . 9 (𝑢 = 𝑦 → (𝑢 = 𝑤𝑦 = 𝑤))
2119, 20bibi12d 336 . . . . . . . 8 (𝑢 = 𝑦 → ((∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ 𝑢 = 𝑤) ↔ (∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
2221cbvalvw 2136 . . . . . . 7 (∀𝑢(∃𝑤((𝑢𝑧𝑧𝑤) ∧ (𝑢𝑤𝑤𝑥)) ↔ 𝑢 = 𝑤) ↔ ∀𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤))
2313, 22syl6bb 278 . . . . . 6 (𝑣 = 𝑤 → (∀𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣) ↔ ∀𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
2423cbvexvw 2137 . . . . 5 (∃𝑣𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣) ↔ ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤))
2524imbi2i 327 . . . 4 (((𝑦𝑧𝑧𝑤) → ∃𝑣𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣)) ↔ ((𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
26252albii 1915 . . 3 (∀𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑣𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣)) ↔ ∀𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
2726exbii 1943 . 2 (∃𝑥𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑣𝑢(∃𝑡((𝑢𝑧𝑧𝑡) ∧ (𝑢𝑡𝑡𝑥)) ↔ 𝑢 = 𝑣)) ↔ ∃𝑥𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤)))
281, 27mpbi 221 1 𝑥𝑦𝑧((𝑦𝑧𝑧𝑤) → ∃𝑤𝑦(∃𝑤((𝑦𝑧𝑧𝑤) ∧ (𝑦𝑤𝑤𝑥)) ↔ 𝑦 = 𝑤))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384  wal 1650  wex 1874
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2070  ax-7 2105  ax-8 2157  ax-9 2164  ax-ac 9534
This theorem depends on definitions:  df-bi 198  df-an 385  df-ex 1875
This theorem is referenced by:  axacndlem4  9685
  Copyright terms: Public domain W3C validator