Theorem spcdv 2815

Description: Rule of specialization, using implicit substitution. Analogous to rspcdv 2837. (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 143	. 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒))
4	1, 3	spcimdv 2814	1 ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1346   = wceq 1348   ∈ wcel 2141

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732

This theorem is referenced by: (None)