| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pm2.65iOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of pm2.65i 195 as of 7-Jun-2026. Inference for proof by contradiction. (Contributed by NM, 18-May-1994.) (Proof shortened by Wolf Lammen, 11-Sep-2013.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| pm2.65i.1 | ⊢ (𝜑 → 𝜓) |
| pm2.65i.2 | ⊢ (𝜑 → ¬ 𝜓) |
| Ref | Expression |
|---|---|
| pm2.65iOLD | ⊢ ¬ 𝜑 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.65i.2 | . . 3 ⊢ (𝜑 → ¬ 𝜓) | |
| 2 | 1 | con2i 139 | . 2 ⊢ (𝜓 → ¬ 𝜑) |
| 3 | pm2.65i.1 | . . 3 ⊢ (𝜑 → 𝜓) | |
| 4 | 3 | con3i 154 | . 2 ⊢ (¬ 𝜓 → ¬ 𝜑) |
| 5 | 2, 4 | pm2.61i 183 | 1 ⊢ ¬ 𝜑 |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |