Users' Mathboxes Mathbox for David A. Wheeler < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  alsd Unicode version

Theorem alsd 17131
Description: Introduction rule: "all some" holds if the "for all" part holds and the antecedent has a witness. This is the converse of als1d 17133 and als2d 17134 taken together, and is what lets an "all some" statement be proved rather than merely taken apart. (Contributed by David A. Wheeler, 12-Jul-2026.)
Hypotheses
Ref Expression
alsd.1  |-  ( ph  ->  A. x ( ps 
->  ch ) )
alsd.2  |-  ( ph  ->  E. x ps )
Assertion
Ref Expression
alsd  |-  ( ph  ->  A.E. x ( ps  ->  ch )
)

Proof of Theorem alsd
StepHypRef Expression
1 alsd.1 . 2  |-  ( ph  ->  A. x ( ps 
->  ch ) )
2 alsd.2 . 2  |-  ( ph  ->  E. x ps )
3 df-als 17128 . 2  |-  ( A.E. x ( ps  ->  ch )  <->  ( A. x
( ps  ->  ch )  /\  E. x ps ) )
41, 2, 3sylanbrc 421 1  |-  ( ph  ->  A.E. x ( ps  ->  ch )
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4   A.wal 1400   E.wex 1545   A.E.wals 17126
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108
This proof depends on definitions:  df-bi 117  df-als 17128
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator