Metamath Proof Explorer


Theorem mdandyv11

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)

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

Proof

Step Hyp Ref Expression
1 mdandyv11.1
 |-  ( ph <-> F. )
2 mdandyv11.2
 |-  ( ps <-> T. )
3 mdandyv11.3
 |-  ( ch <-> T. )
4 mdandyv11.4
 |-  ( th <-> T. )
5 mdandyv11.5
 |-  ( ta <-> F. )
6 mdandyv11.6
 |-  ( et <-> T. )
7 3 2 bothtbothsame
 |-  ( ch <-> ps )
8 4 2 bothtbothsame
 |-  ( th <-> ps )
9 7 8 pm3.2i
 |-  ( ( ch <-> ps ) /\ ( th <-> ps ) )
10 5 1 bothfbothsame
 |-  ( ta <-> ph )
11 9 10 pm3.2i
 |-  ( ( ( ch <-> ps ) /\ ( th <-> ps ) ) /\ ( ta <-> ph ) )
12 6 2 bothtbothsame
 |-  ( et <-> ps )
13 11 12 pm3.2i
 |-  ( ( ( ( ch <-> ps ) /\ ( th <-> ps ) ) /\ ( ta <-> ph ) ) /\ ( et <-> ps ) )