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

Theorem fnsnsplitss 5914
Description: Split a function into a single point and all the rest. (Contributed by Stefan O'Rear, 27-Feb-2015.) (Revised by Jim Kingdon, 20-Jan-2023.)
Assertion
Ref Expression
fnsnsplitss  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( ( F  |`  ( A  \  { X } ) )  u. 
{ <. X ,  ( F `  X )
>. } )  C_  F
)

Proof of Theorem fnsnsplitss
StepHypRef Expression
1 difsnss 3861 . . . 4  |-  ( X  e.  A  ->  (
( A  \  { X } )  u.  { X } )  C_  A
)
21adantl 277 . . 3  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( ( A  \  { X } )  u. 
{ X } ) 
C_  A )
3 ssres2 5090 . . 3  |-  ( ( ( A  \  { X } )  u.  { X } )  C_  A  ->  ( F  |`  (
( A  \  { X } )  u.  { X } ) )  C_  ( F  |`  A ) )
42, 3syl 14 . 2  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  (
( A  \  { X } )  u.  { X } ) )  C_  ( F  |`  A ) )
5 resundi 5076 . . 3  |-  ( F  |`  ( ( A  \  { X } )  u. 
{ X } ) )  =  ( ( F  |`  ( A  \  { X } ) )  u.  ( F  |`  { X } ) )
6 fnressn 5901 . . . 4  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  { X } )  =  { <. X ,  ( F `
 X ) >. } )
76uneq2d 3383 . . 3  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( ( F  |`  ( A  \  { X } ) )  u.  ( F  |`  { X } ) )  =  ( ( F  |`  ( A  \  { X } ) )  u. 
{ <. X ,  ( F `  X )
>. } ) )
85, 7eqtrid 2283 . 2  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  (
( A  \  { X } )  u.  { X } ) )  =  ( ( F  |`  ( A  \  { X } ) )  u. 
{ <. X ,  ( F `  X )
>. } ) )
9 fnresdm 5492 . . 3  |-  ( F  Fn  A  ->  ( F  |`  A )  =  F )
109adantr 276 . 2  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  A )  =  F )
114, 8, 103sstr3d 3292 1  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( ( F  |`  ( A  \  { X } ) )  u. 
{ <. X ,  ( F `  X )
>. } )  C_  F
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209    \ cdif 3217    u. cun 3218    C_ wss 3220   {csn 3709   <.cop 3712    |` cres 4776    Fn wfn 5372   ` cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385
This theorem is used by:  funresdfunsnss  5918
  Copyright terms: Public domain W3C validator