Metamath Proof Explorer


Theorem mdandyvrx9

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

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

Proof

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