| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj667 | Structured version Visualization version GIF version | ||
| Description: ∧-manipulation. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj667 | ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒 ∧ 𝜃) → (𝜓 ∧ 𝜒 ∧ 𝜃)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj446 35051 | . 2 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒 ∧ 𝜃) ↔ ((𝜓 ∧ 𝜒 ∧ 𝜃) ∧ 𝜑)) | |
| 2 | 1 | simplbi 501 | 1 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝜒 ∧ 𝜃) → (𝜓 ∧ 𝜒 ∧ 𝜃)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1101 ∧ w-bnj17 35020 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-3an 1103 df-bnj17 35021 |
| This theorem is referenced by: bnj570 35238 bnj594 35245 bnj944 35271 bnj969 35279 |
| Copyright terms: Public domain | W3C validator |