| 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 4480 fconstfvm 5933 caofid0l 6329 caofid0r 6330 caofid1 6331 caofid2 6332 fvixp 6985 ordiso2 7375 eqord1 8811 eqord2 8812 seq3caopr2 10930 seqcaopr2g 10931 bccl 11205 hashfibc 11283 2clim 12067 isummulc2 12193 telfsumo2 12234 fsumparts 12237 isumshft 12257 mertenslem2 12303 mertensabs 12304 dvdsprime 12900 ballotfilemfc0 13232 ballotfilemfcc 13233 mgmlrid 13699 grpinvalem 13705 grpinvex 13815 issubg2m 13992 issubg4m 13996 nmzbi 14012 cnima 15321 dich0 15753 2lgslem1a 16207 depindlem1 16747 depindlem2 16748 depindlem3 16749 dceqnconst 17110 dcapnconst 17111 |
| Copyright terms: Public domain | W3C validator |