Theorem alexbii 1750

Description: Biconditional form of aleximi 1749. (Contributed by BJ, 16-Nov-2020.)

Hypothesis

Ref	Expression
alexbii.1	⊢ (𝜑 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
alexbii	⊢ (∀𝑥𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒))

Proof of Theorem alexbii

Step	Hyp	Ref	Expression
1		alexbii.1	. . . 4 ⊢ (𝜑 → (𝜓 ↔ 𝜒))
2	1	biimpd 218	. . 3 ⊢ (𝜑 → (𝜓 → 𝜒))
3	2	aleximi 1749	. 2 ⊢ (∀𝑥𝜑 → (∃𝑥𝜓 → ∃𝑥𝜒))
4	1	biimprd 237	. . 3 ⊢ (𝜑 → (𝜒 → 𝜓))
5	4	aleximi 1749	. 2 ⊢ (∀𝑥𝜑 → (∃𝑥𝜒 → ∃𝑥𝜓))
6	3, 5	impbid 201	1 ⊢ (∀𝑥𝜑 → (∃𝑥𝜓 ↔ ∃𝑥𝜒))

Syntax hints:   → wi 4   ↔ wb 195  ∀wal 1473  ∃wex 1695

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

This theorem depends on definitions:  df-bi 196  df-ex 1696

This theorem is referenced by:  exbi  1762  exbidh  1781  exintrbi  1808  eleq2d  2673