Theorem rspcdv2 3571

Description: Restricted specialization, using implicit substitution. (Contributed by Stanislas Polu, 9-Mar-2020.)

Hypotheses

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

Assertion

Ref	Expression
rspcdv2	⊢ (𝜑 → 𝜒)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜒,𝑥   𝜑,𝑥

Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem rspcdv2

Step	Hyp	Ref	Expression
1		rspcdv2.3	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 𝜓)
2		rspcdv2.2	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵)
3		rspcdv2.1	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
4	2, 3	rspcdv 3568	. 2 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒))
5	1, 4	mpd 16	1 ⊢ (𝜑 → 𝜒)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077

This theorem is used by:  frd  5612  ufdprmidl  33951  cantnf2  44166  imo72b2  45012