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

Theorem simpr32 1283
Description: Simplification of conjunction. (Contributed by NM, 9-Mar-2012.) (Proof shortened by Wolf Lammen, 24-Jun-2022.)
Assertion
Ref Expression
simpr32 ((𝜂 ∧ (𝜃 ∧ 𝜏 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒))) → 𝜓)

Proof of Theorem simpr32
StepHypRef Expression
1 simpr2 1214 . 2 ((𝜂 ∧ (𝜑 ∧ 𝜓 ∧ 𝜒)) → 𝜓)
213ad2antr3 1209 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:  oppccatid  17925  subccatid  18053  fuccatid  18179  setccatid  18291  catccatid  18313  estrccatid  18338  xpccatid  18394  omndmul2  20380  nllyidm  23841  utoptop  24586  cgr3tr4  37008  paddasslem9  41088  cdlemd1  41458  cdlemf2  41822  cdlemk34  42170  dihmeetlem18N  42584  ssccatid  50401  isthincd2  50787  mndtccatid  50940
  Copyright terms: Public domain W3C validator