HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem anandirs 395
Description: Inference that undistributes conjunction in the antecedent.
Hypothesis
Ref Expression
anandirs.1 |- (((ph /\ ch) /\ (ps /\ ch)) -> ta )
Assertion
Ref Expression
anandirs |- (((ph /\ ps) /\ ch) -> ta )

Proof of Theorem anandirs
StepHypRef Expression
1 anandirs.1 . . 3 |- (((ph /\ ch) /\ (ps /\ ch)) -> ta )
21an4s 390 . 2 |- (((ph /\ ps) /\ (ch /\ ch)) -> ta )
32anabsan2 387 1 |- (((ph /\ ps) /\ ch) -> ta )
Colors of variables: wff set class
Syntax hints:   -> wi 2   /\ wa 196
This theorem is referenced by:  3impdir 631  fvreseq 2882  oawordri 3152  phplem5 3407  axrecex 4079  hosclt 5491  hodclt 5492  spansncv 5542  5oalem3 5546  5oalem5 5548  mdsymlem5 5780
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-an 198
metamath.org