Theorem rspcdf 3558

Description: Restricted specialization, using implicit substitution. (Contributed by Emmett Weisz, 16-Jan-2020.)

Hypotheses

Ref	Expression
rspcdf.1	⊢ Ⅎ𝑥𝜑
rspcdf.2	⊢ Ⅎ𝑥𝜒
rspcdf.3	⊢ (𝜑 → 𝐴 ∈ 𝐵)
rspcdf.4	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
rspcdf	⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)   𝜒(𝑥)

Proof of Theorem rspcdf

Step	Hyp	Ref	Expression
1		rspcdf.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		rspcdf.4	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
3	2	ex 416	. . 3 ⊢ (𝜑 → (𝑥 = 𝐴 → (𝜓 ↔ 𝜒)))
4	1, 3	alrimi 2211	. 2 ⊢ (𝜑 → ∀𝑥(𝑥 = 𝐴 → (𝜓 ↔ 𝜒)))
5		rspcdf.3	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
6		rspcdf.2	. . 3 ⊢ Ⅎ𝑥𝜒
7	6	rspct 3557	. 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜓 ↔ 𝜒)) → (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)))
8	4, 5, 7	sylc 65	1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536   = wceq 1538  Ⅎwnf 1785   ∈ wcel 2111  ∀wral 3106

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-v 3443

This theorem is referenced by:  rspc2daf  30238