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

Theorem fnunsn 5026
Description: Extension of a function with a new ordered pair. (Contributed by NM, 28-Sep-2013.) (Revised by Mario Carneiro, 30-Apr-2015.)
Hypotheses
Ref Expression
fnunop.x  |-  ( ph  ->  X  e.  _V )
fnunop.y  |-  ( ph  ->  Y  e.  _V )
fnunop.f  |-  ( ph  ->  F  Fn  D )
fnunop.g  |-  G  =  ( F  u.  { <. X ,  Y >. } )
fnunop.e  |-  E  =  ( D  u.  { X } )
fnunop.d  |-  ( ph  ->  -.  X  e.  D
)
Assertion
Ref Expression
fnunsn  |-  ( ph  ->  G  Fn  E )

Proof of Theorem fnunsn
StepHypRef Expression
1 fnunop.f . . 3  |-  ( ph  ->  F  Fn  D )
2 fnunop.x . . . 4  |-  ( ph  ->  X  e.  _V )
3 fnunop.y . . . 4  |-  ( ph  ->  Y  e.  _V )
4 fnsng 4967 . . . 4  |-  ( ( X  e.  _V  /\  Y  e.  _V )  ->  { <. X ,  Y >. }  Fn  { X } )
52, 3, 4syl2anc 403 . . 3  |-  ( ph  ->  { <. X ,  Y >. }  Fn  { X } )
6 fnunop.d . . . 4  |-  ( ph  ->  -.  X  e.  D
)
7 disjsn 3454 . . . 4  |-  ( ( D  i^i  { X } )  =  (/)  <->  -.  X  e.  D )
86, 7sylibr 132 . . 3  |-  ( ph  ->  ( D  i^i  { X } )  =  (/) )
9 fnun 5025 . . 3  |-  ( ( ( F  Fn  D  /\  { <. X ,  Y >. }  Fn  { X } )  /\  ( D  i^i  { X }
)  =  (/) )  -> 
( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X }
) )
101, 5, 8, 9syl21anc 1168 . 2  |-  ( ph  ->  ( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X }
) )
11 fnunop.g . . . 4  |-  G  =  ( F  u.  { <. X ,  Y >. } )
1211fneq1i 5013 . . 3  |-  ( G  Fn  E  <->  ( F  u.  { <. X ,  Y >. } )  Fn  E
)
13 fnunop.e . . . 4  |-  E  =  ( D  u.  { X } )
1413fneq2i 5014 . . 3  |-  ( ( F  u.  { <. X ,  Y >. } )  Fn  E  <->  ( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X } ) )
1512, 14bitri 182 . 2  |-  ( G  Fn  E  <->  ( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X } ) )
1610, 15sylibr 132 1  |-  ( ph  ->  G  Fn  E )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1284    e. wcel 1433   _Vcvv 2601    u. cun 2971    i^i cin 2972   (/)c0 3251   {csn 3398   <.cop 3401    Fn wfn 4917
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-fun 4924  df-fn 4925
This theorem is referenced by:  tfrlemisucfn  5961
  Copyright terms: Public domain W3C validator