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

Theorem sb6x 2029
Description: Equivalence involving substitution for a variable not free. (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 4-Oct-2016.)
Hypothesis
Ref Expression
sb6x.1  F/
Assertion
Ref Expression
sb6x

Proof of Theorem sb6x
StepHypRef Expression
1 sb6x.1 . . 3  F/
21sbf 2026 . 2
3 biidd 228 . . 3
41, 3equsal 1960 . 2
52, 4bitr4i 243 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176  wal 1540   F/wnf 1544  wsb 1648
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 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
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator