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

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

Proof of Theorem ralss
StepHypRef Expression
1 ssel 2939 . . . . 5  |-  ( A 
C_  B  ->  (
x  e.  A  ->  x  e.  B )
)
21pm4.71rd 374 . . . 4  |-  ( A 
C_  B  ->  (
x  e.  A  <->  ( x  e.  B  /\  x  e.  A ) ) )
32imbi1d 220 . . 3  |-  ( A 
C_  B  ->  (
( x  e.  A  ->  ph )  <->  ( (
x  e.  B  /\  x  e.  A )  ->  ph ) ) )
4 impexp 250 . . 3  |-  ( ( ( x  e.  B  /\  x  e.  A
)  ->  ph )  <->  ( x  e.  B  ->  ( x  e.  A  ->  ph )
) )
53, 4syl6bb 185 . 2  |-  ( A 
C_  B  ->  (
( x  e.  A  ->  ph )  <->  ( x  e.  B  ->  ( x  e.  A  ->  ph )
) ) )
65ralbidv2 2328 1  |-  ( A 
C_  B  ->  ( A. x  e.  A  ph  <->  A. x  e.  B  ( x  e.  A  ->  ph ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    e. wcel 1393   A.wral 2306    C_ wss 2917
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-11 1397  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-ral 2311  df-in 2924  df-ss 2931
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator