MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  simp111 Structured version   Visualization version   GIF version

Theorem simp111 1321
Description: Simplification of conjunction. (Contributed by NM, 9-Mar-2012.)
Assertion
Ref Expression
simp111 ((((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) ∧ 𝜂 ∧ 𝜁) → 𝜑)

Proof of Theorem simp111
StepHypRef Expression
1 simp11 1222 . 2 (((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) → 𝜑)
213ad2ant1 1151 1 ((((𝜑 ∧ 𝜓 ∧ 𝜒) ∧ 𝜃 ∧ 𝜏) ∧ 𝜂 ∧ 𝜁) → 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103
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-3an 1105
This theorem is used by:  tsmsxp  24454  ps-2b  40507  llncvrlpln2  40582  4atlem11b  40633  4atlem12b  40636  lplncvrlvol2  40640  lneq2at  40803  2lnat  40809  cdlemblem  40818  4atexlemex6  41099  cdleme24  41377  cdleme26ee  41385  cdlemg2idN  41621  cdlemg31c  41724  cdlemk26-3  41931  0ellimcdiv  46603
  Copyright terms: Public domain W3C validator