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

Theorem spimt 1974
Description: Closed theorem form of spim 1975. (Contributed by NM, 15-Jan-2008.) (Revised by Mario Carneiro, 17-Oct-2016.)
Assertion
Ref Expression
spimt  F/

Proof of Theorem spimt
StepHypRef Expression
1 nfnf1 1790 . . . . 5  F/ F/
2 nfa1 1788 . . . . 5  F/
31, 2nfan 1824 . . . 4  F/ F/
4 sp 1747 . . . . . . 7
54adantl 452 . . . . . 6  F/
6 nfr 1761 . . . . . . 7  F/
76adantr 451 . . . . . 6  F/
85, 7embantd 50 . . . . 5  F/
98imim2d 48 . . . 4  F/
103, 9alimd 1764 . . 3  F/
1110impancom 427 . 2  F/
12 ax9o 1950 . 2
1311, 12syl6 29 1  F/
Colors of variables: wff setvar class
Syntax hints:   wi 4   wa 358  wal 1540   F/wnf 1544
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 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
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545
This theorem is referenced by:  spim  1975  equveli  1988
  Copyright terms: Public domain W3C validator