Theorem 3anidm 1110

Description: Idempotent law for conjunction. (Contributed by Peter Mazsa, 17-Oct-2023.)

Assertion

Ref	Expression
3anidm	⊢ ((𝜑 ∧ 𝜑 ∧ 𝜑) ↔ 𝜑)

Proof of Theorem 3anidm

Step	Hyp	Ref	Expression
1		df-3an 1095	. 2 ⊢ ((𝜑 ∧ 𝜑 ∧ 𝜑) ↔ ((𝜑 ∧ 𝜑) ∧ 𝜑))
2		anabs1 669	. 2 ⊢ (((𝜑 ∧ 𝜑) ∧ 𝜑) ↔ (𝜑 ∧ 𝜑))
3		anidm 570	. 2 ⊢ ((𝜑 ∧ 𝜑) ↔ 𝜑)
4	1, 2, 3	3bitri 299	1 ⊢ ((𝜑 ∧ 𝜑 ∧ 𝜑) ↔ 𝜑)

Syntax hints:   ↔ wb 208   ∧ wa 397   ∧ w3a 1093

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 209  df-an 398  df-3an 1095

This theorem is referenced by:  relcnvtr  6223