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

Theorem spcimgft 3548
Description: A closed version of spcimgf 3550. (Contributed by Mario Carneiro, 4-Jan-2017.)
Hypotheses
Ref Expression
spcimgft.1 𝑥𝜓
spcimgft.2 𝑥𝐴
Assertion
Ref Expression
spcimgft (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))

Proof of Theorem spcimgft
StepHypRef Expression
1 elex 3465 . 2 (𝐴𝐵𝐴 ∈ V)
2 spcimgft.2 . . . . 5 𝑥𝐴
32issetf 3461 . . . 4 (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
4 exim 1837 . . . 4 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑𝜓)))
53, 4biimtrid 241 . . 3 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑𝜓)))
6 spcimgft.1 . . . 4 𝑥𝜓
7619.36 2224 . . 3 (∃𝑥(𝜑𝜓) ↔ (∀𝑥𝜑𝜓))
85, 7syl6ib 251 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴 ∈ V → (∀𝑥𝜑𝜓)))
91, 8syl5 34 1 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1540   = wceq 1542  wex 1782  wnf 1786  wcel 2107  wnfc 2884  Vcvv 3447
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-v 3449
This theorem is referenced by:  spcgft  3549  spcimgf  3550  ss2iundf  42023  spcdvw  47214
  Copyright terms: Public domain W3C validator