Theorem dedth3v 1786

Description: Weak deduction theorem for eliminating hypothesis with 3 class variables.

Hypotheses

Ref	Expression
dedth3v.1	|- (A = if(ph, A, D) -> (ps <-> ch))
dedth3v.2	|- (B = if(ph, B, R) -> (ch <-> th))
dedth3v.3	|- (C = if(ph, C, S) -> (th <-> ta ))
dedth3v.4	|- ta

Assertion

Ref	Expression
dedth3v	|- (ph -> ps)

Proof of Theorem dedth3v

Step	Hyp	Ref	Expression
1		dedth3v.4	. 2 |- ta
2		iftrue 1780	. . . . 5 |- (ph -> if(ph, A, D) = A)
3	2	cleqcomd 1106	. . . 4 |- (ph -> A = if(ph, A, D))
4		dedth3v.1	. . . 4 |- (A = if(ph, A, D) -> (ps <-> ch))
5	3, 4	syl 12	. . 3 |- (ph -> (ps <-> ch))
6		iftrue 1780	. . . . 5 |- (ph -> if(ph, B, R) = B)
7	6	cleqcomd 1106	. . . 4 |- (ph -> B = if(ph, B, R))
8		dedth3v.2	. . . 4 |- (B = if(ph, B, R) -> (ch <-> th))
9	7, 8	syl 12	. . 3 |- (ph -> (ch <-> th))
10		iftrue 1780	. . . . 5 |- (ph -> if(ph, C, S) = C)
11	10	cleqcomd 1106	. . . 4 |- (ph -> C = if(ph, C, S))
12		dedth3v.3	. . . 4 |- (C = if(ph, C, S) -> (th <-> ta ))
13	11, 12	syl 12	. . 3 |- (ph -> (th <-> ta ))
14	5, 9, 13	3bitrd 422	. 2 |- (ph -> (ps <-> ta ))
15	1, 14	mpbiri 169	1 |- (ph -> ps)

Syntax hints:   -> 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