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

Theorem dedlem0b 1060
Description: Lemma for an alternate version of weak deduction theorem. (Contributed by NM, 2-Apr-1994.)
Assertion
Ref Expression
dedlem0b (¬ 𝜑 → (𝜓 ↔ ((𝜓 → 𝜑) → (𝜒 ∧ 𝜑))))

Proof of Theorem dedlem0b
StepHypRef Expression
1 pm2.21 124 . . . 4 (¬ 𝜑 → (𝜑 → (𝜒 ∧ 𝜑)))
21imim2d 58 . . 3 (¬ 𝜑 → ((𝜓 → 𝜑) → (𝜓 → (𝜒 ∧ 𝜑))))
32com23 87 . 2 (¬ 𝜑 → (𝜓 → ((𝜓 → 𝜑) → (𝜒 ∧ 𝜑))))
4 pm2.21 124 . . . . 5 (¬ 𝜓 → (𝜓 → 𝜑))
5 simpr 490 . . . . 5 ((𝜒 ∧ 𝜑) → 𝜑)
64, 5imim12i 63 . . . 4 (((𝜓 → 𝜑) → (𝜒 ∧ 𝜑)) → (¬ 𝜓 → 𝜑))
76con1d 146 . . 3 (((𝜓 → 𝜑) → (𝜒 ∧ 𝜑)) → (¬ 𝜑 → 𝜓))
87com12 33 . 2 (¬ 𝜑 → (((𝜓 → 𝜑) → (𝜒 ∧ 𝜑)) → 𝜓))
93, 8impbid 215 1 (¬ 𝜑 → (𝜓 ↔ ((𝜓 → 𝜑) → (𝜒 ∧ 𝜑))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → 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: (None)
  Copyright terms: Public domain W3C validator