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

Theorem ssrexf 3204
Description: Restricted existential quantification follows from a subclass relationship. (Contributed by Glauco Siliprandi, 20-Apr-2017.)
Hypotheses
Ref Expression
ssrexf.1  |-  F/_ x A
ssrexf.2  |-  F/_ x B
Assertion
Ref Expression
ssrexf  |-  ( A 
C_  B  ->  ( E. x  e.  A  ph 
->  E. x  e.  B  ph ) )

Proof of Theorem ssrexf
StepHypRef Expression
1 ssrexf.1 . . . 4  |-  F/_ x A
2 ssrexf.2 . . . 4  |-  F/_ x B
31, 2nfss 3135 . . 3  |-  F/ x  A  C_  B
4 ssel 3136 . . . 4  |-  ( A 
C_  B  ->  (
x  e.  A  ->  x  e.  B )
)
54anim1d 334 . . 3  |-  ( A 
C_  B  ->  (
( x  e.  A  /\  ph )  ->  (
x  e.  B  /\  ph ) ) )
63, 5eximd 1600 . 2  |-  ( A 
C_  B  ->  ( E. x ( x  e.  A  /\  ph )  ->  E. x ( x  e.  B  /\  ph ) ) )
7 df-rex 2450 . 2  |-  ( E. x  e.  A  ph  <->  E. x ( x  e.  A  /\  ph )
)
8 df-rex 2450 . 2  |-  ( E. x  e.  B  ph  <->  E. x ( x  e.  B  /\  ph )
)
96, 7, 83imtr4g 204 1  |-  ( A 
C_  B  ->  ( E. x  e.  A  ph 
->  E. x  e.  B  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103   E.wex 1480    e. wcel 2136   F/_wnfc 2295   E.wrex 2445    C_ wss 3116
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-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-in 3122  df-ss 3129
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator