Theorem anidm 396

Description: Idempotent law for conjunction. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 14-Mar-2014.)

Assertion

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

Proof of Theorem anidm

Step	Hyp	Ref	Expression
1		pm4.24 395	. 2 ⊢ (𝜑 ↔ (𝜑 ∧ 𝜑))
2	1	bicomi 132	1 ⊢ ((𝜑 ∧ 𝜑) ↔ 𝜑)

Syntax hints:   ∧ wa 104   ↔ wb 105

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem depends on definitions:  df-bi 117

This theorem is referenced by:  anidmdbi  398  anandi  590  anandir  591  truantru  1412  falanfal  1415  truxortru  1430  truxorfal  1431  falxortru  1432  falxorfal  1433  sbnf2  2000  2eu4  2138  inidm  3373  ralidm  3552  opcom  4284  opeqsn  4286  poirr  4343  rnxpid  5105  xp11m  5109  fununi  5327  brprcneu  5554  erinxp  6677  dom2lem  6840  dmaddpi  7411  dmmulpi  7412  enq0ref  7519  enq0tr  7520  expap0  10680  sqap0  10717  xrmaxiflemcom  11433  gcddvds  12157  isnsg2  13411  eqger  13432  xmeter  14780