Theorem fnunsn 5349

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

Step	Hyp	Ref	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 5289	. . . 4 |- ( ( X e. _V /\ Y e. _V ) -> { <. X , Y >. } Fn { X } )
5	2, 3, 4	syl2anc 411	. . 3 |- ( ph -> { <. X , Y >. } Fn { X } )
6		fnunop.d	. . . 4 |- ( ph -> -. X e. D )
7		disjsn 3676	. . . 4 |- ( ( D i^i { X } ) = (/) <-> -. X e. D )
8	6, 7	sylibr 134	. . 3 |- ( ph -> ( D i^i { X } ) = (/) )
9		fnun 5348	. . 3 |- ( ( ( F Fn D /\ { <. X , Y >. } Fn { X } ) /\ ( D i^i { X } ) = (/) ) -> ( F u. { <. X , Y >. } ) Fn ( D u. { X } ) )
10	1, 5, 8, 9	syl21anc 1248	. 2 |- ( ph -> ( F u. { <. X , Y >. } ) Fn ( D u. { X } ) )
11		fnunop.g	. . . 4 |- G = ( F u. { <. X , Y >. } )
12	11	fneq1i 5336	. . 3 |- ( G Fn E <-> ( F u. { <. X , Y >. } ) Fn E )
13		fnunop.e	. . . 4 |- E = ( D u. { X } )
14	13	fneq2i 5337	. . 3 |- ( ( F u. { <. X , Y >. } ) Fn E <-> ( F u. { <. X , Y >. } ) Fn ( D u. { X } ) )
15	12, 14	bitri 184	. 2 |- ( G Fn E <-> ( F u. { <. X , Y >. } ) Fn ( D u. { X } ) )
16	10, 15	sylibr 134	1 |- ( ph -> G Fn E )

Syntax hints:   -. wn 3   -> wi 4   = wceq 1364   e. wcel 2160   _Vcvv 2756   u. cun 3146   i^i cin 3147   (/)c0 3441   {csn 3614   <.cop 3617   Fn wfn 5237

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4143  ax-pow 4199  ax-pr 4234

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2758  df-dif 3150  df-un 3152  df-in 3154  df-ss 3161  df-nul 3442  df-pw 3599  df-sn 3620  df-pr 3621  df-op 3623  df-br 4026  df-opab 4087  df-id 4318  df-xp 4657  df-rel 4658  df-cnv 4659  df-co 4660  df-dm 4661  df-fun 5244  df-fn 5245

This theorem is referenced by:  tfrlemisucfn  6357  tfr1onlemsucfn  6373