| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nan | Structured version Visualization version GIF version | ||
| Description: Theorem to move a conjunct in and out of a negation. (Contributed by NM, 9-Nov-2003.) |
| Ref | Expression |
|---|---|
| nan | ⊢ ((𝜑 → ¬ (𝜓 ∧ 𝜒)) ↔ ((𝜑 ∧ 𝜓) → ¬ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | impexp 454 | . 2 ⊢ (((𝜑 ∧ 𝜓) → ¬ 𝜒) ↔ (𝜑 → (𝜓 → ¬ 𝜒))) | |
| 2 | imnan 403 | . . 3 ⊢ ((𝜓 → ¬ 𝜒) ↔ ¬ (𝜓 ∧ 𝜒)) | |
| 3 | 2 | imbi2i 338 | . 2 ⊢ ((𝜑 → (𝜓 → ¬ 𝜒)) ↔ (𝜑 → ¬ (𝜓 ∧ 𝜒))) |
| 4 | 1, 3 | bitr2i 278 | 1 ⊢ ((𝜑 → ¬ (𝜓 ∧ 𝜒)) ↔ ((𝜑 ∧ 𝜓) → ¬ 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 |
| 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 209 df-an 400 |
| This theorem is referenced by: pm4.15 843 somincom 6117 wemaplem2 9489 alephval3 10060 hauspwpwf1 24035 rtprmirr 26813 sticksstones22 42746 icccncfext 46422 stoweidlem34 46569 stirlinglem5 46613 fourierdlem42 46684 etransc 46818 |
| Copyright terms: Public domain | W3C validator |