| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rspsbc | 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 1824 and spsbc 3056. See also rspsbca 3129 and rspcsbela . (Contributed by NM, 17-Nov-2006.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) |
| Ref | Expression |
|---|---|
| rspsbc | ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbvralsv 2796 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑) | |
| 2 | dfsbcq2 3047 | . . 3 ⊢ (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑)) | |
| 3 | 2 | rspcv 2919 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑦 ∈ 𝐵 [𝑦 / 𝑥]𝜑 → [𝐴 / 𝑥]𝜑)) |
| 4 | 1, 3 | biimtrid 152 | 1 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → [𝐴 / 𝑥]𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 [wsb 1811 ∈ wcel 2205 ∀wral 2522 [wsbc 3044 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ral 2527 df-v 2817 df-sbc 3045 |
| This theorem is referenced by: rspsbca 3129 sbcth2 3133 rspcsbela 3200 riota5f 6032 riotass2 6034 fzrevral 10446 fprodcllemf 12307 ctiunctlemf 13210 |
| Copyright terms: Public domain | W3C validator |