Theorem als1d

Description: Deduction rule: Given "all some" applied to a top-level inference, you can extract the "for all" part. (Contributed by David A. Wheeler, 20-Oct-2018)

	Ref	Expression
Hypothesis	als1d.1	No typesetting found for |- ( ph -> AE x ( ps -> ch ) ) with typecode |-
Assertion	als1d	$$⊢\phi \to \forall x\left(\psi \to \chi \right)$$

Proof

Step	Hyp	Ref	Expression
1		als1d.1	Could not format ( ph -> AE x ( ps -> ch ) ) : No typesetting found for |- ( ph -> AE x ( ps -> ch ) ) with typecode |-
2		df-als	Could not format ( AE x ( ps -> ch ) <-> ( A. x ( ps -> ch ) /\ E. x ps ) ) : No typesetting found for |- ( AE x ( ps -> ch ) <-> ( A. x ( ps -> ch ) /\ E. x ps ) ) with typecode |-
3	1 2	sylib	$$⊢\phi \to \left(\forall x\left(\psi \to \chi \right)\wedge \exists x\psi \right)$$
4	3	simpld	$$⊢\phi \to \forall x\left(\psi \to \chi \right)$$