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

Theorem spcgft 2803
Description: A closed version of spcgf 2808. (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 117 . . . 4 ((𝜑𝜓) → (𝜑𝜓))
21imim2i 12 . . 3 ((𝑥 = 𝐴 → (𝜑𝜓)) → (𝑥 = 𝐴 → (𝜑𝜓)))
32alimi 1443 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → ∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)))
4 spcimgft.1 . . 3 𝑥𝜓
5 spcimgft.2 . . 3 𝑥𝐴
64, 5spcimgft 2802 . 2 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
73, 6syl 14 1 (∀𝑥(𝑥 = 𝐴 → (𝜑𝜓)) → (𝐴𝐵 → (∀𝑥𝜑𝜓)))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 104  wal 1341   = wceq 1343  wnf 1448  wcel 2136  wnfc 2295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728
This theorem is referenced by:  spcgf  2808  rspct  2823
  Copyright terms: Public domain W3C validator