| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nfmo1 | 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 2059 | . 2 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
| 2 | nfe1 1520 | . . 3 ⊢ Ⅎ𝑥∃𝑥𝜑 | |
| 3 | nfeu1 2066 | . . 3 ⊢ Ⅎ𝑥∃!𝑥𝜑 | |
| 4 | 2, 3 | nfim 1596 | . 2 ⊢ Ⅎ𝑥(∃𝑥𝜑 → ∃!𝑥𝜑) |
| 5 | 1, 4 | nfxfr 1498 | 1 ⊢ Ⅎ𝑥∃*𝑥𝜑 |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 Ⅎwnf 1484 ∃wex 1516 ∃!weu 2055 ∃*wmo 2056 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-4 1534 ax-ial 1558 ax-i5r 1559 |
| This theorem depends on definitions: df-bi 117 df-nf 1485 df-eu 2058 df-mo 2059 |
| This theorem is referenced by: moanmo 2132 euexex 2140 nfrmo1 2680 mob 2959 morex 2961 funimaexglem 5371 |
| Copyright terms: Public domain | W3C validator |