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

Theorem sbcangOLD 3371
 Description: Distribution of class substitution over conjunction. (Contributed by NM, 21-May-2004.) Obsolete as of 17-Aug-2018. Use sbcan 3370 instead. (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
sbcangOLD

Proof of Theorem sbcangOLD
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 dfsbcq2 3330 . 2
2 dfsbcq2 3330 . . 3
3 dfsbcq2 3330 . . 3
42, 3anbi12d 710 . 2
5 sban 2140 . 2
61, 4, 5vtoclbg 3168 1
 Colors of variables: wff setvar class Syntax hints:  ->wi 4  <->wb 184  /\wa 369  =wceq 1395  [wsb 1739  e.wcel 1818  [.wsbc 3327 This theorem is referenced by:  csbunigOLD  4278  csbxpgOLD  5087  csbingVD  33684  onfrALTlem5VD  33685  onfrALTlem4VD  33686  csbxpgVD  33694  csbunigVD  33698 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  ax-ext 2435 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-clab 2443  df-cleq 2449  df-clel 2452  df-v 3111  df-sbc 3328
 Copyright terms: Public domain W3C validator