![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
Mirrors > Home > MPE Home > Th. List > nfmod2 | Unicode version |
Description: Bound-variable hypothesis builder for "at most one." (Contributed by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
nfmod2.1 | |
nfmod2.2 |
Ref | Expression |
---|---|
nfmod2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mo 2287 | . 2 | |
2 | nfmod2.1 | . . . 4 | |
3 | nfmod2.2 | . . . 4 | |
4 | 2, 3 | nfexd2 2074 | . . 3 |
5 | 2, 3 | nfeud2 2296 | . . 3 |
6 | 4, 5 | nfimd 1917 | . 2 |
7 | 1, 6 | nfxfrd 1646 | 1 |
Colors of variables: wff setvar class |
Syntax hints: -. wn 3 -> wi 4
/\ wa 369 A. wal 1393 E. wex 1612
F/ wnf 1616 E! weu 2282 E* wmo 2283 |
This theorem is referenced by: nfmod 2299 nfrmod 3031 nfrmo 3033 nfdisj 4434 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1618 ax-4 1631 ax-5 1704 ax-6 1747 ax-7 1790 ax-10 1837 ax-11 1842 ax-12 1854 ax-13 1999 |
This theorem depends on definitions: df-bi 185 df-an 371 df-ex 1613 df-nf 1617 df-eu 2286 df-mo 2287 |
Copyright terms: Public domain | W3C validator |