Theorem keephyp3v 1795

Description: Keep a hypothesis containing 3 class variables.

Hypotheses

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

Assertion

Ref	Expression
keephyp3v	|- ta

Proof of Theorem keephyp3v

Step	Hyp	Ref	Expression
1		keephyp3v.7	. . 3 |- rh
2		iftrue 1780	. . . . . 6 |- (ph -> if(ph, A, D) = A)
3	2	cleqcomd 1106	. . . . 5 |- (ph -> A = if(ph, A, D))
4		keephyp3v.1	. . . . 5 |- (A = if(ph, A, D) -> (rh <-> ch))
5	3, 4	syl 12	. . . 4 |- (ph -> (rh <-> ch))
6		iftrue 1780	. . . . . 6 |- (ph -> if(ph, B, R) = B)
7	6	cleqcomd 1106	. . . . 5 |- (ph -> B = if(ph, B, R))
8		keephyp3v.2	. . . . 5 |- (B = if(ph, B, R) -> (ch <-> th))
9	7, 8	syl 12	. . . 4 |- (ph -> (ch <-> th))
10		iftrue 1780	. . . . . 6 |- (ph -> if(ph, C, S) = C)
11	10	cleqcomd 1106	. . . . 5 |- (ph -> C = if(ph, C, S))
12		keephyp3v.3	. . . . 5 |- (C = if(ph, C, S) -> (th <-> ta ))
13	11, 12	syl 12	. . . 4 |- (ph -> (th <-> ta ))
14	5, 9, 13	3bitrd 422	. . 3 |- (ph -> (rh <-> ta ))
15	1, 14	mpbii 168	. 2 |- (ph -> ta )
16		keephyp3v.8	. . 3 |- et
17		iffalse 1781	. . . . . 6 |- (-. ph -> if(ph, A, D) = D)
18	17	cleqcomd 1106	. . . . 5 |- (-. ph -> D = if(ph, A, D))
19		keephyp3v.4	. . . . 5 |- (D = if(ph, A, D) -> (et <-> ze))
20	18, 19	syl 12	. . . 4 |- (-. ph -> (et <-> ze))
21		iffalse 1781	. . . . . 6 |- (-. ph -> if(ph, B, R) = R)
22	21	cleqcomd 1106	. . . . 5 |- (-. ph -> R = if(ph, B, R))
23		keephyp3v.5	. . . . 5 |- (R = if(ph, B, R) -> (ze <-> si))
24	22, 23	syl 12	. . . 4 |- (-. ph -> (ze <-> si))
25		iffalse 1781	. . . . . 6 |- (-. ph -> if(ph, C, S) = S)
26	25	cleqcomd 1106	. . . . 5 |- (-. ph -> S = if(ph, C, S))
27		keephyp3v.6	. . . . 5 |- (S = if(ph, C, S) -> (si <-> ta ))
28	26, 27	syl 12	. . . 4 |- (-. ph -> (si <-> ta ))
29	20, 24, 28	3bitrd 422	. . 3 |- (-. ph -> (et <-> ta ))
30	16, 29	mpbii 168	. 2 |- (-. ph -> ta )
31	15, 30	pm2.61i 110	1 |- ta

Syntax hints:  -. wn 1   -> wi 2   <-> wb 127   = wceq 1091  ifcif 1776

This theorem is referenced by:  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