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

Theorem spcgft 3535
 Description: A closed version of spcgf 3538. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
spcimgft.1 𝑥𝜓
spcimgft.2 𝑥𝐴
Assertion
Ref Expression
spcgft (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))

Proof of Theorem spcgft
StepHypRef Expression
1 biimp 218 . . . 4 ((𝜑𝜓) → (𝜑𝜓))
21imim2i 16 . . 3 ((𝑥 = 𝐴 → (𝜑𝜓)) → (𝑥 = 𝐴 → (𝜑𝜓)))
32alimi 1813 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)))
4 spcimgft.1 . . 3 𝑥𝜓
5 spcimgft.2 . . 3 𝑥𝐴
64, 5spcimgft 3534 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
73, 6syl 17 1 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1536   = wceq 1538  Ⅎwnf 1785   ∈ wcel 2111  Ⅎwnfc 2936 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-v 3443 This theorem is referenced by:  spcgf  3538  rspct  3557
 Copyright terms: Public domain W3C validator