Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfmo | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for the at-most-one quantifier. Note that 𝑥 and 𝑦 need not be disjoint. Usage of this theorem is discouraged because it depends on ax-13 2372. Use the weaker nfmov 2560 when possible. (Contributed by NM, 9-Mar-1995.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nfmo.1 | ⊢ Ⅎ𝑥𝜑 |
Ref | Expression |
---|---|
nfmo | ⊢ Ⅎ𝑥∃*𝑦𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1807 | . . 3 ⊢ Ⅎ𝑦⊤ | |
2 | nfmo.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
3 | 2 | a1i 11 | . . 3 ⊢ (⊤ → Ⅎ𝑥𝜑) |
4 | 1, 3 | nfmod 2561 | . 2 ⊢ (⊤ → Ⅎ𝑥∃*𝑦𝜑) |
5 | 4 | mptru 1546 | 1 ⊢ Ⅎ𝑥∃*𝑦𝜑 |
Colors of variables: wff setvar class |
Syntax hints: ⊤wtru 1540 Ⅎwnf 1786 ∃*wmo 2538 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-10 2137 ax-11 2154 ax-12 2171 ax-13 2372 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-mo 2540 |
This theorem is referenced by: moexex 2640 2moex 2642 2euex 2643 |
Copyright terms: Public domain | W3C validator |