| 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 2074 and spsbc 3742. See also rspsbca 3819 and rspcsbela 4379. (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) |
| Ref | Expression |
|---|---|
| rspsbc | ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvralsvw 3289 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑) | |
| 2 | dfsbcq2 3732 | . . 3 ⊢ (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
| 3 | 2 | rspcv 3561 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑 → [𝐴 / 𝑥]𝜑)) |
| 4 | 1, 3 | biimtrid 242 | 1 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 [wsb 2068 ∈ wcel 2114 ∀wral 3052 [wsbc 3729 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-11 2163 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-sbc 3730 |
| This theorem is referenced by: rspsbca 3819 sbcth2 3823 rspcsbela 4379 riota5f 7345 riotass2 7347 fzrevral 13557 fprodcllemf 15914 rspcsbnea 42584 rspsbc2 44979 truniALT 44986 rspsbc2VD 45299 truniALTVD 45322 trintALTVD 45324 trintALT 45325 |
| Copyright terms: Public domain | W3C validator |