ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1oun Unicode version

Theorem f1oun 5197
Description: The union of two one-to-one onto functions with disjoint domains and ranges. (Contributed by NM, 26-Mar-1998.)
Assertion
Ref Expression
f1oun  |-  ( ( ( F : A -1-1-onto-> B  /\  G : C -1-1-onto-> D )  /\  ( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) ) )  ->  ( F  u.  G ) : ( A  u.  C ) -1-1-onto-> ( B  u.  D ) )

Proof of Theorem f1oun
StepHypRef Expression
1 dff1o4 5185 . . . 4  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
2 dff1o4 5185 . . . 4  |-  ( G : C -1-1-onto-> D  <->  ( G  Fn  C  /\  `' G  Fn  D ) )
3 fnun 5056 . . . . . . 7  |-  ( ( ( F  Fn  A  /\  G  Fn  C
)  /\  ( A  i^i  C )  =  (/) )  ->  ( F  u.  G )  Fn  ( A  u.  C )
)
43ex 113 . . . . . 6  |-  ( ( F  Fn  A  /\  G  Fn  C )  ->  ( ( A  i^i  C )  =  (/)  ->  ( F  u.  G )  Fn  ( A  u.  C
) ) )
5 fnun 5056 . . . . . . . 8  |-  ( ( ( `' F  Fn  B  /\  `' G  Fn  D )  /\  ( B  i^i  D )  =  (/) )  ->  ( `' F  u.  `' G
)  Fn  ( B  u.  D ) )
6 cnvun 4779 . . . . . . . . 9  |-  `' ( F  u.  G )  =  ( `' F  u.  `' G )
76fneq1i 5044 . . . . . . . 8  |-  ( `' ( F  u.  G
)  Fn  ( B  u.  D )  <->  ( `' F  u.  `' G
)  Fn  ( B  u.  D ) )
85, 7sylibr 132 . . . . . . 7  |-  ( ( ( `' F  Fn  B  /\  `' G  Fn  D )  /\  ( B  i^i  D )  =  (/) )  ->  `' ( F  u.  G )  Fn  ( B  u.  D ) )
98ex 113 . . . . . 6  |-  ( ( `' F  Fn  B  /\  `' G  Fn  D
)  ->  ( ( B  i^i  D )  =  (/)  ->  `' ( F  u.  G )  Fn  ( B  u.  D
) ) )
104, 9im2anan9 563 . . . . 5  |-  ( ( ( F  Fn  A  /\  G  Fn  C
)  /\  ( `' F  Fn  B  /\  `' G  Fn  D
) )  ->  (
( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) )  ->  ( ( F  u.  G )  Fn  ( A  u.  C )  /\  `' ( F  u.  G
)  Fn  ( B  u.  D ) ) ) )
1110an4s 553 . . . 4  |-  ( ( ( F  Fn  A  /\  `' F  Fn  B
)  /\  ( G  Fn  C  /\  `' G  Fn  D ) )  -> 
( ( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) )  -> 
( ( F  u.  G )  Fn  ( A  u.  C )  /\  `' ( F  u.  G )  Fn  ( B  u.  D )
) ) )
121, 2, 11syl2anb 285 . . 3  |-  ( ( F : A -1-1-onto-> B  /\  G : C -1-1-onto-> D )  ->  (
( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) )  ->  ( ( F  u.  G )  Fn  ( A  u.  C )  /\  `' ( F  u.  G
)  Fn  ( B  u.  D ) ) ) )
13 dff1o4 5185 . . 3  |-  ( ( F  u.  G ) : ( A  u.  C ) -1-1-onto-> ( B  u.  D
)  <->  ( ( F  u.  G )  Fn  ( A  u.  C
)  /\  `' ( F  u.  G )  Fn  ( B  u.  D
) ) )
1412, 13syl6ibr 160 . 2  |-  ( ( F : A -1-1-onto-> B  /\  G : C -1-1-onto-> D )  ->  (
( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) )  ->  ( F  u.  G ) : ( A  u.  C
)
-1-1-onto-> ( B  u.  D
) ) )
1514imp 122 1  |-  ( ( ( F : A -1-1-onto-> B  /\  G : C -1-1-onto-> D )  /\  ( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) ) )  ->  ( F  u.  G ) : ( A  u.  C ) -1-1-onto-> ( B  u.  D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    = wceq 1285    u. cun 2980    i^i cin 2981   (/)c0 3267   `'ccnv 4390    Fn wfn 4947   -1-1-onto->wf1o 4951
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3916  ax-pow 3968  ax-pr 3992
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-v 2612  df-dif 2984  df-un 2986  df-in 2988  df-ss 2995  df-nul 3268  df-pw 3402  df-sn 3422  df-pr 3423  df-op 3425  df-br 3806  df-opab 3860  df-id 4076  df-rel 4398  df-cnv 4399  df-co 4400  df-dm 4401  df-rn 4402  df-fun 4954  df-fn 4955  df-f 4956  df-f1 4957  df-fo 4958  df-f1o 4959
This theorem is referenced by:  f1oprg  5219  unen  6382
  Copyright terms: Public domain W3C validator