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

Theorem fnunsn 5289
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 5229 . . . 4  |-  ( ( X  e.  _V  /\  Y  e.  _V )  ->  { <. X ,  Y >. }  Fn  { X } )
52, 3, 4syl2anc 409 . . 3  |-  ( ph  ->  { <. X ,  Y >. }  Fn  { X } )
6 fnunop.d . . . 4  |-  ( ph  ->  -.  X  e.  D
)
7 disjsn 3632 . . . 4  |-  ( ( D  i^i  { X } )  =  (/)  <->  -.  X  e.  D )
86, 7sylibr 133 . . 3  |-  ( ph  ->  ( D  i^i  { X } )  =  (/) )
9 fnun 5288 . . 3  |-  ( ( ( F  Fn  D  /\  { <. X ,  Y >. }  Fn  { X } )  /\  ( D  i^i  { X }
)  =  (/) )  -> 
( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X }
) )
101, 5, 8, 9syl21anc 1226 . 2  |-  ( ph  ->  ( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X }
) )
11 fnunop.g . . . 4  |-  G  =  ( F  u.  { <. X ,  Y >. } )
1211fneq1i 5276 . . 3  |-  ( G  Fn  E  <->  ( F  u.  { <. X ,  Y >. } )  Fn  E
)
13 fnunop.e . . . 4  |-  E  =  ( D  u.  { X } )
1413fneq2i 5277 . . 3  |-  ( ( F  u.  { <. X ,  Y >. } )  Fn  E  <->  ( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X } ) )
1512, 14bitri 183 . 2  |-  ( G  Fn  E  <->  ( F  u.  { <. X ,  Y >. } )  Fn  ( D  u.  { X } ) )
1610, 15sylibr 133 1  |-  ( ph  ->  G  Fn  E )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1342    e. wcel 2135   _Vcvv 2721    u. cun 3109    i^i cin 3110   (/)c0 3404   {csn 3570   <.cop 3573    Fn wfn 5177
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-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-v 2723  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-nul 3405  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-br 3977  df-opab 4038  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-fun 5184  df-fn 5185
This theorem is referenced by:  tfrlemisucfn  6283  tfr1onlemsucfn  6299
  Copyright terms: Public domain W3C validator