Theorem bnj1198 32775

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

Hypotheses

Ref	Expression
bnj1198.1	⊢ (𝜑 → ∃𝑥𝜓)
bnj1198.2	⊢ (𝜓′ ↔ 𝜓)

Assertion

Ref	Expression
bnj1198	⊢ (𝜑 → ∃𝑥𝜓′)

Proof of Theorem bnj1198

Step	Hyp	Ref	Expression
1		bnj1198.1	. 2 ⊢ (𝜑 → ∃𝑥𝜓)
2		bnj1198.2	. . 3 ⊢ (𝜓′ ↔ 𝜓)
3	2	exbii 1850	. 2 ⊢ (∃𝑥𝜓′ ↔ ∃𝑥𝜓)
4	1, 3	sylibr 233	1 ⊢ (𝜑 → ∃𝑥𝜓′)

Syntax hints:   → wi 4   ↔ wb 205  ∃wex 1782

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

This theorem depends on definitions:  df-bi 206  df-ex 1783

This theorem is referenced by:  bnj1209  32776  bnj1275  32793  bnj1340  32803  bnj1345  32804  bnj605  32887  bnj607  32896  bnj906  32910  bnj908  32911  bnj1189  32989  bnj1450  33030  bnj1312  33038