Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  dfss3f Unicode version

Theorem dfss3f 2937
 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 2936 . 2
4 df-ral 2311 . 2
53, 4bitr4i 176 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 98  wal 1241   wcel 1393  wnfc 2165  wral 2306   wss 2917 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-in 2924  df-ss 2931 This theorem is referenced by:  nfss  2938
 Copyright terms: Public domain W3C validator