MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnsnsplit Structured version   Visualization version   Unicode version

Theorem fnsnsplit 6450
Description: Split a function into a single point and all the rest. (Contributed by Stefan O'Rear, 27-Feb-2015.)
Assertion
Ref Expression
fnsnsplit  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  F  =  ( ( F  |`  ( A  \  { X } ) )  u.  { <. X ,  ( F `  X ) >. } ) )

Proof of Theorem fnsnsplit
StepHypRef Expression
1 fnresdm 6000 . . 3  |-  ( F  Fn  A  ->  ( F  |`  A )  =  F )
21adantr 481 . 2  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  A )  =  F )
3 resundi 5410 . . 3  |-  ( F  |`  ( ( A  \  { X } )  u. 
{ X } ) )  =  ( ( F  |`  ( A  \  { X } ) )  u.  ( F  |`  { X } ) )
4 difsnid 4341 . . . . 5  |-  ( X  e.  A  ->  (
( A  \  { X } )  u.  { X } )  =  A )
54adantl 482 . . . 4  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( ( A  \  { X } )  u. 
{ X } )  =  A )
65reseq2d 5396 . . 3  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  (
( A  \  { X } )  u.  { X } ) )  =  ( F  |`  A ) )
7 fnressn 6425 . . . 4  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  { X } )  =  { <. X ,  ( F `
 X ) >. } )
87uneq2d 3767 . . 3  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( ( F  |`  ( A  \  { X } ) )  u.  ( F  |`  { X } ) )  =  ( ( F  |`  ( A  \  { X } ) )  u. 
{ <. X ,  ( F `  X )
>. } ) )
93, 6, 83eqtr3a 2680 . 2  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  ( F  |`  A )  =  ( ( F  |`  ( A  \  { X } ) )  u. 
{ <. X ,  ( F `  X )
>. } ) )
102, 9eqtr3d 2658 1  |-  ( ( F  Fn  A  /\  X  e.  A )  ->  F  =  ( ( F  |`  ( A  \  { X } ) )  u.  { <. X ,  ( F `  X ) >. } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990    \ cdif 3571    u. cun 3572   {csn 4177   <.cop 4183    |` cres 5116    Fn wfn 5883   ` cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896
This theorem is referenced by:  funresdfunsn  6455  ralxpmap  7907  reprsuc  30693  finixpnum  33394  poimirlem4  33413
  Copyright terms: Public domain W3C validator