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

Theorem dfss3f 3265
 Description: Equivalence for subclass relation, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 20-Mar-2004.)
Hypotheses
Ref Expression
dfss2f.1
dfss2f.2
Assertion
Ref Expression
dfss3f

Proof of Theorem dfss3f
StepHypRef Expression
1 dfss2f.1 . . 3
2 dfss2f.2 . . 3
31, 2dfss2f 3264 . 2
4 df-ral 2619 . 2
53, 4bitr4i 243 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176  wal 1540   wcel 1710  wnfc 2476  wral 2614   wss 3257 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-nan 1288  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-ral 2619  df-v 2861  df-nin 3211  df-compl 3212  df-in 3213  df-ss 3259 This theorem is referenced by:  nfss  3266
 Copyright terms: Public domain W3C validator