Theorem fvun1 5769

Description: The value of a union when the argument is in the first domain. (Contributed by Scott Fenton, 29-Jun-2013.)

Assertion

Ref	Expression
fvun1	|- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> ( ( F u. G ) ` X ) = ( F ` X ) )

Proof of Theorem fvun1

Step	Hyp	Ref	Expression
1		fnfun 5478	. . 3 |- ( F Fn A -> Fun F )
2	1	3ad2ant1 1049	. 2 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> Fun F )
3		fnfun 5478	. . 3 |- ( G Fn B -> Fun G )
4	3	3ad2ant2 1050	. 2 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> Fun G )
5		fndm 5480	. . . . . . 7 |- ( F Fn A -> dom F = A )
6		fndm 5480	. . . . . . 7 |- ( G Fn B -> dom G = B )
7	5, 6	ineqan12d 3434	. . . . . 6 |- ( ( F Fn A /\ G Fn B ) -> ( dom F i^i dom G ) = ( A i^i B ) )
8	7	eqeq1d 2247	. . . . 5 |- ( ( F Fn A /\ G Fn B ) -> ( ( dom F i^i dom G ) = (/) <-> ( A i^i B ) = (/) ) )
9	8	biimprd 158	. . . 4 |- ( ( F Fn A /\ G Fn B ) -> ( ( A i^i B ) = (/) -> ( dom F i^i dom G ) = (/) ) )
10	9	adantrd 279	. . 3 |- ( ( F Fn A /\ G Fn B ) -> ( ( ( A i^i B ) = (/) /\ X e. A ) -> ( dom F i^i dom G ) = (/) ) )
11	10	3impia 1231	. 2 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> ( dom F i^i dom G ) = (/) )
12		simp3r 1057	. . 3 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> X e. A )
13	5	eleq2d 2308	. . . 4 |- ( F Fn A -> ( X e. dom F <-> X e. A ) )
14	13	3ad2ant1 1049	. . 3 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> ( X e. dom F <-> X e. A ) )
15	12, 14	mpbird 167	. 2 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> X e. dom F )
16		funun 5422	. . . . . . 7 |- ( ( ( Fun F /\ Fun G ) /\ ( dom F i^i dom G ) = (/) ) -> Fun ( F u. G ) )
17		ssun1 3392	. . . . . . . . 9 |- F C_ ( F u. G )
18		dmss 4980	. . . . . . . . 9 |- ( F C_ ( F u. G ) -> dom F C_ dom ( F u. G ) )
19	17, 18	ax-mp 5	. . . . . . . 8 |- dom F C_ dom ( F u. G )
20	19	sseli 3244	. . . . . . 7 |- ( X e. dom F -> X e. dom ( F u. G ) )
21	16, 20	anim12i 338	. . . . . 6 |- ( ( ( ( Fun F /\ Fun G ) /\ ( dom F i^i dom G ) = (/) ) /\ X e. dom F ) -> ( Fun ( F u. G ) /\ X e. dom ( F u. G ) ) )
22	21	anasss 403	. . . . 5 |- ( ( ( Fun F /\ Fun G ) /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( Fun ( F u. G ) /\ X e. dom ( F u. G ) ) )
23	22	3impa 1225	. . . 4 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( Fun ( F u. G ) /\ X e. dom ( F u. G ) ) )
24		funfvdm 5766	. . . 4 |- ( ( Fun ( F u. G ) /\ X e. dom ( F u. G ) ) -> ( ( F u. G ) ` X ) = U. ( ( F u. G ) " { X } ) )
25	23, 24	syl 14	. . 3 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( ( F u. G ) ` X ) = U. ( ( F u. G ) " { X } ) )
26		imaundir 5201	. . . . . 6 |- ( ( F u. G ) " { X } ) = ( ( F " { X } ) u. ( G " { X } ) )
27	26	a1i 9	. . . . 5 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( ( F u. G ) " { X } ) = ( ( F " { X } ) u. ( G " { X } ) ) )
28	27	unieqd 3946	. . . 4 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> U. ( ( F u. G ) " { X } ) = U. ( ( F " { X } ) u. ( G " { X } ) ) )
29		disjel 3579	. . . . . . . . 9 |- ( ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) -> -. X e. dom G )
30		ndmima 5164	. . . . . . . . 9 |- ( -. X e. dom G -> ( G " { X } ) = (/) )
31	29, 30	syl 14	. . . . . . . 8 |- ( ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) -> ( G " { X } ) = (/) )
32	31	3ad2ant3 1051	. . . . . . 7 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( G " { X } ) = (/) )
33	32	uneq2d 3383	. . . . . 6 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( ( F " { X } ) u. ( G " { X } ) ) = ( ( F " { X } ) u. (/) ) )
34		un0 3556	. . . . . 6 |- ( ( F " { X } ) u. (/) ) = ( F " { X } )
35	33, 34	eqtrdi 2287	. . . . 5 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( ( F " { X } ) u. ( G " { X } ) ) = ( F " { X } ) )
36	35	unieqd 3946	. . . 4 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> U. ( ( F " { X } ) u. ( G " { X } ) ) = U. ( F " { X } ) )
37	28, 36	eqtrd 2271	. . 3 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> U. ( ( F u. G ) " { X } ) = U. ( F " { X } ) )
38		funfvdm 5766	. . . . . 6 |- ( ( Fun F /\ X e. dom F ) -> ( F ` X ) = U. ( F " { X } ) )
39	38	eqcomd 2244	. . . . 5 |- ( ( Fun F /\ X e. dom F ) -> U. ( F " { X } ) = ( F ` X ) )
40	39	adantrl 482	. . . 4 |- ( ( Fun F /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> U. ( F " { X } ) = ( F ` X ) )
41	40	3adant2 1047	. . 3 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> U. ( F " { X } ) = ( F ` X ) )
42	25, 37, 41	3eqtrd 2275	. 2 |- ( ( Fun F /\ Fun G /\ ( ( dom F i^i dom G ) = (/) /\ X e. dom F ) ) -> ( ( F u. G ) ` X ) = ( F ` X ) )
43	2, 4, 11, 15, 42	syl112anc 1282	1 |- ( ( F Fn A /\ G Fn B /\ ( ( A i^i B ) = (/) /\ X e. A ) ) -> ( ( F u. G ) ` X ) = ( F ` X ) )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   /\ wa 104   <-> wb 105   /\ w3a 1009   = wceq 1402   e. wcel 2209   u. cun 3218   i^i cin 3219   C_ wss 3220   (/)c0 3520   {csn 3709   U.cuni 3935   dom cdm 4774   "cima 4777   Fun wfun 5371   Fn wfn 5372   ` cfv 5377

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385

This theorem is used by:  fvun2  5770  fvun1d  5771  caseinl  7431  vtxdfifiun  16538