Theorem bj-exalims 37487

Description: Distributing quantifiers over a nested implication. (Almost) the general statement that spimfw 1998 proves. (Contributed by BJ, 29-Sep-2019.)

Hypothesis

Ref	Expression
bj-exalims.1	⊢ (∃𝑥𝜑 → (¬ 𝜒 → ∀𝑥 ¬ 𝜒))

Assertion

Ref	Expression
bj-exalims	⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∃𝑥𝜑 → (∀𝑥𝜓 → 𝜒)))

Proof of Theorem bj-exalims

Step	Hyp	Ref	Expression
1		bj-exalim 37484	. 2 ⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∃𝑥𝜑 → (∀𝑥𝜓 → ∃𝑥𝜒)))
2		bj-exalims.1	. . . 4 ⊢ (∃𝑥𝜑 → (¬ 𝜒 → ∀𝑥 ¬ 𝜒))
3		eximal 1815	. . . 4 ⊢ ((∃𝑥𝜒 → 𝜒) ↔ (¬ 𝜒 → ∀𝑥 ¬ 𝜒))
4	2, 3	sylibr 237	. . 3 ⊢ (∃𝑥𝜑 → (∃𝑥𝜒 → 𝜒))
5	4	a1i 11	. 2 ⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∃𝑥𝜑 → (∃𝑥𝜒 → 𝜒)))
6	1, 5	syldd 73	1 ⊢ (∀𝑥(𝜑 → (𝜓 → 𝜒)) → (∃𝑥𝜑 → (∀𝑥𝜓 → 𝜒)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1568  ∃wex 1812

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

This proof depends on definitions:  df-bi 210  df-ex 1813

This theorem is used by:  bj-exalimsi  37488