ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  spcimgft GIF version

Theorem spcimgft 2646
Description: A closed version of spcimgf 2650. (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 2583 . 2 (𝐴𝐵𝐴 ∈ V)
2 spcimgft.2 . . . . 5 𝑥𝐴
32issetf 2579 . . . 4 (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴)
4 exim 1506 . . . 4 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑𝜓)))
53, 4syl5bi 145 . . 3 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑𝜓)))
6 spcimgft.1 . . . 4 𝑥𝜓
7619.36-1 1579 . . 3 (∃𝑥(𝜑𝜓) → (∀𝑥𝜑𝜓))
85, 7syl6 33 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴 ∈ V → (∀𝑥𝜑𝜓)))
91, 8syl5 32 1 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
Colors of variables: wff set class
Syntax hints:  wi 4  wal 1257   = wceq 1259  wnf 1365  wex 1397  wcel 1409  wnfc 2181  Vcvv 2574
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576
This theorem is referenced by:  spcgft  2647  spcimgf  2650  spcimdv  2654
  Copyright terms: Public domain W3C validator