| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > euf | Structured version Visualization version GIF version | ||
| Description: Version of eu6 2595 with disjoint variable condition replaced by nonfreeness hypothesis. (Contributed by NM, 12-Aug-1993.) (Proof shortened by Wolf Lammen, 30-Oct-2018.) Avoid ax-13 2397. (Revised by Wolf Lammen, 16-Oct-2022.) |
| Ref | Expression |
|---|---|
| euf.1 | ⊢ Ⅎ𝑦𝜑 |
| Ref | Expression |
|---|---|
| euf | ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eu6 2595 | . 2 ⊢ (∃!𝑥𝜑 ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | |
| 2 | euf.1 | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
| 3 | nfv 1928 | . . . . 5 ⊢ Ⅎ𝑦 𝑥 = 𝑧 | |
| 4 | 2, 3 | nfbi 1917 | . . . 4 ⊢ Ⅎ𝑦(𝜑 ↔ 𝑥 = 𝑧) |
| 5 | 4 | nfal 2349 | . . 3 ⊢ Ⅎ𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑧) |
| 6 | nfv 1928 | . . 3 ⊢ Ⅎ𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑦) | |
| 7 | equequ2 2040 | . . . . 5 ⊢ (𝑧 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑥 = 𝑦)) | |
| 8 | 7 | bibi2d 344 | . . . 4 ⊢ (𝑧 = 𝑦 → ((𝜑 ↔ 𝑥 = 𝑧) ↔ (𝜑 ↔ 𝑥 = 𝑦))) |
| 9 | 8 | albidv 1934 | . . 3 ⊢ (𝑧 = 𝑦 → (∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑦))) |
| 10 | 5, 6, 9 | cbvexv1 2367 | . 2 ⊢ (∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧) ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| 11 | 1, 10 | bitri 277 | 1 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∀wal 1552 ∃wex 1793 Ⅎwnf 1797 ∃!weu 2589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-10 2169 ax-11 2185 ax-12 2206 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-tru 1557 df-ex 1794 df-nf 1798 df-mo 2560 df-eu 2590 |
| This theorem is referenced by: eu1 2631 |
| Copyright terms: Public domain | W3C validator |