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

Theorem rexss 3169
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 3096 . . . . 5  |-  ( A 
C_  B  ->  (
x  e.  A  ->  x  e.  B )
)
21pm4.71rd 392 . . . 4  |-  ( A 
C_  B  ->  (
x  e.  A  <->  ( x  e.  B  /\  x  e.  A ) ) )
32anbi1d 461 . . 3  |-  ( A 
C_  B  ->  (
( x  e.  A  /\  ph )  <->  ( (
x  e.  B  /\  x  e.  A )  /\  ph ) ) )
4 anass 399 . . 3  |-  ( ( ( x  e.  B  /\  x  e.  A
)  /\  ph )  <->  ( x  e.  B  /\  (
x  e.  A  /\  ph ) ) )
53, 4syl6bb 195 . 2  |-  ( A 
C_  B  ->  (
( x  e.  A  /\  ph )  <->  ( x  e.  B  /\  (
x  e.  A  /\  ph ) ) ) )
65rexbidv2 2441 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 103    <-> wb 104    e. wcel 1481   E.wrex 2418    C_ wss 3076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-11 1485  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-rex 2423  df-in 3082  df-ss 3089
This theorem is referenced by:  1idprl  7422  1idpru  7423  ltexprlemm  7432  suplocexprlemmu  7550  oddnn02np1  11613  oddge22np1  11614  evennn02n  11615  evennn2n  11616
  Copyright terms: Public domain W3C validator