Theorem elimhyp3v 1792

Description: Eliminate a hypothesis containing 3 class variables.

Hypotheses

Ref	Expression
elimhyp3v.1	⊢ (A = if(φ, A, D) → (φ ↔ χ))
elimhyp3v.2	⊢ (B = if(φ, B, R) → (χ ↔ θ))
elimhyp3v.3	⊢ (C = if(φ, C, S) → (θ ↔ τ))
elimhyp3v.4	⊢ (D = if(φ, A, D) → (η ↔ ζ))
elimhyp3v.5	⊢ (R = if(φ, B, R) → (ζ ↔ σ))
elimhyp3v.6	⊢ (S = if(φ, C, S) → (σ ↔ τ))
elimhyp3v.7	⊢ η

Assertion

Ref	Expression
elimhyp3v	⊢ τ

Proof of Theorem elimhyp3v

Step	Hyp	Ref	Expression
1		iftrue 1780	. . . . . 6 ⊢ (φ → if(φ, A, D) = A)
2	1	cleqcomd 1106	. . . . 5 ⊢ (φ → A = if(φ, A, D))
3		elimhyp3v.1	. . . . 5 ⊢ (A = if(φ, A, D) → (φ ↔ χ))
4	2, 3	syl 12	. . . 4 ⊢ (φ → (φ ↔ χ))
5		iftrue 1780	. . . . . 6 ⊢ (φ → if(φ, B, R) = B)
6	5	cleqcomd 1106	. . . . 5 ⊢ (φ → B = if(φ, B, R))
7		elimhyp3v.2	. . . . 5 ⊢ (B = if(φ, B, R) → (χ ↔ θ))
8	6, 7	syl 12	. . . 4 ⊢ (φ → (χ ↔ θ))
9		iftrue 1780	. . . . . 6 ⊢ (φ → if(φ, C, S) = C)
10	9	cleqcomd 1106	. . . . 5 ⊢ (φ → C = if(φ, C, S))
11		elimhyp3v.3	. . . . 5 ⊢ (C = if(φ, C, S) → (θ ↔ τ))
12	10, 11	syl 12	. . . 4 ⊢ (φ → (θ ↔ τ))
13	4, 8, 12	3bitrd 422	. . 3 ⊢ (φ → (φ ↔ τ))
14	13	ibi 449	. 2 ⊢ (φ → τ)
15		elimhyp3v.7	. . 3 ⊢ η
16		iffalse 1781	. . . . . 6 ⊢ (¬ φ → if(φ, A, D) = D)
17	16	cleqcomd 1106	. . . . 5 ⊢ (¬ φ → D = if(φ, A, D))
18		elimhyp3v.4	. . . . 5 ⊢ (D = if(φ, A, D) → (η ↔ ζ))
19	17, 18	syl 12	. . . 4 ⊢ (¬ φ → (η ↔ ζ))
20		iffalse 1781	. . . . . 6 ⊢ (¬ φ → if(φ, B, R) = R)
21	20	cleqcomd 1106	. . . . 5 ⊢ (¬ φ → R = if(φ, B, R))
22		elimhyp3v.5	. . . . 5 ⊢ (R = if(φ, B, R) → (ζ ↔ σ))
23	21, 22	syl 12	. . . 4 ⊢ (¬ φ → (ζ ↔ σ))
24		iffalse 1781	. . . . . 6 ⊢ (¬ φ → if(φ, C, S) = S)
25	24	cleqcomd 1106	. . . . 5 ⊢ (¬ φ → S = if(φ, C, S))
26		elimhyp3v.6	. . . . 5 ⊢ (S = if(φ, C, S) → (σ ↔ τ))
27	25, 26	syl 12	. . . 4 ⊢ (¬ φ → (σ ↔ τ))
28	19, 23, 27	3bitrd 422	. . 3 ⊢ (¬ φ → (η ↔ τ))
29	15, 28	mpbii 168	. 2 ⊢ (¬ φ → τ)
30	14, 29	pm2.61i 110	1 ⊢ τ

Syntax hints:  ¬ wn 1   → wi 2   ↔ wb 127   = wceq 1091  ifcif 1776

This theorem is referenced by:  climuni 4884  hlimuni 5144  projlem7 5199

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-if 1777

metamath.org