![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
Mirrors > Home > MPE Home > Th. List > spimv | Unicode version |
Description: A version of spim 2006 with a distinct variable requirement instead of a bound variable hypothesis. (Contributed by NM, 31-Jul-1993.) |
Ref | Expression |
---|---|
spimv.1 |
Ref | Expression |
---|---|
spimv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1707 | . 2 | |
2 | spimv.1 | . 2 | |
3 | 1, 2 | spim 2006 | 1 |
Colors of variables: wff setvar class |
Syntax hints: -> wi 4 A. wal 1393 |
This theorem is referenced by: spv 2011 aevOLD 2062 aevALT 2063 axc16i 2064 aev-o 2261 reu6 3288 el 4634 axc11next 31313 |
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-12 1854 ax-13 1999 |
This theorem depends on definitions: df-bi 185 df-an 371 df-ex 1613 df-nf 1617 |
Copyright terms: Public domain | W3C validator |