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 3612. (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 3589 | 1 ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∀wal 1526 = wceq 1528 ∈ wcel 2105 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1772 df-cleq 2811 df-clel 2890 |
This theorem is referenced by: spcgv 3592 mrissmrcd 16899 |
Copyright terms: Public domain | W3C validator |