Mathbox for Jarvin Udandy < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  abnotataxb Structured version   Visualization version   GIF version

Theorem abnotataxb 41404
 Description: Assuming not a, b, there exists a proof a-xor-b.) (Contributed by Jarvin Udandy, 31-Aug-2016.)
Hypotheses
Ref Expression
abnotataxb.1 ¬ 𝜑
abnotataxb.2 𝜓
Assertion
Ref Expression
abnotataxb (𝜑𝜓)

Proof of Theorem abnotataxb
StepHypRef Expression
1 abnotataxb.2 . . . . 5 𝜓
2 abnotataxb.1 . . . . 5 ¬ 𝜑
31, 2pm3.2i 470 . . . 4 (𝜓 ∧ ¬ 𝜑)
43olci 405 . . 3 ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑))
5 xor 953 . . 3 (¬ (𝜑𝜓) ↔ ((𝜑 ∧ ¬ 𝜓) ∨ (𝜓 ∧ ¬ 𝜑)))
64, 5mpbir 221 . 2 ¬ (𝜑𝜓)
7 df-xor 1505 . 2 ((𝜑𝜓) ↔ ¬ (𝜑𝜓))
86, 7mpbir 221 1 (𝜑𝜓)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 196   ∨ wo 382   ∧ wa 383   ⊻ wxo 1504 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 197  df-or 384  df-an 385  df-xor 1505 This theorem is referenced by:  aisfbistiaxb  41408
 Copyright terms: Public domain W3C validator