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

Theorem iotass 5197
Description: Value of iota based on a proposition which holds only for values which are subsets of a given class. (Contributed by Mario Carneiro and Jim Kingdon, 21-Dec-2018.)
Assertion
Ref Expression
iotass  |-  ( A. x ( ph  ->  x 
C_  A )  -> 
( iota x ph )  C_  A )
Distinct variable group:    x, A
Allowed substitution hint:    ph( x)

Proof of Theorem iotass
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 df-iota 5180 . 2  |-  ( iota
x ph )  =  U. { y  |  {
x  |  ph }  =  { y } }
2 unieq 3820 . . . . . . . 8  |-  ( { x  |  ph }  =  { y }  ->  U. { x  |  ph }  =  U. { y } )
3 vex 2742 . . . . . . . . 9  |-  y  e. 
_V
43unisn 3827 . . . . . . . 8  |-  U. {
y }  =  y
52, 4eqtrdi 2226 . . . . . . 7  |-  ( { x  |  ph }  =  { y }  ->  U. { x  |  ph }  =  y )
6 df-pw 3579 . . . . . . . . . . 11  |-  ~P A  =  { x  |  x 
C_  A }
76sseq2i 3184 . . . . . . . . . 10  |-  ( { x  |  ph }  C_ 
~P A  <->  { x  |  ph }  C_  { x  |  x  C_  A }
)
8 ss2ab 3225 . . . . . . . . . 10  |-  ( { x  |  ph }  C_ 
{ x  |  x 
C_  A }  <->  A. x
( ph  ->  x  C_  A ) )
97, 8bitri 184 . . . . . . . . 9  |-  ( { x  |  ph }  C_ 
~P A  <->  A. x
( ph  ->  x  C_  A ) )
109biimpri 133 . . . . . . . 8  |-  ( A. x ( ph  ->  x 
C_  A )  ->  { x  |  ph }  C_ 
~P A )
11 sspwuni 3973 . . . . . . . 8  |-  ( { x  |  ph }  C_ 
~P A  <->  U. { x  |  ph }  C_  A
)
1210, 11sylib 122 . . . . . . 7  |-  ( A. x ( ph  ->  x 
C_  A )  ->  U. { x  |  ph }  C_  A )
13 sseq1 3180 . . . . . . . 8  |-  ( U. { x  |  ph }  =  y  ->  ( U. { x  |  ph }  C_  A  <->  y  C_  A
) )
1413biimpa 296 . . . . . . 7  |-  ( ( U. { x  | 
ph }  =  y  /\  U. { x  |  ph }  C_  A
)  ->  y  C_  A )
155, 12, 14syl2anr 290 . . . . . 6  |-  ( ( A. x ( ph  ->  x  C_  A )  /\  { x  |  ph }  =  { y } )  ->  y  C_  A )
1615ex 115 . . . . 5  |-  ( A. x ( ph  ->  x 
C_  A )  -> 
( { x  | 
ph }  =  {
y }  ->  y  C_  A ) )
1716ss2abdv 3230 . . . 4  |-  ( A. x ( ph  ->  x 
C_  A )  ->  { y  |  {
x  |  ph }  =  { y } }  C_ 
{ y  |  y 
C_  A } )
18 df-pw 3579 . . . 4  |-  ~P A  =  { y  |  y 
C_  A }
1917, 18sseqtrrdi 3206 . . 3  |-  ( A. x ( ph  ->  x 
C_  A )  ->  { y  |  {
x  |  ph }  =  { y } }  C_ 
~P A )
20 sspwuni 3973 . . 3  |-  ( { y  |  { x  |  ph }  =  {
y } }  C_  ~P A  <->  U. { y  |  { x  |  ph }  =  { y } }  C_  A )
2119, 20sylib 122 . 2  |-  ( A. x ( ph  ->  x 
C_  A )  ->  U. { y  |  {
x  |  ph }  =  { y } }  C_  A )
221, 21eqsstrid 3203 1  |-  ( A. x ( ph  ->  x 
C_  A )  -> 
( iota x ph )  C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1351    = wceq 1353   {cab 2163    C_ wss 3131   ~Pcpw 3577   {csn 3594   U.cuni 3811   iotacio 5178
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  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-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-uni 3812  df-iota 5180
This theorem is referenced by:  fvss  5531  riotaexg  5837
  Copyright terms: Public domain W3C validator