| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > bicom | Structured version Visualization version GIF version | ||
| Description: Commutative law for the biconditional. Theorem *4.21 of [WhiteheadRussell] p. 117. (Contributed by NM, 11-May-1993.) |
| Ref | Expression |
|---|---|
| bicom | ⊢ ((𝜑 ↔ 𝜓) ↔ (𝜓 ↔ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bicom1 224 | . 2 ⊢ ((𝜑 ↔ 𝜓) → (𝜓 ↔ 𝜑)) | |
| 2 | bicom1 224 | . 2 ⊢ ((𝜓 ↔ 𝜑) → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | impbii 212 | 1 ⊢ ((𝜑 ↔ 𝜓) ↔ (𝜓 ↔ 𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 |
| This theorem is used by: bicomd 226 bibi1i 341 bibi1d 346 con2bi 356 ibibr 371 bibif 374 nbbnOLD 387 birot 389 biluk 390 biadan 831 pm5.17 1030 bigolden 1045 xorcom 1546 norass 1569 trubifal 1603 hadcoma 1631 eqabcbw 2841 eqabcb 2907 pm13.183 3622 ssequn1 4186 isocnv 7368 qextlt 13372 qextle 13373 rpnnen2lem12 16435 odd2np1 16553 sumodd 16600 nrmmetd 24950 lgsqrmodndvds 27739 eqelbid 33172 mgccnv 33660 cvmlift2lem12 36288 nn0prpw 37327 wl-3xorrot 38670 wl-3xorcoma 38671 tsbi4 39336 bicomdd 40179 onsupmaxb 44562 ifpbicor 44797 rp-fakeoranass 44836 or3or 45344 3impexpbicom 45783 3impexpbicomVD 46159 notbicom 46513 limsupreuz 47080 nabctnabc 48334 |
| Copyright terms: Public domain | W3C validator |