Theorem elimhyp4v 2364

Description: Eliminate a hypothesis containing 4 class variables (for use with the weak deduction theorem dedth 2354).

Hypotheses

Ref	Expression
elimhyp4v.1	|- (A = if(ph, A, D) -> (ph <-> ch))
elimhyp4v.2	|- (B = if(ph, B, R) -> (ch <-> th))
elimhyp4v.3	|- (C = if(ph, C, S) -> (th <-> ta))
elimhyp4v.4	|- (F = if(ph, F, G) -> (ta <-> ps))
elimhyp4v.5	|- (D = if(ph, A, D) -> (et <-> ze))
elimhyp4v.6	|- (R = if(ph, B, R) -> (ze <-> si))
elimhyp4v.7	|- (S = if(ph, C, S) -> (si <-> rh))
elimhyp4v.8	|- (G = if(ph, F, G) -> (rh <-> ps))
elimhyp4v.9	|- et

Assertion

Ref	Expression
elimhyp4v	|- ps

Proof of Theorem elimhyp4v

Step	Hyp	Ref	Expression
1		iftrue 2337	. . . . . . 7 |- (ph -> if(ph, A, D) = A)
2	1	eqcomd 1456	. . . . . 6 |- (ph -> A = if(ph, A, D))
3		elimhyp4v.1	. . . . . 6 |- (A = if(ph, A, D) -> (ph <-> ch))
4	2, 3	syl 10	. . . . 5 |- (ph -> (ph <-> ch))
5		iftrue 2337	. . . . . . 7 |- (ph -> if(ph, B, R) = B)
6	5	eqcomd 1456	. . . . . 6 |- (ph -> B = if(ph, B, R))
7		elimhyp4v.2	. . . . . 6 |- (B = if(ph, B, R) -> (ch <-> th))
8	6, 7	syl 10	. . . . 5 |- (ph -> (ch <-> th))
9	4, 8	bitrd 526	. . . 4 |- (ph -> (ph <-> th))
10		iftrue 2337	. . . . . 6 |- (ph -> if(ph, C, S) = C)
11	10	eqcomd 1456	. . . . 5 |- (ph -> C = if(ph, C, S))
12		elimhyp4v.3	. . . . 5 |- (C = if(ph, C, S) -> (th <-> ta))
13	11, 12	syl 10	. . . 4 |- (ph -> (th <-> ta))
14		iftrue 2337	. . . . . 6 |- (ph -> if(ph, F, G) = F)
15	14	eqcomd 1456	. . . . 5 |- (ph -> F = if(ph, F, G))
16		elimhyp4v.4	. . . . 5 |- (F = if(ph, F, G) -> (ta <-> ps))
17	15, 16	syl 10	. . . 4 |- (ph -> (ta <-> ps))
18	9, 13, 17	3bitrd 542	. . 3 |- (ph -> (ph <-> ps))
19	18	ibi 590	. 2 |- (ph -> ps)
20		elimhyp4v.9	. . 3 |- et
21		iffalse 2338	. . . . . . 7 |- (-. ph -> if(ph, A, D) = D)
22	21	eqcomd 1456	. . . . . 6 |- (-. ph -> D = if(ph, A, D))
23		elimhyp4v.5	. . . . . 6 |- (D = if(ph, A, D) -> (et <-> ze))
24	22, 23	syl 10	. . . . 5 |- (-. ph -> (et <-> ze))
25		iffalse 2338	. . . . . . 7 |- (-. ph -> if(ph, B, R) = R)
26	25	eqcomd 1456	. . . . . 6 |- (-. ph -> R = if(ph, B, R))
27		elimhyp4v.6	. . . . . 6 |- (R = if(ph, B, R) -> (ze <-> si))
28	26, 27	syl 10	. . . . 5 |- (-. ph -> (ze <-> si))
29	24, 28	bitrd 526	. . . 4 |- (-. ph -> (et <-> si))
30		iffalse 2338	. . . . . 6 |- (-. ph -> if(ph, C, S) = S)
31	30	eqcomd 1456	. . . . 5 |- (-. ph -> S = if(ph, C, S))
32		elimhyp4v.7	. . . . 5 |- (S = if(ph, C, S) -> (si <-> rh))
33	31, 32	syl 10	. . . 4 |- (-. ph -> (si <-> rh))
34		iffalse 2338	. . . . . 6 |- (-. ph -> if(ph, F, G) = G)
35	34	eqcomd 1456	. . . . 5 |- (-. ph -> G = if(ph, F, G))
36		elimhyp4v.8	. . . . 5 |- (G = if(ph, F, G) -> (rh <-> ps))
37	35, 36	syl 10	. . . 4 |- (-. ph -> (rh <-> ps))
38	29, 33, 37	3bitrd 542	. . 3 |- (-. ph -> (et <-> ps))
39	20, 38	mpbii 193	. 2 |- (-. ph -> ps)
40	19, 39	pm2.61i 126	1 |- ps

Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   = wceq 1099  ifcif 2332

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-4 951  ax-5 952  ax-6 953  ax-7 954  ax-gen 955  ax-8 1101  ax-9 1102  ax-10 1103  ax-12 1104  ax-17 1190  ax-16 1194  ax-11o 1202  ax-ext 1436

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 957  df-sb 1155  df-clab 1441  df-cleq 1446  df-clel 1449  df-if 2333

Copyright terms: Public domain