| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > spcv | Structured version Visualization version GIF version | ||
| Description: Rule of specialization, using implicit substitution. (Contributed by NM, 22-Jun-1994.) |
| Ref | Expression |
|---|---|
| spcv.1 | ⊢ 𝐴 ∈ V |
| spcv.2 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| spcv | ⊢ (∀𝑥𝜑 → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | spcv.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | spcv.2 | . . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 3 | 2 | spcgv 3554 | . 2 ⊢ (𝐴 ∈ V → (∀𝑥𝜑 → 𝜓)) |
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ (∀𝑥𝜑 → 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∈ wcel 2147 Vcvv 3454 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 |
| This theorem is used by: morex 3680 al0ssb 5265 rext 5420 relop 5834 dfpo2 6317 frxp 8165 frxp2 8188 findcard 9207 pssnn 9212 ssfi 9216 fiint 9346 marypha1lem 9452 dfom3 9675 elom3 9676 ttrclss 9748 setrec2fun 10000 aceq3lem 10226 dfac3 10227 dfac5lem4 10232 dfac8 10241 dfac9 10242 dfacacn 10247 dfac13 10248 kmlem1 10256 kmlem10 10265 fin23lem34 10451 fin23lem35 10452 zorn2lem7 10607 zornn0g 10610 axgroth6 10940 nnunb 12629 symggen 19714 gsumval3lem2 20150 gsumzaddlem 20165 ssdifidlprm 21672 dfac14 23967 i1fd 26032 chlimi 31866 zarclssn 34575 ddemeas 34939 dfac16 35846 acwer1prclem 35851 onvf1odlem2 36032 elpssmo 36636 dfon2lem4 36726 dfon2lem5 36727 dfon2lem7 36729 ttac 44236 dfac11 44257 dfac21 44261 nregmodel 46202 |
| Copyright terms: Public domain | W3C validator |