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

Theorem sbidmOLD 2157
Description: Obsolete proof of sbidm 2156 as of 13-Jul-2019. (Contributed by NM, 30-Jun-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
sbidmOLD

Proof of Theorem sbidmOLD
StepHypRef Expression
1 equsb2 2108 . . 3
2 sbequ12r 1993 . . . 4
32sbimi 1745 . . 3
41, 3ax-mp 5 . 2
5 sbbi 2142 . 2
64, 5mpbi 208 1
Colors of variables: wff setvar class
Syntax hints:  <->wb 184  [wsb 1739
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-10 1837  ax-12 1854  ax-13 1999
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-ex 1613  df-nf 1617  df-sb 1740
  Copyright terms: Public domain W3C validator