Metamath Proof Explorer


Theorem anidm

Description: Idempotent law for conjunction. (Contributed by NM, 8-Jan-2004) (Proof shortened by Wolf Lammen, 14-Mar-2014)

Ref Expression
Assertion anidm ⊢ φ ∧ φ ↔ φ

Proof

Step Hyp Ref Expression
1 pm4.24 ⊢ φ ↔ φ ∧ φ
2 1 bicomi ⊢ φ ∧ φ ↔ φ