Theorem 3simpb 1019

Description: Simplification of triple conjunction. (Contributed by NM, 21-Apr-1994.)

Assertion

Ref	Expression
3simpb	⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜑 ∧ 𝜒))

Proof of Theorem 3simpb

Step	Hyp	Ref	Expression
1		3ancomb 1010	. 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜑 ∧ 𝜒 ∧ 𝜓))
2		3simpa 1018	. 2 ⊢ ((𝜑 ∧ 𝜒 ∧ 𝜓) → (𝜑 ∧ 𝜒))
3	1, 2	sylbi 121	1 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜑 ∧ 𝜒))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1002

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This theorem depends on definitions:  df-bi 117  df-3an 1004

This theorem is referenced by:  3adant2  1040  3adantl2  1178  3adantr2  1181  enq0tr  7629  ixxssixx  10106  rebtwn2zlemshrink  10481  zsumdc  11903  muldvds1  12335  dvds2add  12344  dvds2sub  12345  dvdstr  12347  pw2dvdslemn  12695  ctinf  13009  mndissubm  13516  gsumfzconst  13886