Theorem bnj1101 32664

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

Hypotheses

Ref	Expression
bnj1101.1	⊢ ∃𝑥(𝜑 → 𝜓)
bnj1101.2	⊢ (𝜒 → 𝜑)

Assertion

Ref	Expression
bnj1101	⊢ ∃𝑥(𝜒 → 𝜓)

Proof of Theorem bnj1101

Step	Hyp	Ref	Expression
1		bnj1101.1	. . 3 ⊢ ∃𝑥(𝜑 → 𝜓)
2		pm3.42 493	. . 3 ⊢ ((𝜑 → 𝜓) → ((𝜒 ∧ 𝜑) → 𝜓))
3	1, 2	bnj101 32602	. 2 ⊢ ∃𝑥((𝜒 ∧ 𝜑) → 𝜓)
4		bnj1101.2	. . . . 5 ⊢ (𝜒 → 𝜑)
5	4	pm4.71i 559	. . . 4 ⊢ (𝜒 ↔ (𝜒 ∧ 𝜑))
6	5	imbi1i 349	. . 3 ⊢ ((𝜒 → 𝜓) ↔ ((𝜒 ∧ 𝜑) → 𝜓))
7	6	exbii 1851	. 2 ⊢ (∃𝑥(𝜒 → 𝜓) ↔ ∃𝑥((𝜒 ∧ 𝜑) → 𝜓))
8	3, 7	mpbir 230	1 ⊢ ∃𝑥(𝜒 → 𝜓)

Syntax hints:   → wi 4   ∧ wa 395  ∃wex 1783

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

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784

This theorem is referenced by:  bnj1110  32862  bnj1128  32870  bnj1145  32873