Theorem mdandyv15 41131

Description: Given the equivalences set in the hypotheses, there exist a proof where ch, th, ta, et match ph, ps accordingly. (Contributed by Jarvin Udandy, 6-Sep-2016.)

Hypotheses

Ref	Expression
mdandyv15.1	|- ( ph <-> F. )
mdandyv15.2	|- ( ps <-> T. )
mdandyv15.3	|- ( ch <-> T. )
mdandyv15.4	|- ( th <-> T. )
mdandyv15.5	|- ( ta <-> T. )
mdandyv15.6	|- ( et <-> T. )

Assertion

Ref	Expression
mdandyv15	|- ( ( ( ( ch <-> ps ) /\ ( th <-> ps ) ) /\ ( ta <-> ps ) ) /\ ( et <-> ps ) )

Proof of Theorem mdandyv15

Step	Hyp	Ref	Expression
1		mdandyv15.3	. . . . 5 |- ( ch <-> T. )
2		mdandyv15.2	. . . . 5 |- ( ps <-> T. )
3	1, 2	bothtbothsame 41066	. . . 4 |- ( ch <-> ps )
4		mdandyv15.4	. . . . 5 |- ( th <-> T. )
5	4, 2	bothtbothsame 41066	. . . 4 |- ( th <-> ps )
6	3, 5	pm3.2i 471	. . 3 |- ( ( ch <-> ps ) /\ ( th <-> ps ) )
7		mdandyv15.5	. . . 4 |- ( ta <-> T. )
8	7, 2	bothtbothsame 41066	. . 3 |- ( ta <-> ps )
9	6, 8	pm3.2i 471	. 2 |- ( ( ( ch <-> ps ) /\ ( th <-> ps ) ) /\ ( ta <-> ps ) )
10		mdandyv15.6	. . 3 |- ( et <-> T. )
11	10, 2	bothtbothsame 41066	. 2 |- ( et <-> ps )
12	9, 11	pm3.2i 471	1 |- ( ( ( ( ch <-> ps ) /\ ( th <-> ps ) ) /\ ( ta <-> ps ) ) /\ ( et <-> ps ) )

Syntax hints:   <-> wb 196   /\ wa 384   T. wtru 1484   F. wfal 1488

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 197  df-an 386

This theorem is referenced by: (None)