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

Theorem rexss 3250
Description: Restricted existential quantification on a subset in terms of superset. (Contributed by Stefan O'Rear, 3-Apr-2015.)
Assertion
Ref Expression
rexss  |-  ( A 
C_  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ( x  e.  A  /\  ph ) ) )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    ph( x)

Proof of Theorem rexss
StepHypRef Expression
1 ssel 3177 . . . . 5  |-  ( A 
C_  B  ->  (
x  e.  A  ->  x  e.  B )
)
21pm4.71rd 394 . . . 4  |-  ( A 
C_  B  ->  (
x  e.  A  <->  ( x  e.  B  /\  x  e.  A ) ) )
32anbi1d 465 . . 3  |-  ( A 
C_  B  ->  (
( x  e.  A  /\  ph )  <->  ( (
x  e.  B  /\  x  e.  A )  /\  ph ) ) )
4 anass 401 . . 3  |-  ( ( ( x  e.  B  /\  x  e.  A
)  /\  ph )  <->  ( x  e.  B  /\  (
x  e.  A  /\  ph ) ) )
53, 4bitrdi 196 . 2  |-  ( A 
C_  B  ->  (
( x  e.  A  /\  ph )  <->  ( x  e.  B  /\  (
x  e.  A  /\  ph ) ) ) )
65rexbidv2 2500 1  |-  ( A 
C_  B  ->  ( E. x  e.  A  ph  <->  E. x  e.  B  ( x  e.  A  /\  ph ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2167   E.wrex 2476    C_ wss 3157
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-11 1520  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-rex 2481  df-in 3163  df-ss 3170
This theorem is referenced by:  1idprl  7657  1idpru  7658  ltexprlemm  7667  suplocexprlemmu  7785  oddnn02np1  12045  oddge22np1  12046  evennn02n  12047  evennn2n  12048  2lgslem1a  15329
  Copyright terms: Public domain W3C validator