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

Theorem dedth4v 4095
Description: Weak deduction theorem for eliminating a hypothesis with 4 class variables. See comments in dedth2v 4093. (Contributed by NM, 21-Apr-2007.) (Proof shortened by Eric Schmidt, 28-Jul-2009.)
Hypotheses
Ref Expression
dedth4v.1 (𝐴 = if(𝜑, 𝐴, 𝑅) → (𝜓𝜒))
dedth4v.2 (𝐵 = if(𝜑, 𝐵, 𝑆) → (𝜒𝜃))
dedth4v.3 (𝐶 = if(𝜑, 𝐶, 𝑇) → (𝜃𝜏))
dedth4v.4 (𝐷 = if(𝜑, 𝐷, 𝑈) → (𝜏𝜂))
dedth4v.5 𝜂
Assertion
Ref Expression
dedth4v (𝜑𝜓)

Proof of Theorem dedth4v
StepHypRef Expression
1 dedth4v.1 . . . 4 (𝐴 = if(𝜑, 𝐴, 𝑅) → (𝜓𝜒))
2 dedth4v.2 . . . 4 (𝐵 = if(𝜑, 𝐵, 𝑆) → (𝜒𝜃))
3 dedth4v.3 . . . 4 (𝐶 = if(𝜑, 𝐶, 𝑇) → (𝜃𝜏))
4 dedth4v.4 . . . 4 (𝐷 = if(𝜑, 𝐷, 𝑈) → (𝜏𝜂))
5 dedth4v.5 . . . 4 𝜂
61, 2, 3, 4, 5dedth4h 4092 . . 3 (((𝜑𝜑) ∧ (𝜑𝜑)) → 𝜓)
76anidms 675 . 2 ((𝜑𝜑) → 𝜓)
87anidms 675 1 (𝜑𝜓)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  ifcif 4036
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-if 4037
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator