Theorem 3simpb 1026

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 1017	. 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) ↔ (𝜑 ∧ 𝜒 ∧ 𝜓))
2		3simpa 1025	. 2 ⊢ ((𝜑 ∧ 𝜒 ∧ 𝜓) → (𝜑 ∧ 𝜒))
3	1, 2	sylbi 121	1 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒) → (𝜑 ∧ 𝜒))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108

This proof depends on definitions:  df-bi 117  df-3an 1011

This theorem is used by:  3adant2  1047  3adantl2  1185  3adantr2  1188  enq0tr  7802  ixxssixx  10315  rebtwn2zlemshrink  10699  zsumdc  12169  muldvds1  12601  dvds2add  12610  dvds2sub  12611  dvdstr  12613  ctinf  13372  mndissubm  13833  gzsumconst  14194