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

Theorem csbiedf 3173
 Description: Conversion of implicit substitution to explicit substitution into a class. (Contributed by Mario Carneiro, 13-Oct-2016.)
Hypotheses
Ref Expression
csbiedf.1
csbiedf.2
csbiedf.3
csbiedf.4
Assertion
Ref Expression
csbiedf
Distinct variable group:   ,
Allowed substitution hints:   ()   ()   ()   ()

Proof of Theorem csbiedf
StepHypRef Expression
1 csbiedf.1 . . 3
2 csbiedf.4 . . . 4
32ex 423 . . 3
41, 3alrimi 1765 . 2
5 csbiedf.3 . . 3
6 csbiedf.2 . . 3
7 csbiebt 3172 . . 3
85, 6, 7syl2anc 642 . 2
94, 8mpbid 201 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wa 358  wal 1540  wnf 1544   wceq 1642   wcel 1710  wnfc 2476  csb 3136 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-3an 936  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  df-sbc 3047  df-csb 3137 This theorem is referenced by:  csbied  3178  csbie2t  3180
 Copyright terms: Public domain W3C validator