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

Theorem ceqsralt 2766
Description: Restricted quantifier version of ceqsalt 2765. (Contributed by NM, 28-Feb-2013.) (Revised by Mario Carneiro, 10-Oct-2016.)
Assertion
Ref Expression
ceqsralt  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x  e.  B  ( x  =  A  ->  ph )  <->  ps )
)
Distinct variable groups:    x, A    x, B
Allowed substitution hints:    ph( x)    ps( x)

Proof of Theorem ceqsralt
StepHypRef Expression
1 df-ral 2460 . . . 4  |-  ( A. x  e.  B  (
x  =  A  ->  ph )  <->  A. x ( x  e.  B  ->  (
x  =  A  ->  ph ) ) )
2 eleq1 2240 . . . . . . . . 9  |-  ( x  =  A  ->  (
x  e.  B  <->  A  e.  B ) )
32pm5.32ri 455 . . . . . . . 8  |-  ( ( x  e.  B  /\  x  =  A )  <->  ( A  e.  B  /\  x  =  A )
)
43imbi1i 238 . . . . . . 7  |-  ( ( ( x  e.  B  /\  x  =  A
)  ->  ph )  <->  ( ( A  e.  B  /\  x  =  A )  ->  ph ) )
5 impexp 263 . . . . . . 7  |-  ( ( ( x  e.  B  /\  x  =  A
)  ->  ph )  <->  ( x  e.  B  ->  ( x  =  A  ->  ph )
) )
6 impexp 263 . . . . . . 7  |-  ( ( ( A  e.  B  /\  x  =  A
)  ->  ph )  <->  ( A  e.  B  ->  ( x  =  A  ->  ph )
) )
74, 5, 63bitr3i 210 . . . . . 6  |-  ( ( x  e.  B  -> 
( x  =  A  ->  ph ) )  <->  ( A  e.  B  ->  ( x  =  A  ->  ph )
) )
87albii 1470 . . . . 5  |-  ( A. x ( x  e.  B  ->  ( x  =  A  ->  ph )
)  <->  A. x ( A  e.  B  ->  (
x  =  A  ->  ph ) ) )
98a1i 9 . . . 4  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x ( x  e.  B  ->  ( x  =  A  ->  ph )
)  <->  A. x ( A  e.  B  ->  (
x  =  A  ->  ph ) ) ) )
101, 9bitrid 192 . . 3  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x  e.  B  ( x  =  A  ->  ph )  <->  A. x
( A  e.  B  ->  ( x  =  A  ->  ph ) ) ) )
11 19.21v 1873 . . 3  |-  ( A. x ( A  e.  B  ->  ( x  =  A  ->  ph )
)  <->  ( A  e.  B  ->  A. x
( x  =  A  ->  ph ) ) )
1210, 11bitrdi 196 . 2  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x  e.  B  ( x  =  A  ->  ph )  <->  ( A  e.  B  ->  A. x
( x  =  A  ->  ph ) ) ) )
13 biimt 241 . . 3  |-  ( A  e.  B  ->  ( A. x ( x  =  A  ->  ph )  <->  ( A  e.  B  ->  A. x
( x  =  A  ->  ph ) ) ) )
14133ad2ant3 1020 . 2  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x ( x  =  A  ->  ph )  <->  ( A  e.  B  ->  A. x
( x  =  A  ->  ph ) ) ) )
15 ceqsalt 2765 . 2  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x ( x  =  A  ->  ph )  <->  ps )
)
1612, 14, 153bitr2d 216 1  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) )  /\  A  e.  B )  ->  ( A. x  e.  B  ( x  =  A  ->  ph )  <->  ps )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 978   A.wal 1351    = wceq 1353   F/wnf 1460    e. wcel 2148   A.wral 2455
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1447  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-ral 2460  df-v 2741
This theorem is referenced by:  ceqsralv  2770
  Copyright terms: Public domain W3C validator