Theorem bianir 1009

Description: A closed form of mpbir 221, analogous to pm2.27 42 (assertion). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Proof shortened by Roger Witte, 17-Aug-2020.)

Assertion

Ref	Expression
bianir	⊢ ((𝜑 ∧ (𝜓 ↔ 𝜑)) → 𝜓)

Proof of Theorem bianir

Step	Hyp	Ref	Expression
1		biimpr 210	. 2 ⊢ ((𝜓 ↔ 𝜑) → (𝜑 → 𝜓))
2	1	impcom 446	1 ⊢ ((𝜑 ∧ (𝜓 ↔ 𝜑)) → 𝜓)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8

This theorem depends on definitions:  df-bi 197  df-an 386

This theorem is referenced by:  suppimacnv  7306  lgsqrmodndvds  25078  bnj970  31017  bnj1001  31028  bj-bibibi  32571