Theorem mdandyvr9

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)

	Ref	Expression
Hypotheses	mdandyvr9.1	|- ( ph <-> ze )
	mdandyvr9.2	|- ( ps <-> si )
	mdandyvr9.3	|- ( ch <-> ps )
	mdandyvr9.4	|- ( th <-> ph )
	mdandyvr9.5	|- ( ta <-> ph )
	mdandyvr9.6	|- ( et <-> ps )
Assertion	mdandyvr9	|- ( ( ( ( ch <-> si ) /\ ( th <-> ze ) ) /\ ( ta <-> ze ) ) /\ ( et <-> si ) )

Proof

Step	Hyp	Ref	Expression
1		mdandyvr9.1	|- ( ph <-> ze )
2		mdandyvr9.2	|- ( ps <-> si )
3		mdandyvr9.3	|- ( ch <-> ps )
4		mdandyvr9.4	|- ( th <-> ph )
5		mdandyvr9.5	|- ( ta <-> ph )
6		mdandyvr9.6	|- ( et <-> ps )
7	2 1 3 4 5 6	mdandyvr6	|- ( ( ( ( ch <-> si ) /\ ( th <-> ze ) ) /\ ( ta <-> ze ) ) /\ ( et <-> si ) )