Theorem fun 5538

Description: The union of two functions with disjoint domains. (Contributed by NM, 22-Sep-2004.)

Assertion

Ref	Expression
fun	|- ( ( ( F : A --> C /\ G : B --> D ) /\ ( A i^i B ) = (/) ) -> ( F u. G ) : ( A u. B ) --> ( C u. D ) )

Proof of Theorem fun

Step	Hyp	Ref	Expression
1		fnun 5466	. . . . 5 |- ( ( ( F Fn A /\ G Fn B ) /\ ( A i^i B ) = (/) ) -> ( F u. G ) Fn ( A u. B ) )
2	1	expcom 116	. . . 4 |- ( ( A i^i B ) = (/) -> ( ( F Fn A /\ G Fn B ) -> ( F u. G ) Fn ( A u. B ) ) )
3		rnun 5173	. . . . . 6 |- ran ( F u. G ) = ( ran F u. ran G )
4		unss12 3393	. . . . . 6 |- ( ( ran F C_ C /\ ran G C_ D ) -> ( ran F u. ran G ) C_ ( C u. D ) )
5	3, 4	eqsstrid 3286	. . . . 5 |- ( ( ran F C_ C /\ ran G C_ D ) -> ran ( F u. G ) C_ ( C u. D ) )
6	5	a1i 9	. . . 4 |- ( ( A i^i B ) = (/) -> ( ( ran F C_ C /\ ran G C_ D ) -> ran ( F u. G ) C_ ( C u. D ) ) )
7	2, 6	anim12d 335	. . 3 |- ( ( A i^i B ) = (/) -> ( ( ( F Fn A /\ G Fn B ) /\ ( ran F C_ C /\ ran G C_ D ) ) -> ( ( F u. G ) Fn ( A u. B ) /\ ran ( F u. G ) C_ ( C u. D ) ) ) )
8		df-f 5358	. . . . 5 |- ( F : A --> C <-> ( F Fn A /\ ran F C_ C ) )
9		df-f 5358	. . . . 5 |- ( G : B --> D <-> ( G Fn B /\ ran G C_ D ) )
10	8, 9	anbi12i 460	. . . 4 |- ( ( F : A --> C /\ G : B --> D ) <-> ( ( F Fn A /\ ran F C_ C ) /\ ( G Fn B /\ ran G C_ D ) ) )
11		an4 588	. . . 4 |- ( ( ( F Fn A /\ ran F C_ C ) /\ ( G Fn B /\ ran G C_ D ) ) <-> ( ( F Fn A /\ G Fn B ) /\ ( ran F C_ C /\ ran G C_ D ) ) )
12	10, 11	bitri 184	. . 3 |- ( ( F : A --> C /\ G : B --> D ) <-> ( ( F Fn A /\ G Fn B ) /\ ( ran F C_ C /\ ran G C_ D ) ) )
13		df-f 5358	. . 3 |- ( ( F u. G ) : ( A u. B ) --> ( C u. D ) <-> ( ( F u. G ) Fn ( A u. B ) /\ ran ( F u. G ) C_ ( C u. D ) ) )
14	7, 12, 13	3imtr4g 205	. 2 |- ( ( A i^i B ) = (/) -> ( ( F : A --> C /\ G : B --> D ) -> ( F u. G ) : ( A u. B ) --> ( C u. D ) ) )
15	14	impcom 125	1 |- ( ( ( F : A --> C /\ G : B --> D ) /\ ( A i^i B ) = (/) ) -> ( F u. G ) : ( A u. B ) --> ( C u. D ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1398   u. cun 3211   i^i cin 3212   C_ wss 3213   (/)c0 3510   ran crn 4752   Fn wfn 5349   -->wf 5350

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-v 2817  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-br 4112  df-opab 4174  df-id 4416  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-fun 5356  df-fn 5357  df-f 5358

This theorem is referenced by:  fun2  5539  ftpg  5870  fsnunf  5886  cats1un  11417