ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  rspsbc GIF version

Theorem rspsbc 3045
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 1775 and spsbc 2974. See also rspsbca 3046 and rspcsbela . (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.
StepHypRef Expression
1 cbvralsv 2719 . 2 (∀𝑥𝐵 𝜑 ↔ ∀𝑦𝐵 [𝑦 / 𝑥]𝜑)
2 dfsbcq2 2965 . . 3 (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑[𝐴 / 𝑥]𝜑))
32rspcv 2837 . 2 (𝐴𝐵 → (∀𝑦𝐵 [𝑦 / 𝑥]𝜑[𝐴 / 𝑥]𝜑))
41, 3biimtrid 152 1 (𝐴𝐵 → (∀𝑥𝐵 𝜑[𝐴 / 𝑥]𝜑))
Colors of variables: wff set class
Syntax hints:  wi 4  [wsb 1762  wcel 2148  wral 2455  [wsbc 2962
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2739  df-sbc 2963
This theorem is referenced by:  rspsbca  3046  sbcth2  3050  rspcsbela  3116  riota5f  5848  riotass2  5850  fzrevral  10078  fprodcllemf  11592  ctiunctlemf  12409
  Copyright terms: Public domain W3C validator