| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Deduce an equivalence from two implications. |
| Ref | Expression |
|---|---|
| impbida.1 |
|
| impbida.2 |
|
| Ref | Expression |
|---|---|
| impbida |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | impbida.1 |
. . 3
| |
| 2 | 1 | ex 373 |
. 2
|
| 3 | impbida.2 |
. . 3
| |
| 4 | 3 | ex 373 |
. 2
|
| 5 | 2, 4 | impbid 514 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: eqop 4088 en3d 4382 elcls 7646 iscncl 7709 metcnp 7826 cmsss 7931 grpinvid1 8006 grpinvid2 8007 leopmult 9979 hst1ht 10064 cnfilca 10451 imonclem 10583 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 |
| This theorem depends on definitions: df-bi 147 df-an 225 |