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

Theorem spcimgft 3571
Description: A closed version of spcimgf 3573. (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 3487 . 2 (𝐴𝐵𝐴 ∈ V)
2 spcimgft.2 . . . . 5 𝑥𝐴
32issetf 3483 . . . 4 (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
4 exim 1828 . . . 4 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑𝜓)))
53, 4biimtrid 241 . . 3 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑𝜓)))
6 spcimgft.1 . . . 4 𝑥𝜓
7619.36 2215 . . 3 (∃𝑥(𝜑𝜓) ↔ (∀𝑥𝜑𝜓))
85, 7imbitrdi 250 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴 ∈ V → (∀𝑥𝜑𝜓)))
91, 8syl5 34 1 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1531   = wceq 1533  wex 1773  wnf 1777  wcel 2098  wnfc 2877  Vcvv 3468
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-tru 1536  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-v 3470
This theorem is referenced by:  spcgft  3572  spcimgf  3573  ss2iundf  42991  spcdvw  48003
  Copyright terms: Public domain W3C validator