New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > 3bitr4i | Unicode version |
Description: A chained inference from transitive law for logical equivalence. This inference is frequently used to apply a definition to both sides of a logical equivalence. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
3bitr4i.1 | |
3bitr4i.2 | |
3bitr4i.3 |
Ref | Expression |
---|---|
3bitr4i |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3bitr4i.2 | . 2 | |
2 | 3bitr4i.1 | . . 3 | |
3 | 3bitr4i.3 | . . 3 | |
4 | 2, 3 | bitr4i 243 | . 2 |
5 | 1, 4 | bitri 240 | 1 |
Copyright terms: Public domain | W3C validator |