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

Theorem pm5.3 583
Description: Theorem *5.3 of [WhiteheadRussell] p. 125. (Contributed by NM, 3-Jan-2005.) (Proof shortened by Andrew Salmon, 7-May-2011.)
Assertion
Ref Expression
pm5.3 (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜑 ∧ 𝜓) → (𝜑 ∧ 𝜒)))

Proof of Theorem pm5.3
StepHypRef Expression
1 simpl 488 . . 3 ((𝜑 ∧ 𝜓) → 𝜑)
21biantrurd 542 . 2 ((𝜑 ∧ 𝜓) → (𝜒 ↔ (𝜑 ∧ 𝜒)))
32pm5.74i 274 1 (((𝜑 ∧ 𝜓) → 𝜒) ↔ ((𝜑 ∧ 𝜓) → (𝜑 ∧ 𝜒)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401
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
This theorem is used by:  cusgr3cyclex  35880  clss2lem  44570
  Copyright terms: Public domain W3C validator