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 2071 and spsbc 3729. See also rspsbca 3813 and rspcsbela 4369. (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) |
Ref | Expression |
---|---|
rspsbc | ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvralsvw 3402 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑) | |
2 | dfsbcq2 3719 | . . 3 ⊢ (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
3 | 2 | rspcv 3557 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑 → [𝐴 / 𝑥]𝜑)) |
4 | 1, 3 | syl5bi 241 | 1 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 [wsb 2067 ∈ wcel 2106 ∀wral 3064 [wsbc 3716 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-sbc 3717 |
This theorem is referenced by: rspsbca 3813 sbcth2 3817 rspcsbela 4369 riota5f 7261 riotass2 7263 fzrevral 13341 fprodcllemf 15668 rspsbc2 42154 truniALT 42161 rspsbc2VD 42475 truniALTVD 42498 trintALTVD 42500 trintALT 42501 |
Copyright terms: Public domain | W3C validator |