Metamath Proof Explorer


Theorem alsi1d

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 alsi1d.1
|- ( ph -> A! x ( ps -> ch ) )
Assertion alsi1d
|- ( ph -> A. x ( ps -> ch ) )

Proof

Step Hyp Ref Expression
1 alsi1d.1
 |-  ( ph -> A! x ( ps -> ch ) )
2 df-alsi
 |-  ( A! x ( ps -> ch ) <-> ( A. x ( ps -> ch ) /\ E. x ps ) )
3 1 2 sylib
 |-  ( ph -> ( A. x ( ps -> ch ) /\ E. x ps ) )
4 3 simpld
 |-  ( ph -> A. x ( ps -> ch ) )