Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfsb3 | Structured version Visualization version Unicode version |
Description: An alternate definition of proper substitution df-sb 1881 that uses only primitive connectives (no defined terms) on the right-hand side. (Contributed by NM, 6-Mar-2007.) |
Ref | Expression |
---|---|
dfsb3 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-or 385 | . 2 | |
2 | dfsb2 2373 | . 2 | |
3 | imnan 438 | . . 3 | |
4 | 3 | imbi1i 339 | . 2 |
5 | 1, 2, 4 | 3bitr4i 292 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 196 wo 383 wa 384 wal 1481 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-10 2019 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: sbn 2391 |
Copyright terms: Public domain | W3C validator |