Theorem rspsbc 3659

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 2490 and spsbc 3589. See also rspsbca 3660 and rspcsbela 4149. (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.)

Assertion

Ref	Expression
rspsbc	⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑))

Distinct variable group:   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥)   𝐴(𝑥)

Proof of Theorem rspsbc

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvralsv 3321	. 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑)
2		dfsbcq2 3579	. . 3 ⊢ (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
3	2	rspcv 3445	. 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑 → [𝐴 / 𝑥]𝜑))
4	1, 3	syl5bi 232	1 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑))

Syntax hints:   → wi 4  [wsb 2046   ∈ wcel 2139  ∀wral 3050  [wsbc 3576

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-v 3342  df-sbc 3577

This theorem is referenced by:  rspsbca  3660  sbcth2  3664  rspcsbela  4149  riota5f  6800  riotass2  6802  fzrevral  12638  fprodcllemf  14907  rspsbc2  39264  truniALT  39271  rspsbc2VD  39607  truniALTVD  39631  trintALTVD  39633  trintALT  39634