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

Theorem ra5 2874
Description: Restricted quantifier version of Axiom 5 of [Mendelson] p. 69. This is an axiom of a predicate calculus for a restricted domain. Compare the unrestricted stdpc5 1492. (Contributed by NM, 16-Jan-2004.)
Hypothesis
Ref Expression
ra5.1  |-  F/ x ph
Assertion
Ref Expression
ra5  |-  ( A. x  e.  A  ( ph  ->  ps )  -> 
( ph  ->  A. x  e.  A  ps )
)

Proof of Theorem ra5
StepHypRef Expression
1 df-ral 2328 . . . 4  |-  ( A. x  e.  A  ( ph  ->  ps )  <->  A. x
( x  e.  A  ->  ( ph  ->  ps ) ) )
2 bi2.04 241 . . . . 5  |-  ( ( x  e.  A  -> 
( ph  ->  ps )
)  <->  ( ph  ->  ( x  e.  A  ->  ps ) ) )
32albii 1375 . . . 4  |-  ( A. x ( x  e.  A  ->  ( ph  ->  ps ) )  <->  A. x
( ph  ->  ( x  e.  A  ->  ps ) ) )
41, 3bitri 177 . . 3  |-  ( A. x  e.  A  ( ph  ->  ps )  <->  A. x
( ph  ->  ( x  e.  A  ->  ps ) ) )
5 ra5.1 . . . 4  |-  F/ x ph
65stdpc5 1492 . . 3  |-  ( A. x ( ph  ->  ( x  e.  A  ->  ps ) )  ->  ( ph  ->  A. x ( x  e.  A  ->  ps ) ) )
74, 6sylbi 118 . 2  |-  ( A. x  e.  A  ( ph  ->  ps )  -> 
( ph  ->  A. x
( x  e.  A  ->  ps ) ) )
8 df-ral 2328 . 2  |-  ( A. x  e.  A  ps  <->  A. x ( x  e.  A  ->  ps )
)
97, 8syl6ibr 155 1  |-  ( A. x  e.  A  ( ph  ->  ps )  -> 
( ph  ->  A. x  e.  A  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1257   F/wnf 1365    e. wcel 1409   A.wral 2323
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-5 1352  ax-gen 1354  ax-4 1416  ax-ial 1443  ax-i5r 1444
This theorem depends on definitions:  df-bi 114  df-nf 1366  df-ral 2328
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator