| 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 2906 | . 2 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜑 → 𝜓)) |
| 3 | 2 | impcom 125 | 1 ⊢ ((∀𝑥 ∈ 𝐵 𝜑 ∧ 𝐴 ∈ 𝐵) → 𝜓) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ∀wral 2510 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-v 2804 |
| This theorem is referenced by: disjne 3548 seex 4432 fconstfvm 5871 caofid0l 6261 caofid0r 6262 caofid1 6263 caofid2 6264 fvixp 6871 ordiso2 7233 eqord1 8662 eqord2 8663 seq3caopr2 10754 seqcaopr2g 10755 bccl 11028 2clim 11861 isummulc2 11986 telfsumo2 12027 fsumparts 12030 isumshft 12050 mertenslem2 12096 mertensabs 12097 dvdsprime 12693 mgmlrid 13461 grpinvalem 13467 grpinvex 13592 issubg2m 13775 issubg4m 13779 nmzbi 13795 cnima 14943 dich0 15375 2lgslem1a 15816 dceqnconst 16664 dcapnconst 16665 |
| Copyright terms: Public domain | W3C validator |