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

Theorem bianbi 639
Description: Exchanging conjunction in a biconditional. (Contributed by Peter Mazsa, 31-Jul-2023.)
Hypotheses
Ref Expression
bianbi.1 (𝜑 ↔ (𝜓 ∧ 𝜒))
bianbi.2 (𝜓 ↔ 𝜃)
Assertion
Ref Expression
bianbi (𝜑 ↔ (𝜃 ∧ 𝜒))

Proof of Theorem bianbi
StepHypRef Expression
1 bianbi.1 . 2 (𝜑 ↔ (𝜓 ∧ 𝜒))
2 bianbi.2 . . 3 (𝜓 ↔ 𝜃)
32anbi1i 636 . 2 ((𝜓 ∧ 𝜒) ↔ (𝜃 ∧ 𝜒))
41, 3bitri 278 1 (𝜑 ↔ (𝜃 ∧ 𝜒))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401
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  df-an 402
This theorem is used by:  anbi12i  640  bianassc  656  pm5.53  1022  dfifp4  1082  dfifp5  1083  an6  1475  an3andi  1514  19.28v  2031  19.28  2268  2eu4  2682  r19.26-3  3127  r19.41v  3196  r3ex  3205  3reeanv  3239  r19.41  3270  rmo4  3691  rmo3f  3695  sbc3an  3806  rmo3  3840  difin2  4249  otelxp  5702  f1ounsn  7311  dfring3  20569  lgsquadlem1  27764  dfpth2  30371  kardexen  35972  dfrefrel5  39795  dfdisjALTV5a  40001  dfantisymrel4  40062  dfantisymrel5  40063  petseq  40174  redvmptabs  43677  permaxsep  46322  clnbgrel  49260  grimuhgr  49319  elixpmpt  50396  catcinv  50926
  Copyright terms: Public domain W3C validator