Theorem mdandyvr0 41132

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

Hypotheses

Ref	Expression
mdandyvr0.1	|- ( ph <-> ze )
mdandyvr0.2	|- ( ps <-> si )
mdandyvr0.3	|- ( ch <-> ph )
mdandyvr0.4	|- ( th <-> ph )
mdandyvr0.5	|- ( ta <-> ph )
mdandyvr0.6	|- ( et <-> ph )

Assertion

Ref	Expression
mdandyvr0	|- ( ( ( ( ch <-> ze ) /\ ( th <-> ze ) ) /\ ( ta <-> ze ) ) /\ ( et <-> ze ) )

Proof of Theorem mdandyvr0

Step	Hyp	Ref	Expression
1		mdandyvr0.3	. . . . 5 |- ( ch <-> ph )
2		mdandyvr0.1	. . . . 5 |- ( ph <-> ze )
3	1, 2	bitri 264	. . . 4 |- ( ch <-> ze )
4		mdandyvr0.4	. . . . 5 |- ( th <-> ph )
5	4, 2	bitri 264	. . . 4 |- ( th <-> ze )
6	3, 5	pm3.2i 471	. . 3 |- ( ( ch <-> ze ) /\ ( th <-> ze ) )
7		mdandyvr0.5	. . . 4 |- ( ta <-> ph )
8	7, 2	bitri 264	. . 3 |- ( ta <-> ze )
9	6, 8	pm3.2i 471	. 2 |- ( ( ( ch <-> ze ) /\ ( th <-> ze ) ) /\ ( ta <-> ze ) )
10		mdandyvr0.6	. . 3 |- ( et <-> ph )
11	10, 2	bitri 264	. 2 |- ( et <-> ze )
12	9, 11	pm3.2i 471	1 |- ( ( ( ( ch <-> ze ) /\ ( th <-> ze ) ) /\ ( ta <-> ze ) ) /\ ( et <-> ze ) )

Syntax hints:   <-> wb 196   /\ wa 384

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:  mdandyvr15  41147