MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  foun Structured version   Visualization version   Unicode version

Theorem foun 6155
Description: The union of two onto functions with disjoint domains is an onto function. (Contributed by Mario Carneiro, 22-Jun-2016.)
Assertion
Ref Expression
foun  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ( F  u.  G ) : ( A  u.  C
) -onto-> ( B  u.  D ) )

Proof of Theorem foun
StepHypRef Expression
1 fofn 6117 . . . 4  |-  ( F : A -onto-> B  ->  F  Fn  A )
2 fofn 6117 . . . 4  |-  ( G : C -onto-> D  ->  G  Fn  C )
31, 2anim12i 590 . . 3  |-  ( ( F : A -onto-> B  /\  G : C -onto-> D
)  ->  ( F  Fn  A  /\  G  Fn  C ) )
4 fnun 5997 . . 3  |-  ( ( ( F  Fn  A  /\  G  Fn  C
)  /\  ( A  i^i  C )  =  (/) )  ->  ( F  u.  G )  Fn  ( A  u.  C )
)
53, 4sylan 488 . 2  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ( F  u.  G )  Fn  ( A  u.  C
) )
6 rnun 5541 . . 3  |-  ran  ( F  u.  G )  =  ( ran  F  u.  ran  G )
7 forn 6118 . . . . 5  |-  ( F : A -onto-> B  ->  ran  F  =  B )
87ad2antrr 762 . . . 4  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ran  F  =  B )
9 forn 6118 . . . . 5  |-  ( G : C -onto-> D  ->  ran  G  =  D )
109ad2antlr 763 . . . 4  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ran  G  =  D )
118, 10uneq12d 3768 . . 3  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ( ran 
F  u.  ran  G
)  =  ( B  u.  D ) )
126, 11syl5eq 2668 . 2  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ran  ( F  u.  G )  =  ( B  u.  D ) )
13 df-fo 5894 . 2  |-  ( ( F  u.  G ) : ( A  u.  C ) -onto-> ( B  u.  D )  <->  ( ( F  u.  G )  Fn  ( A  u.  C
)  /\  ran  ( F  u.  G )  =  ( B  u.  D
) ) )
145, 12, 13sylanbrc 698 1  |-  ( ( ( F : A -onto-> B  /\  G : C -onto-> D )  /\  ( A  i^i  C )  =  (/) )  ->  ( F  u.  G ) : ( A  u.  C
) -onto-> ( B  u.  D ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    u. cun 3572    i^i cin 3573   (/)c0 3915   ran crn 5115    Fn wfn 5883   -onto->wfo 5886
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-id 5024  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891  df-f 5892  df-fo 5894
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator