| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > spcgf | 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 2902 |
. 2
|
| 4 | spcgf.3 |
. 2
| |
| 5 | 3, 4 | mpg 1504 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 |
| This theorem is referenced by: spcgv 2912 rspc 2923 elabgt 2967 eusvnf 4594 mpofvex 6431 modom 7098 gropd 16202 grstructd2dom 16203 |
| Copyright terms: Public domain | W3C validator |