MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  bicom1 Structured version   Visualization version   GIF version

Theorem bicom1 224
Description: Commutative law for the biconditional. (Contributed by Wolf Lammen, 10-Nov-2012.)
Assertion
Ref Expression
bicom1 ((𝜑 ↔ 𝜓) → (𝜓 ↔ 𝜑))

Proof of Theorem bicom1
StepHypRef Expression
1 biimpr 223 . 2 ((𝜑 ↔ 𝜓) → (𝜓 → 𝜑))
2 biimp 218 . 2 ((𝜑 ↔ 𝜓) → (𝜑 → 𝜓))
31, 2impbid 215 1 ((𝜑 ↔ 𝜓) → (𝜓 ↔ 𝜑))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ 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:  bicom  225  bicomi  227  nanass  1540  rexsng  4637  axpow3  5334  xpord3inddlem  8195  nummin  35803  bj-axreprepsep  38181  bicomdALT  43867  frege55aid  45055  frege55lem2a  45057  bisaiaisb  48186  confun4  48215  confun5  48216  ichnfim  48749
  Copyright terms: Public domain W3C validator