Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mptnan | Structured version Visualization version GIF version |
Description: Modus ponendo tollens 1, one of the "indemonstrables" in Stoic logic. See rule 1 on [Lopez-Astorga] p. 12 , rule 1 on [Sanford] p. 40, and rule A3 in [Hitchcock] p. 5. Sanford describes this rule second (after mptxor 1772) as a "safer, and these days much more common" version of modus ponendo tollens because it avoids confusion between inclusive-or and exclusive-or. (Contributed by David A. Wheeler, 3-Jul-2016.) |
Ref | Expression |
---|---|
mptnan.min | ⊢ 𝜑 |
mptnan.maj | ⊢ ¬ (𝜑 ∧ 𝜓) |
Ref | Expression |
---|---|
mptnan | ⊢ ¬ 𝜓 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mptnan.min | . 2 ⊢ 𝜑 | |
2 | mptnan.maj | . . 3 ⊢ ¬ (𝜑 ∧ 𝜓) | |
3 | 2 | imnani 401 | . 2 ⊢ (𝜑 → ¬ 𝜓) |
4 | 1, 3 | ax-mp 5 | 1 ⊢ ¬ 𝜓 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 396 |
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 206 df-an 397 |
This theorem is referenced by: mptxor 1772 alephsucpw2 9867 aleph1re 15954 |
Copyright terms: Public domain | W3C validator |