| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfeu1 | Structured version Visualization version GIF version | ||
| Description: Bound-variable hypothesis builder for uniqueness. See nfeu1ALT 2616 for a shorter proof using ax-12 2216. This proof illustrates the systematic way of proving nonfreeness in a defined expression: consider the definiens as a tree whose nodes are its subformulas, and prove by tree-induction the nonfreeness of each node, starting from the leaves (generally using nfv 1949 or nf* theorems for previously defined expressions) and up to the root. Here, the definiens is a conjunction of two previously defined expressions, which automatically yields the present proof. (Contributed by NM, 9-Jul-1994.) (Revised by Mario Carneiro, 7-Oct-2016.) (Revised by BJ, 2-Oct-2022.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| nfeu1 | ⊢ Ⅎ𝑥∃!𝑥𝜑 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-eu 2597 | . 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃*𝑥𝜑)) | |
| 2 | nfe1 2190 | . . 3 ⊢ Ⅎ𝑥∃𝑥𝜑 | |
| 3 | nfmo1 2585 | . . 3 ⊢ Ⅎ𝑥∃*𝑥𝜑 | |
| 4 | 2, 3 | nfan 1934 | . 2 ⊢ Ⅎ𝑥(∃𝑥𝜑 ∧ ∃*𝑥𝜑) |
| 5 | 1, 4 | nfxfr 1886 | 1 ⊢ Ⅎ𝑥∃!𝑥𝜑 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 ∃wex 1812 Ⅎwnf 1816 ∃*wmo 2565 ∃!weu 2596 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-10 2180 ax-11 2197 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-mo 2567 df-eu 2597 |
| This theorem is used by: eupicka 2662 2eu8 2686 nfreu1 3397 eusv2i 5363 eusv2nf 5364 reusv2lem3 5369 iota2 6554 sniota 6557 fv3 6934 eusvobj1 7444 opiota 8105 setrec2lem2 10013 dfac5lem5 10245 bnj1366 35570 bnj849 35666 pm14.24 45737 eu2ndop1stv 48529 tz6.12c-afv2 48646 |
| Copyright terms: Public domain | W3C validator |