Theorem 4cases 565

Description: Inference eliminating two antecedents from the four possible cases that result from their true/false combinations.

Hypotheses

Ref	Expression
4cases.1	⊢ ((φ ∧ ψ) → χ)
4cases.2	⊢ ((φ ∧ ¬ ψ) → χ)
4cases.3	⊢ ((¬ φ ∧ ψ) → χ)
4cases.4	⊢ ((¬ φ ∧ ¬ ψ) → χ)

Assertion

Ref	Expression
4cases	⊢ χ

Proof of Theorem 4cases

Step	Hyp	Ref	Expression
1		4cases.1	. . 3 ⊢ ((φ ∧ ψ) → χ)
2		4cases.3	. . 3 ⊢ ((¬ φ ∧ ψ) → χ)
3	1, 2	pm2.61an1 364	. 2 ⊢ (ψ → χ)
4		4cases.2	. . 3 ⊢ ((φ ∧ ¬ ψ) → χ)
5		4cases.4	. . 3 ⊢ ((¬ φ ∧ ¬ ψ) → χ)
6	4, 5	pm2.61an1 364	. 2 ⊢ (¬ ψ → χ)
7	3, 6	pm2.61i 110	1 ⊢ χ

Syntax hints:  ¬ wn 1   → wi 2   ∧ wa 196

This theorem is referenced by:  suc11reg 3456  znnen 4930

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