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

Theorem spcgf 3504
Description: Rule of specialization, using implicit substitution. Compare Theorem 7.3 of [Quine] p. 44. (Contributed by NM, 2-Feb-1997.) (Revised by Andrew Salmon, 12-Aug-2011.)
Hypotheses
Ref Expression
spcgf.1 𝑥𝐴
spcgf.2 𝑥𝜓
spcgf.3 (𝑥 = 𝐴 → (𝜑𝜓))
Assertion
Ref Expression
spcgf (𝐴𝑉 → (∀𝑥𝜑𝜓))

Proof of Theorem spcgf
StepHypRef Expression
1 spcgf.2 . . 3 𝑥𝜓
2 spcgf.1 . . 3 𝑥𝐴
31, 2spcgft 3501 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝑉 → (∀𝑥𝜑𝜓)))
4 spcgf.3 . 2 (𝑥 = 𝐴 → (𝜑𝜓))
53, 4mpg 1898 1 (𝐴𝑉 → (∀𝑥𝜑𝜓))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 198  wal 1656   = wceq 1658  wnf 1884  wcel 2166  wnfc 2955
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-ext 2802
This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-clab 2811  df-cleq 2817  df-clel 2820  df-nfc 2957  df-v 3415
This theorem is referenced by:  spcegf  3505  spcgv  3509  rspc  3519  elabgt  3565  eusvnf  5091  gropd  26328  grstructd  26329
  Copyright terms: Public domain W3C validator