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

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

Proof of Theorem spcgft
StepHypRef Expression
1 biimp 215 . . . 4 ((𝜑𝜓) → (𝜑𝜓))
21imim2i 16 . . 3 ((𝑥 = 𝐴 → (𝜑𝜓)) → (𝑥 = 𝐴 → (𝜑𝜓)))
32alimi 1808 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)))
4 spcimgfi1.1 . . 3 𝑥𝜓
5 spcimgfi1.2 . . 3 𝑥𝐴
64, 5spcimgfi1 3547 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
73, 6syl 17 1 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1535   = wceq 1537  wnf 1780  wcel 2106  wnfc 2888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1777  df-nf 1781  df-cleq 2727  df-clel 2814  df-nfc 2890
This theorem is referenced by:  spcgf  3591  rspct  3608
  Copyright terms: Public domain W3C validator