Mathbox for BJ < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-sbeqALT Structured version   Unicode version

Theorem bj-sbeqALT 31031
 Description: Substitution in an equality (use the more genereal version bj-sbeq 31032 instead, without disjoint variable condition). (Contributed by BJ, 6-Oct-2018.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-sbeqALT
Distinct variable group:   ,
Allowed substitution hints:   (,)   (,)

Proof of Theorem bj-sbeqALT
StepHypRef Expression
1 nfcsb1v 3389 . . 3
2 nfcsb1v 3389 . . 3
31, 2nfeq 2575 . 2
4 csbeq1a 3382 . . 3
5 csbeq1a 3382 . . 3
64, 5eqeq12d 2424 . 2
73, 6sbie 2173 1
 Colors of variables: wff setvar class Syntax hints:   wb 184   wceq 1405  wsb 1763  csb 3373 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652  ax-5 1725  ax-6 1771  ax-7 1814  ax-10 1861  ax-11 1866  ax-12 1878  ax-13 2026  ax-ext 2380 This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-tru 1408  df-ex 1634  df-nf 1638  df-sb 1764  df-clab 2388  df-cleq 2394  df-clel 2397  df-nfc 2552  df-sbc 3278  df-csb 3374 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator