| 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 1828 and spsbc 3063. See also rspsbca 3136 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 2802 |
. 2
| |
| 2 | dfsbcq2 3054 |
. . 3
| |
| 3 | 2 | rspcv 2925 |
. 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 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-ral 2533 df-v 2823 df-sbc 3052 |
| This theorem is referenced by: rspsbca 3136 sbcth2 3140 rspcsbela 3207 riota5f 6055 riotass2 6057 fzrevral 10490 fprodcllemf 12358 ctiunctlemf 13307 |
| Copyright terms: Public domain | W3C validator |