Theorem spcdv 3548

Description: Rule of specialization, using implicit substitution. Analogous to rspcdv 3568. (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

Step	Hyp	Ref	Expression
1		spcimdv.1	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
2		spcdv.2	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
3	2	biimpd 232	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒))
4	1, 3	spcimdv 3547	1 ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2144

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-clel 2835

This theorem is used by:  spcgv  3550  mrissmrcd  17814  usgrexmpl12ngric  49136