Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axacndlem3 | Structured version Visualization version GIF version |
Description: Lemma for the Axiom of Choice with no distinct variable conditions. (Contributed by NM, 3-Jan-2002.) |
Ref | Expression |
---|---|
axacndlem3 | ⊢ (∀𝑦 𝑦 = 𝑧 → ∃𝑥∀𝑦∀𝑧(∀𝑥(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → ∃𝑤∀𝑦(∃𝑤((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) ∧ (𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) ↔ 𝑦 = 𝑤))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfae 2447 | . . . 4 ⊢ Ⅎ𝑧∀𝑦 𝑦 = 𝑧 | |
2 | simpl 483 | . . . . . 6 ⊢ ((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → 𝑦 ∈ 𝑧) | |
3 | 2 | alimi 1803 | . . . . 5 ⊢ (∀𝑥(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → ∀𝑥 𝑦 ∈ 𝑧) |
4 | nd3 9999 | . . . . . 6 ⊢ (∀𝑦 𝑦 = 𝑧 → ¬ ∀𝑥 𝑦 ∈ 𝑧) | |
5 | 4 | pm2.21d 121 | . . . . 5 ⊢ (∀𝑦 𝑦 = 𝑧 → (∀𝑥 𝑦 ∈ 𝑧 → ∃𝑤∀𝑦(∃𝑤((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) ∧ (𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) ↔ 𝑦 = 𝑤))) |
6 | 3, 5 | syl5 34 | . . . 4 ⊢ (∀𝑦 𝑦 = 𝑧 → (∀𝑥(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → ∃𝑤∀𝑦(∃𝑤((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) ∧ (𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) ↔ 𝑦 = 𝑤))) |
7 | 1, 6 | alrimi 2203 | . . 3 ⊢ (∀𝑦 𝑦 = 𝑧 → ∀𝑧(∀𝑥(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → ∃𝑤∀𝑦(∃𝑤((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) ∧ (𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) ↔ 𝑦 = 𝑤))) |
8 | 7 | axc4i 2332 | . 2 ⊢ (∀𝑦 𝑦 = 𝑧 → ∀𝑦∀𝑧(∀𝑥(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → ∃𝑤∀𝑦(∃𝑤((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) ∧ (𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) ↔ 𝑦 = 𝑤))) |
9 | 8 | 19.8ad 2171 | 1 ⊢ (∀𝑦 𝑦 = 𝑧 → ∃𝑥∀𝑦∀𝑧(∀𝑥(𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) → ∃𝑤∀𝑦(∃𝑤((𝑦 ∈ 𝑧 ∧ 𝑧 ∈ 𝑤) ∧ (𝑦 ∈ 𝑤 ∧ 𝑤 ∈ 𝑥)) ↔ 𝑦 = 𝑤))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1526 ∃wex 1771 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-13 2381 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 ax-reg 9044 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-v 3494 df-dif 3936 df-un 3938 df-nul 4289 df-sn 4558 df-pr 4560 |
This theorem is referenced by: axacndlem5 10021 axacnd 10022 |
Copyright terms: Public domain | W3C validator |