MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  spcdv Structured version   Visualization version   GIF version

Theorem spcdv 3552
Description: Rule of specialization, using implicit substitution. Analogous to rspcdv 3572. (Contributed by David Moews, 1-May-2017.)
Hypotheses
Ref Expression
spcimdv.1 (𝜑 → 𝐴 ∈ 𝐵)
spcdv.2 ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
Assertion
Ref Expression
spcdv (𝜑 → (∀𝑥𝜓 → 𝜒))
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝜒,𝑥
Allowed substitution hints:   𝜓(𝑥)   𝐵(𝑥)

Proof of Theorem spcdv
StepHypRef Expression
1 spcimdv.1 . 2 (𝜑 → 𝐴 ∈ 𝐵)
2 spcdv.2 . . 3 ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
32biimpd 232 . 2 ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒))
41, 3spcimdv 3551 1 (𝜑 → (∀𝑥𝜓 → 𝜒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2147
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
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-clel 2839
This theorem is used by:  spcgv  3554  mrissmrcd  17840  usgrexmpl12ngric  49339
  Copyright terms: Public domain W3C validator