| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > spcdv | Structured version Visualization version GIF version | ||
| Description: Rule of specialization, using implicit substitution. Analogous to rspcdv 3552. (Contributed by David Moews, 1-May-2017.) |
| Ref | Expression |
|---|---|
| spcimdv.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐵) |
| spcdv.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| spcdv | ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | spcimdv.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
| 2 | spcdv.2 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) | |
| 3 | 2 | biimpd 230 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒)) |
| 4 | 1, 3 | spcimdv 3531 | 1 ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1545 = wceq 1547 ∈ wcel 2119 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2718 df-clel 2814 |
| This theorem is referenced by: spcgv 3534 mrissmrcd 17598 usgrexmpl12ngric 48537 |
| Copyright terms: Public domain | W3C validator |