| 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 2907 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓)) |
| 3 | 2 | impcom 125 | 1 ⊢ ((∀𝑥 ∈ 𝐵 𝜑 ∧ 𝐴 ∈ 𝐵) → 𝜓) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 ∀wral 2511 |
| 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 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-v 2805 |
| This theorem is referenced by: disjne 3550 seex 4438 fconstfvm 5880 caofid0l 6271 caofid0r 6272 caofid1 6273 caofid2 6274 fvixp 6915 ordiso2 7277 eqord1 8705 eqord2 8706 seq3caopr2 10801 seqcaopr2g 10802 bccl 11075 2clim 11924 isummulc2 12050 telfsumo2 12091 fsumparts 12094 isumshft 12114 mertenslem2 12160 mertensabs 12161 dvdsprime 12757 mgmlrid 13525 grpinvalem 13531 grpinvex 13656 issubg2m 13839 issubg4m 13843 nmzbi 13859 cnima 15014 dich0 15446 2lgslem1a 15890 depindlem1 16430 depindlem2 16431 depindlem3 16432 dceqnconst 16776 dcapnconst 16777 |
| Copyright terms: Public domain | W3C validator |