New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  spcgft Unicode version

Theorem spcgft 2931
 Description: A closed version of spcgf 2934. (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 bi1 178 . . . 4
21imim2i 13 . . 3
32alimi 1559 . 2
4 spcimgft.1 . . 3
5 spcimgft.2 . . 3
64, 5spcimgft 2930 . 2
73, 6syl 15 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176  wal 1540  wnf 1544   wceq 1642   wcel 1710  wnfc 2476 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-v 2861 This theorem is referenced by:  spcgf  2934  rspct  2948
 Copyright terms: Public domain W3C validator