ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  alral Unicode version

Theorem alral 2367
Description: Universal quantification implies restricted quantification. (Contributed by NM, 20-Oct-2006.)
Assertion
Ref Expression
alral  |-  ( A. x ph  ->  A. x  e.  A  ph )

Proof of Theorem alral
StepHypRef Expression
1 ax-1 5 . . 3  |-  ( ph  ->  ( x  e.  A  ->  ph ) )
21alimi 1344 . 2  |-  ( A. x ph  ->  A. x
( x  e.  A  ->  ph ) )
3 df-ral 2311 . 2  |-  ( A. x  e.  A  ph  <->  A. x
( x  e.  A  ->  ph ) )
42, 3sylibr 137 1  |-  ( A. x ph  ->  A. x  e.  A  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1241    e. wcel 1393   A.wral 2306
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-gen 1338
This theorem depends on definitions:  df-bi 110  df-ral 2311
This theorem is referenced by:  find  4322  findset  10070
  Copyright terms: Public domain W3C validator