| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > truan | Structured version Visualization version GIF version | ||
| Description: True can be removed from a conjunction. (Contributed by FL, 20-Mar-2011.) (Proof shortened by Wolf Lammen, 21-Jul-2019.) |
| Ref | Expression |
|---|---|
| truan | ⊢ ((⊤ ∧ 𝜑) ↔ 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tru 1574 | . . 3 ⊢ ⊤ | |
| 2 | 1 | biantrur 540 | . 2 ⊢ (𝜑 ↔ (⊤ ∧ 𝜑)) |
| 3 | 2 | bicomi 227 | 1 ⊢ ((⊤ ∧ 𝜑) ↔ 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ⊤wtru 1571 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 |
| This theorem is used by: truanfal 1604 euelss 4280 sgn3da 15297 tgcgr4 29051 aciunf1 33355 wl-2mintru1 38681 truconj 39299 tradd 39303 ifpdfxor 44810 dfid7 44934 eel0TT 46007 eelT00 46008 eelTTT 46009 eelT11 46010 eelT12 46012 eelTT1 46013 eelT01 46014 eel0T1 46015 eelTT 46074 uunT1p1 46084 uunTT1 46096 uunTT1p1 46097 uunTT1p2 46098 uunT11 46099 uunT11p1 46100 uunT11p2 46101 uunT12 46102 uunT12p1 46103 uunT12p2 46104 uunT12p3 46105 uunT12p4 46106 uunT12p5 46107 |
| Copyright terms: Public domain | W3C validator |