Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > spcgf | Structured version Visualization version Unicode version |
Description: Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by NM, 2-Feb-1997.) (Revised by Andrew Salmon, 12-Aug-2011.) |
Ref | Expression |
---|---|
spcgf.1 | |
spcgf.2 | |
spcgf.3 |
Ref | Expression |
---|---|
spcgf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | spcgf.2 | . . 3 | |
2 | spcgf.1 | . . 3 | |
3 | 1, 2 | spcgft 3285 | . 2 |
4 | spcgf.3 | . 2 | |
5 | 3, 4 | mpg 1724 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wal 1481 wceq 1483 wnf 1708 wcel 1990 wnfc 2751 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-v 3202 |
This theorem is referenced by: spcegf 3289 spcgv 3293 rspc 3303 elabgt 3347 eusvnf 4861 gropd 25923 grstructd 25924 |
Copyright terms: Public domain | W3C validator |