| Mathbox for Jarvin Udandy |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > aisbnaxb | Structured version Visualization version Unicode version | ||
| Description: Given a is equivalent to b, there exists a proof for (not (a xor b)). (Contributed by Jarvin Udandy, 28-Aug-2016.) |
| Ref | Expression |
|---|---|
| aisbnaxb.1 |
|
| Ref | Expression |
|---|---|
| aisbnaxb |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | aisbnaxb.1 |
. . 3
| |
| 2 | 1 | notnoti 137 |
. 2
|
| 3 | df-xor 1465 |
. 2
| |
| 4 | 2, 3 | mtbir 313 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| 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-xor 1465 |
| This theorem is referenced by: dandysum2p2e4 41165 |
| Copyright terms: Public domain | W3C validator |