Theorem bnj1198 35095

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 1871	. 2 ⊢ (∃𝑥𝜓′ ↔ ∃𝑥𝜓)
4	1, 3	sylibr 237	1 ⊢ (𝜑 → ∃𝑥𝜓′)

Syntax hints:   → wi 4   ↔ wb 209  ∃wex 1802

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

This theorem depends on definitions:  df-bi 210  df-ex 1803

This theorem is referenced by:  bnj1209  35096  bnj1275  35113  bnj1340  35123  bnj1345  35124  bnj605  35207  bnj607  35216  bnj906  35230  bnj908  35231  bnj1189  35309  bnj1450  35350  bnj1312  35358