| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mo | Structured version Visualization version GIF version | ||
| Description: Equivalent definitions of "there exists at most one". (Contributed by NM, 7-Aug-1994.) (Revised by Mario Carneiro, 7-Oct-2016.) (Proof shortened by Wolf Lammen, 2-Dec-2018.) |
| Ref | Expression |
|---|---|
| mo.nf | ⊢ Ⅎ𝑦𝜑 |
| Ref | Expression |
|---|---|
| mo | ⊢ (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mo.nf | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 2 | 1 | mof 2589 | . 2 ⊢ (∃*𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) |
| 3 | 1 | mo3 2590 | . 2 ⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) |
| 4 | 2, 3 | bitr3i 279 | 1 ⊢ (∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦) ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∀wal 1557 ∃wex 1798 Ⅎwnf 1802 [wsb 2089 ∃*wmo 2563 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-10 2174 ax-11 2190 ax-12 2211 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 |
| This theorem is referenced by: bj-snsetex 37408 |
| Copyright terms: Public domain | W3C validator |