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

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

Proof of Theorem simp1r3
StepHypRef Expression
1 simpr3 1215 . 2 ((𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒)) → 𝜒)
213ad2ant1 1151 1 (((𝜃 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒)) ∧ 𝜏 ∧ 𝜂) → 𝜒)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ 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:  hash7g  14634  lshpkrlem6  40265  atbtwnexOLDN  40597  atbtwnex  40598  3dim3  40619  3atlem5  40637  lplnle  40690  4atlem11  40759  4atexlem7  41225  cdleme22b  41491  stoweidlem60  47163
  Copyright terms: Public domain W3C validator