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

Theorem nfsbc1d 3284
 Description: Deduction version of nfsbc1 3285. (Contributed by NM, 23-May-2006.) (Revised by Mario Carneiro, 12-Oct-2016.)
Hypothesis
Ref Expression
nfsbc1d.2
Assertion
Ref Expression
nfsbc1d

Proof of Theorem nfsbc1d
StepHypRef Expression
1 df-sbc 3267 . 2
2 nfsbc1d.2 . . 3
3 nfab1 2593 . . . 4
43a1i 11 . . 3
52, 4nfeld 2599 . 2
61, 5nfxfrd 1696 1
 Colors of variables: wff setvar class Syntax hints:   wi 4  wnf 1666   wcel 1886  cab 2436  wnfc 2578  wsbc 3266 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1668  ax-4 1681  ax-5 1757  ax-6 1804  ax-7 1850  ax-10 1914  ax-11 1919  ax-12 1932  ax-13 2090  ax-ext 2430 This theorem depends on definitions:  df-bi 189  df-an 373  df-ex 1663  df-nf 1667  df-sb 1797  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2580  df-sbc 3267 This theorem is referenced by:  nfsbc1  3285  nfcsb1d  3376
 Copyright terms: Public domain W3C validator