Theorem bnj133 31997

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj133.1	⊢ (𝜑 ↔ ∃𝑥𝜓)
bnj133.2	⊢ (𝜒 ↔ 𝜓)

Assertion

Ref	Expression
bnj133	⊢ (𝜑 ↔ ∃𝑥𝜒)

Proof of Theorem bnj133

Step	Hyp	Ref	Expression
1		bnj133.1	. 2 ⊢ (𝜑 ↔ ∃𝑥𝜓)
2		bnj133.2	. . 3 ⊢ (𝜒 ↔ 𝜓)
3	2	exbii 1848	. 2 ⊢ (∃𝑥𝜒 ↔ ∃𝑥𝜓)
4	1, 3	bitr4i 280	1 ⊢ (𝜑 ↔ ∃𝑥𝜒)

Syntax hints:   ↔ wb 208  ∃wex 1780

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

This theorem depends on definitions:  df-bi 209  df-ex 1781

This theorem is referenced by:  bnj150  32148  bnj983  32223  bnj984  32224  bnj985v  32225  bnj985  32226  bnj1090  32251  bnj1514  32335