|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > tbt | Structured version Visualization version GIF version | ||
| Description: A wff is equivalent to its equivalence with a truth. (Contributed by NM, 18-Aug-1993.) (Proof shortened by Andrew Salmon, 13-May-2011.) | 
| Ref | Expression | 
|---|---|
| tbt.1 | ⊢ 𝜑 | 
| Ref | Expression | 
|---|---|
| tbt | ⊢ (𝜓 ↔ (𝜓 ↔ 𝜑)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | tbt.1 | . 2 ⊢ 𝜑 | |
| 2 | ibibr 368 | . . 3 ⊢ ((𝜑 → 𝜓) ↔ (𝜑 → (𝜓 ↔ 𝜑))) | |
| 3 | 2 | pm5.74ri 272 | . 2 ⊢ (𝜑 → (𝜓 ↔ (𝜓 ↔ 𝜑))) | 
| 4 | 1, 3 | ax-mp 5 | 1 ⊢ (𝜓 ↔ (𝜓 ↔ 𝜑)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ↔ wb 206 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 | 
| This theorem depends on definitions: df-bi 207 | 
| This theorem is referenced by: tbtru 1548 eqv 3490 eqvf 3491 abv 3492 pm13.183 3666 reu6 3732 vnex 5314 iotanul 6539 eqelbid 32494 elnev 44457 | 
| Copyright terms: Public domain | W3C validator |