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

Theorem rspcdv2 3575
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
StepHypRef Expression
1 rspcdv2.3 . 2 (𝜑 → ∀𝑥 ∈ 𝐵 𝜓)
2 rspcdv2.2 . . 3 (𝜑 → 𝐴 ∈ 𝐵)
3 rspcdv2.1 . . 3 ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒))
42, 3rspcdv 3572 . 2 (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒))
51, 4mpd 16 1 (𝜑 → 𝜒)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080
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  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081
This theorem is used by:  frd  5615  ufdprmidl  34177  cantnf2  44588  imo72b2  45433
  Copyright terms: Public domain W3C validator