Theorem bnj1023 35411

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

Hypotheses

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

Assertion

Ref	Expression
bnj1023	⊢ ∃𝑥(𝜑 → 𝜒)

Proof of Theorem bnj1023

Step	Hyp	Ref	Expression
1		bnj1023.2	. . . . 5 ⊢ (𝜓 → 𝜒)
2	1	a1i 11	. . . 4 ⊢ ((𝜑 → 𝜓) → (𝜓 → 𝜒))
3	2	ax-gen 1827	. . 3 ⊢ ∀𝑥((𝜑 → 𝜓) → (𝜓 → 𝜒))
4		bnj1023.1	. . 3 ⊢ ∃𝑥(𝜑 → 𝜓)
5		exintr 1924	. . 3 ⊢ (∀𝑥((𝜑 → 𝜓) → (𝜓 → 𝜒)) → (∃𝑥(𝜑 → 𝜓) → ∃𝑥((𝜑 → 𝜓) ∧ (𝜓 → 𝜒))))
6	3, 4, 5	mp2 9	. 2 ⊢ ∃𝑥((𝜑 → 𝜓) ∧ (𝜓 → 𝜒))
7		pm3.33 777	. 2 ⊢ (((𝜑 → 𝜓) ∧ (𝜓 → 𝜒)) → (𝜑 → 𝜒))
8	6, 7	bnj101 35354	1 ⊢ ∃𝑥(𝜑 → 𝜒)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1567  ∃wex 1811

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812

This theorem is used by:  bnj1098  35414  bnj1110  35612  bnj1118  35614  bnj1128  35620  bnj1145  35623