| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rspccva | GIF version | ||
| Description: Restricted specialization, using implicit substitution. (Contributed by NM, 26-Jul-2006.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) |
| Ref | Expression |
|---|---|
| rspcv.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| rspccva | ⊢ ((∀𝑥 ∈ 𝐵 𝜑 ∧ 𝐴 ∈ 𝐵) → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rspcv.1 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 2 | 1 | rspcv 2925 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓)) |
| 3 | 2 | impcom 125 | 1 ⊢ ((∀𝑥 ∈ 𝐵 𝜑 ∧ 𝐴 ∈ 𝐵) → 𝜓) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ 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: disjne 3578 seex 4482 fconstfvm 5936 caofid0l 6333 caofid0r 6334 caofid1 6335 caofid2 6336 fvixp 6989 ordiso2 7381 eqord1 8818 eqord2 8819 seq3caopr2 10951 seqcaopr2g 10952 bccl 11227 hashfibc 11305 2clim 12092 isummulc2 12218 telfsumo2 12259 fsumparts 12262 isumshft 12282 mertenslem2 12328 mertensabs 12329 dvdsprime 12925 ballotfilemfc0 13290 ballotfilemfcc 13291 mgmlrid 13758 grpinvalem 13764 grpinvex 13874 issubg2m 14051 issubg4m 14055 nmzbi 14071 cntzi 14162 cnima 15446 dich0 15878 2lgslem1a 16412 depindlem1 16952 depindlem2 16953 depindlem3 16954 dceqnconst 17317 dcapnconst 17318 |
| Copyright terms: Public domain | W3C validator |