Theorem dedth4v 4557

Description: Weak deduction theorem for eliminating a hypothesis with 4 class variables. See comments in dedth2v 4555. (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

Step	Hyp	Ref	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 ⊢ 𝜂
6	1, 2, 3, 4, 5	dedth4h 4554	. . 3 ⊢ (((𝜑 ∧ 𝜑) ∧ (𝜑 ∧ 𝜑)) → 𝜓)
7	6	anidms 577	. 2 ⊢ ((𝜑 ∧ 𝜑) → 𝜓)
8	7	anidms 577	1 ⊢ (𝜑 → 𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ifcif 4492

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-if 4493

This theorem is used by: (None)