Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfmo1 | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for "at most one." (Contributed by NM, 8-Mar-1995.) (Revised by Mario Carneiro, 7-Oct-2016.) |
Ref | Expression |
---|---|
nfmo1 | ⊢ Ⅎ𝑥∃*𝑥𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 2463 | . 2 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
2 | nfe1 2014 | . . 3 ⊢ Ⅎ𝑥∃𝑥𝜑 | |
3 | nfeu1 2468 | . . 3 ⊢ Ⅎ𝑥∃!𝑥𝜑 | |
4 | 2, 3 | nfim 1813 | . 2 ⊢ Ⅎ𝑥(∃𝑥𝜑 → ∃!𝑥𝜑) |
5 | 1, 4 | nfxfr 1771 | 1 ⊢ Ⅎ𝑥∃*𝑥𝜑 |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∃wex 1695 Ⅎwnf 1699 ∃!weu 2458 ∃*wmo 2459 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 |
This theorem depends on definitions: df-bi 196 df-or 384 df-tru 1478 df-ex 1696 df-nf 1701 df-eu 2462 df-mo 2463 |
This theorem is referenced by: mo3 2495 moanmo 2520 mopick2 2528 moexex 2529 2mo 2539 2eu3 2543 nfrmo1 3090 mob 3355 morex 3357 wl-mo3t 32537 |
Copyright terms: Public domain | W3C validator |