Theorem fnun 3586

Description: The union of two functions with disjoint domains.

Assertion

Ref	Expression
fnun	|- (((F Fn A /\ G Fn B) /\ (A i^i B) = (/)) -> (F u. G) Fn (A u. B))

Proof of Theorem fnun

Step	Hyp	Ref	Expression
1		ineq12 2208	. . . . . . . . . . 11 |- ((dom F = A /\ dom G = B) -> (dom F i^i dom G) = (A i^i B))
2	1	eqeq1d 1480	. . . . . . . . . 10 |- ((dom F = A /\ dom G = B) -> ((dom F i^i dom G) = (/) <-> (A i^i B) = (/)))
3	2	anbi2d 615	. . . . . . . . 9 |- ((dom F = A /\ dom G = B) -> (((Fun F /\ Fun G) /\ (dom F i^i dom G) = (/)) <-> ((Fun F /\ Fun G) /\ (A i^i B) = (/))))
4		funun 3546	. . . . . . . . 9 |- (((Fun F /\ Fun G) /\ (dom F i^i dom G) = (/)) -> Fun (F u. G))
5	3, 4	syl6bir 215	. . . . . . . 8 |- ((dom F = A /\ dom G = B) -> (((Fun F /\ Fun G) /\ (A i^i B) = (/)) -> Fun (F u. G)))
6		uneq12 2175	. . . . . . . . 9 |- ((dom F = A /\ dom G = B) -> (dom F u. dom G) = (A u. B))
7		dmun 3312	. . . . . . . . 9 |- dom ( F u. G) = (dom F u. dom G)
8	6, 7	syl5eq 1516	. . . . . . . 8 |- ((dom F = A /\ dom G = B) -> dom ( F u. G) = (A u. B))
9	5, 8	jctird 601	. . . . . . 7 |- ((dom F = A /\ dom G = B) -> (((Fun F /\ Fun G) /\ (A i^i B) = (/)) -> (Fun (F u. G) /\ dom ( F u. G) = (A u. B))))
10		df-fn 3188	. . . . . . 7 |- ((F u. G) Fn (A u. B) <-> (Fun (F u. G) /\ dom ( F u. G) = (A u. B)))
11	9, 10	syl6ibr 213	. . . . . 6 |- ((dom F = A /\ dom G = B) -> (((Fun F /\ Fun G) /\ (A i^i B) = (/)) -> (F u. G) Fn (A u. B)))
12	11	exp3a 375	. . . . 5 |- ((dom F = A /\ dom G = B) -> ((Fun F /\ Fun G) -> ((A i^i B) = (/) -> (F u. G) Fn (A u. B))))
13	12	impcom 351	. . . 4 |- (((Fun F /\ Fun G) /\ (dom F = A /\ dom G = B)) -> ((A i^i B) = (/) -> (F u. G) Fn (A u. B)))
14	13	an4s 508	. . 3 |- (((Fun F /\ dom F = A) /\ (Fun G /\ dom G = B)) -> ((A i^i B) = (/) -> (F u. G) Fn (A u. B)))
15		df-fn 3188	. . 3 |- (F Fn A <-> (Fun F /\ dom F = A))
16		df-fn 3188	. . 3 |- (G Fn B <-> (Fun G /\ dom G = B))
17	14, 15, 16	syl2anb 455	. 2 |- ((F Fn A /\ G Fn B) -> ((A i^i B) = (/) -> (F u. G) Fn (A u. B)))
18	17	imp 350	1 |- (((F Fn A /\ G Fn B) /\ (A i^i B) = (/)) -> (F u. G) Fn (A u. B))

Syntax hints:   -> wi 3   /\ wa 223   = wceq 954   u. cun 2041   i^i cin 2042  (/)c0 2276  dom cdm 3165  Fun wfun 3171   Fn wfn 3172

This theorem is referenced by:  fun 3632  f1oun 3697

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-br 2615  df-opab 2662  df-id 2830  df-rel 3180  df-cnv 3181  df-co 3182  df-dm 3183  df-fun 3187  df-fn 3188

Copyright terms: Public domain