Theorem dedth4h 4591

Description: Weak deduction theorem eliminating four hypotheses. See comments in dedth2h 4589. (Contributed by NM, 16-May-1999.)

Hypotheses

Ref	Expression
dedth4h.1	⊢ (𝐴 = if(𝜑, 𝐴, 𝑅) → (𝜏 ↔ 𝜂))
dedth4h.2	⊢ (𝐵 = if(𝜓, 𝐵, 𝑆) → (𝜂 ↔ 𝜁))
dedth4h.3	⊢ (𝐶 = if(𝜒, 𝐶, 𝐹) → (𝜁 ↔ 𝜎))
dedth4h.4	⊢ (𝐷 = if(𝜃, 𝐷, 𝐺) → (𝜎 ↔ 𝜌))
dedth4h.5	⊢ 𝜌

Assertion

Ref	Expression
dedth4h	⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) → 𝜏)

Proof of Theorem dedth4h

Step	Hyp	Ref	Expression
1		dedth4h.1	. . . 4 ⊢ (𝐴 = if(𝜑, 𝐴, 𝑅) → (𝜏 ↔ 𝜂))
2	1	imbi2d 339	. . 3 ⊢ (𝐴 = if(𝜑, 𝐴, 𝑅) → (((𝜒 ∧ 𝜃) → 𝜏) ↔ ((𝜒 ∧ 𝜃) → 𝜂)))
3		dedth4h.2	. . . 4 ⊢ (𝐵 = if(𝜓, 𝐵, 𝑆) → (𝜂 ↔ 𝜁))
4	3	imbi2d 339	. . 3 ⊢ (𝐵 = if(𝜓, 𝐵, 𝑆) → (((𝜒 ∧ 𝜃) → 𝜂) ↔ ((𝜒 ∧ 𝜃) → 𝜁)))
5		dedth4h.3	. . . 4 ⊢ (𝐶 = if(𝜒, 𝐶, 𝐹) → (𝜁 ↔ 𝜎))
6		dedth4h.4	. . . 4 ⊢ (𝐷 = if(𝜃, 𝐷, 𝐺) → (𝜎 ↔ 𝜌))
7		dedth4h.5	. . . 4 ⊢ 𝜌
8	5, 6, 7	dedth2h 4589	. . 3 ⊢ ((𝜒 ∧ 𝜃) → 𝜁)
9	2, 4, 8	dedth2h 4589	. 2 ⊢ ((𝜑 ∧ 𝜓) → ((𝜒 ∧ 𝜃) → 𝜏))
10	9	imp 405	1 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝜒 ∧ 𝜃)) → 𝜏)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533  ifcif 4530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2698

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-ex 1774  df-sb 2060  df-clab 2705  df-cleq 2719  df-clel 2805  df-if 4531

This theorem is referenced by:  dedth4v  4594  fprg  7168  omopth  8687  nn0opth2  14269  ax5seglem8  28765  hvsubsub4  30888  norm3lemt  30980  eigorth  31666

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »