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 3529. (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 232 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒)) |
4 | 1, 3 | spcimdv 3508 | 1 ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∀wal 1541 = wceq 1543 ∈ wcel 2110 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 |
This theorem depends on definitions: df-bi 210 df-an 400 df-tru 1546 df-ex 1788 df-sb 2071 df-clab 2715 df-clel 2816 |
This theorem is referenced by: spcgv 3511 mrissmrcd 17143 |
Copyright terms: Public domain | W3C validator |