Theorem ralsd 50627

Description: Introduction rule for "all some" restricted to a class. This is the converse of rals1d 50630 and rals2d 50631 taken together. (Contributed by David A. Wheeler, 12-Jul-2026.)

Hypotheses

Ref	Expression
ralsd.1	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝜒))
ralsd.2	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)

Assertion

Ref	Expression
ralsd	⊢ (𝜑 → ∀∃𝑥 ∈ 𝐴(𝜓 → 𝜒))

Proof of Theorem ralsd

Step	Hyp	Ref	Expression
1		ralsd.1	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝜓 → 𝜒))
2		ralsd.2	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝜓)
3		df-rals 50624	. 2 ⊢ (∀∃𝑥 ∈ 𝐴(𝜓 → 𝜒) ↔ (∀𝑥 ∈ 𝐴 (𝜓 → 𝜒) ∧ ∃𝑥 ∈ 𝐴 𝜓))
4	1, 2, 3	sylanbrc 595	1 ⊢ (𝜑 → ∀∃𝑥 ∈ 𝐴(𝜓 → 𝜒))

This proof depends on syntax axioms:   → wi 4  ∀wral 3081  ∃wrex 3091  ∀∃wrals 50622

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

This proof depends on definitions:  df-bi 210  df-an 402  df-rals 50624

This theorem is used by: (None)