| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A wff is equivalent to its equivalence with truth. |
| Ref | Expression |
|---|---|
| tbt.1 |
|
| Ref | Expression |
|---|---|
| tbt |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tbt.1 |
. . . . 5
| |
| 2 | 1 | a1i 7 |
. . . 4
|
| 3 | 2 | a1d 14 |
. . 3
|
| 4 | ax-1 3 |
. . 3
| |
| 5 | 3, 4 | impbid 397 |
. 2
|
| 6 | bi2 131 |
. . 3
| |
| 7 | 1, 6 | mpi 44 |
. 2
|
| 8 | 5, 7 | impbi 139 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: exists1 1072 nvelv 1483 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 df-an 198 |