Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sb6x | Structured version Visualization version Unicode version |
Description: Equivalence involving substitution for a variable not free. (Contributed by NM, 2-Jun-1993.) (Revised by Mario Carneiro, 4-Oct-2016.) |
Ref | Expression |
---|---|
sb6x.1 |
Ref | Expression |
---|---|
sb6x |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sb6x.1 | . . 3 | |
2 | 1 | sbf 2380 | . 2 |
3 | biidd 252 | . . 3 | |
4 | 1, 3 | equsal 2291 | . 2 |
5 | 2, 4 | bitr4i 267 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wal 1481 wnf 1708 wsb 1880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-12 2047 ax-13 2246 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-ex 1705 df-nf 1710 df-sb 1881 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |