| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A wff is equivalent to its equivalence with truth. (The proof was shortened by Andrew Salmon, 13-May-2011.) |
| Ref | Expression |
|---|---|
| tbt.1 |
|
| Ref | Expression |
|---|---|
| tbt |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tbt.1 |
. 2
| |
| 2 | ibibr 648 |
. . 3
| |
| 3 | 2 | pm5.74ri 644 |
. 2
|
| 4 | 1, 3 | ax-mp 7 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: exists1 1699 reu6 2276 eqv 2719 vprc 3264 asymref2OLD 4122 truvar 13832 elnev 16086 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 |
| This theorem depends on definitions: df-bi 163 df-an 241 |