Theorem biantr 818

Description: A transitive law of equivalence. Compare Theorem *4.22 of [WhiteheadRussell] p. 117. (Contributed by NM, 18-Aug-1993.)

Assertion

Ref	Expression
biantr	⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜓)) → (𝜑 ↔ 𝜒))

Proof of Theorem biantr

Step	Hyp	Ref	Expression
1		id 23	. . 3 ⊢ ((𝜒 ↔ 𝜓) → (𝜒 ↔ 𝜓))
2	1	bibi2d 345	. 2 ⊢ ((𝜒 ↔ 𝜓) → ((𝜑 ↔ 𝜒) ↔ (𝜑 ↔ 𝜓)))
3	2	biimparc 485	1 ⊢ (((𝜑 ↔ 𝜓) ∧ (𝜒 ↔ 𝜓)) → (𝜑 ↔ 𝜒))

This proof depends on syntax axioms:   → wi 4   ↔ 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:  axextmo  2742  bitr3VD  45598  sbcoreleleqVD  45608  trsbcVD  45626  sbcssgVD  45632