![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ac2 | Structured version Visualization version GIF version |
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 10471 is easier to understand.) Note: aceq0 10127 shows the logical equivalence to ax-ac 10468. (New usage is discouraged.) (Contributed by NM, 18-Jul-1996.) |
Ref | Expression |
---|---|
ac2 | ⊢ ∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax-ac 10468 | . 2 ⊢ ∃𝑦∀𝑧∀𝑤((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → ∃𝑣∀𝑢(∃𝑡((𝑢 ∈ 𝑤 ∧ 𝑤 ∈ 𝑡) ∧ (𝑢 ∈ 𝑡 ∧ 𝑡 ∈ 𝑦)) ↔ 𝑢 = 𝑣)) | |
2 | aceq0 10127 | . 2 ⊢ (∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) ↔ ∃𝑦∀𝑧∀𝑤((𝑧 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥) → ∃𝑣∀𝑢(∃𝑡((𝑢 ∈ 𝑤 ∧ 𝑤 ∈ 𝑡) ∧ (𝑢 ∈ 𝑡 ∧ 𝑡 ∈ 𝑦)) ↔ 𝑢 = 𝑣))) | |
3 | 1, 2 | mpbir 230 | 1 ⊢ ∃𝑦∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑧 ∃!𝑣 ∈ 𝑧 ∃𝑢 ∈ 𝑦 (𝑧 ∈ 𝑢 ∧ 𝑣 ∈ 𝑢) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∀wal 1532 ∃wex 1774 ∀wral 3056 ∃wrex 3065 ∃!wreu 3369 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-ac 10468 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-ex 1775 df-nf 1779 df-mo 2529 df-eu 2558 df-cleq 2719 df-clel 2805 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 |
This theorem is referenced by: ac3 10471 |
Copyright terms: Public domain | W3C validator |