| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rspsbc | Structured version Visualization version GIF 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 2088 and spsbc 3748. See also rspsbca 3824 and rspcsbela 4382. (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) |
| Ref | Expression |
|---|---|
| rspsbc | ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvralsvw 3303 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑) | |
| 2 | dfsbcq2 3738 | . . 3 ⊢ (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
| 3 | 2 | rspcv 3568 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑 → [𝐴 / 𝑥]𝜑)) |
| 4 | 1, 3 | biimtrid 244 | 1 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 [wsb 2080 ∈ wcel 2132 ∀wral 3066 [wsbc 3735 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-11 2181 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-tru 1553 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-ral 3067 df-sbc 3736 |
| This theorem is referenced by: rspsbca 3824 sbcth2 3828 rspcsbela 4382 riota5f 7366 riotass2 7368 fzrevral 13603 fprodcllemf 15960 rspcsbnea 42686 rspsbc2 45048 truniALT 45055 rspsbc2VD 45368 truniALTVD 45391 trintALTVD 45393 trintALT 45394 |
| Copyright terms: Public domain | W3C validator |