| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rspsbc | Unicode version | ||
| Description: Restricted quantifier version of Axiom 4 of [Mendelson] p. 69. This provides an axiom for a predicate calculus for a restricted domain. This theorem generalizes the unrestricted stdpc4 1823 and spsbc 3044. See also rspsbca 3117 and rspcsbela . (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) |
| Ref | Expression |
|---|---|
| rspsbc |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvralsv 2784 |
. 2
| |
| 2 | dfsbcq2 3035 |
. . 3
| |
| 3 | 2 | rspcv 2907 |
. 2
|
| 4 | 1, 3 | biimtrid 152 |
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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-v 2805 df-sbc 3033 |
| This theorem is referenced by: rspsbca 3117 sbcth2 3121 rspcsbela 3188 riota5f 6008 riotass2 6010 fzrevral 10385 fprodcllemf 12237 ctiunctlemf 13122 |
| Copyright terms: Public domain | W3C validator |