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

Theorem iotass 5100
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 5083 . 2  |-  ( iota
x ph )  =  U. { y  |  {
x  |  ph }  =  { y } }
2 unieq 3740 . . . . . . . 8  |-  ( { x  |  ph }  =  { y }  ->  U. { x  |  ph }  =  U. { y } )
3 vex 2684 . . . . . . . . 9  |-  y  e. 
_V
43unisn 3747 . . . . . . . 8  |-  U. {
y }  =  y
52, 4syl6eq 2186 . . . . . . 7  |-  ( { x  |  ph }  =  { y }  ->  U. { x  |  ph }  =  y )
6 df-pw 3507 . . . . . . . . . . 11  |-  ~P A  =  { x  |  x 
C_  A }
76sseq2i 3119 . . . . . . . . . 10  |-  ( { x  |  ph }  C_ 
~P A  <->  { x  |  ph }  C_  { x  |  x  C_  A }
)
8 ss2ab 3160 . . . . . . . . . 10  |-  ( { x  |  ph }  C_ 
{ x  |  x 
C_  A }  <->  A. x
( ph  ->  x  C_  A ) )
97, 8bitri 183 . . . . . . . . 9  |-  ( { x  |  ph }  C_ 
~P A  <->  A. x
( ph  ->  x  C_  A ) )
109biimpri 132 . . . . . . . 8  |-  ( A. x ( ph  ->  x 
C_  A )  ->  { x  |  ph }  C_ 
~P A )
11 sspwuni 3892 . . . . . . . 8  |-  ( { x  |  ph }  C_ 
~P A  <->  U. { x  |  ph }  C_  A
)
1210, 11sylib 121 . . . . . . 7  |-  ( A. x ( ph  ->  x 
C_  A )  ->  U. { x  |  ph }  C_  A )
13 sseq1 3115 . . . . . . . 8  |-  ( U. { x  |  ph }  =  y  ->  ( U. { x  |  ph }  C_  A  <->  y  C_  A
) )
1413biimpa 294 . . . . . . 7  |-  ( ( U. { x  | 
ph }  =  y  /\  U. { x  |  ph }  C_  A
)  ->  y  C_  A )
155, 12, 14syl2anr 288 . . . . . 6  |-  ( ( A. x ( ph  ->  x  C_  A )  /\  { x  |  ph }  =  { y } )  ->  y  C_  A )
1615ex 114 . . . . 5  |-  ( A. x ( ph  ->  x 
C_  A )  -> 
( { x  | 
ph }  =  {
y }  ->  y  C_  A ) )
1716ss2abdv 3165 . . . 4  |-  ( A. x ( ph  ->  x 
C_  A )  ->  { y  |  {
x  |  ph }  =  { y } }  C_ 
{ y  |  y 
C_  A } )
18 df-pw 3507 . . . 4  |-  ~P A  =  { y  |  y 
C_  A }
1917, 18sseqtrrdi 3141 . . 3  |-  ( A. x ( ph  ->  x 
C_  A )  ->  { y  |  {
x  |  ph }  =  { y } }  C_ 
~P A )
20 sspwuni 3892 . . 3  |-  ( { y  |  { x  |  ph }  =  {
y } }  C_  ~P A  <->  U. { y  |  { x  |  ph }  =  { y } }  C_  A )
2119, 20sylib 121 . 2  |-  ( A. x ( ph  ->  x 
C_  A )  ->  U. { y  |  {
x  |  ph }  =  { y } }  C_  A )
221, 21eqsstrid 3138 1  |-  ( A. x ( ph  ->  x 
C_  A )  -> 
( iota x ph )  C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1329    = wceq 1331   {cab 2123    C_ wss 3066   ~Pcpw 3505   {csn 3522   U.cuni 3731   iotacio 5081
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 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-uni 3732  df-iota 5083
This theorem is referenced by:  fvss  5428  riotaexg  5727
  Copyright terms: Public domain W3C validator