| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rspccv | GIF version | ||
| Description: Restricted specialization, using implicit substitution. (Contributed by NM, 2-Feb-2006.) |
| Ref | Expression |
|---|---|
| rspcv.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| rspccv | ⊢ (∀𝑥 ∈ 𝐵 𝜑 → (𝐴 ∈ 𝐵 → 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rspcv.1 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 2 | 1 | rspcv 2925 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓)) |
| 3 | 2 | com12 30 | 1 ⊢ (∀𝑥 ∈ 𝐵 𝜑 → (𝐴 ∈ 𝐵 → 𝜓)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∀wral 2528 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-v 2823 |
| This theorem is used by: elinti 3979 ofrval 6313 supubti 7339 suplubti 7340 suplocsrlempr 8174 pitonn 8215 peano5uzti 9754 zindd 9764 1arith 13146 basis2 15149 tg2 15161 mopni 15583 metrest 15607 metcnpi 15616 metcnpi2 15617 plycj 15862 eupthseg 16693 decidi 16823 sumdc2 16827 |
| Copyright terms: Public domain | W3C validator |