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

Theorem abidnf 3246
 Description: Identity used to create closed-form versions of bound-variable hypothesis builders for class expressions. (Contributed by NM, 10-Nov-2005.) (Proof shortened by Mario Carneiro, 12-Oct-2016.)
Assertion
Ref Expression
abidnf
Distinct variable groups:   ,   ,
Allowed substitution hint:   ()

Proof of Theorem abidnf
StepHypRef Expression
1 sp 1912 . . 3
2 nfcr 2582 . . . 4
32nfrd 1928 . . 3
41, 3impbid2 207 . 2
54abbi1dv 2567 1
 Colors of variables: wff setvar class Syntax hints:   wi 4  wal 1435   wceq 1437   wcel 1870  cab 2414  wnfc 2577 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1751  ax-6 1797  ax-7 1841  ax-10 1889  ax-11 1894  ax-12 1907  ax-13 2055  ax-ext 2407 This theorem depends on definitions:  df-bi 188  df-an 372  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1790  df-clab 2415  df-cleq 2421  df-clel 2424  df-nfc 2579 This theorem is referenced by:  dedhb  3247  nfopd  4207  nfimad  5197  nffvd  5890
 Copyright terms: Public domain W3C validator