| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An inference from a biconditional, similar to modus tollens. |
| Ref | Expression |
|---|---|
| mtbii.min |
|
| mtbii.maj |
|
| Ref | Expression |
|---|---|
| mtbii |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mtbii.min |
. 2
| |
| 2 | mtbii.maj |
. . 3
| |
| 3 | 2 | biimprd 136 |
. 2
|
| 4 | 1, 3 | mtoi 94 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ssnpss 1573 noel 1711 aceq6b 3565 nd3 3734 axunndlem1 3741 axregndlem1 3748 axregndlem2 3749 axregnd 3750 axacndlem5 3757 addnidpi 3822 indpi 3828 lt2sq 4414 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 |
| This theorem depends on definitions: df-bi 128 |