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

Theorem fresaunres1disj 5537
Description: From the union of two functions with disjoint domains, either component can be recovered by restriction. (Contributed by Mario Carneiro, 16-Feb-2015.) (Revised by Jim Kingdon, 18-May-2026.)
Assertion
Ref Expression
fresaunres1disj  |-  ( ( F : A --> C  /\  G : B --> C  /\  ( A  i^i  B )  =  (/) )  ->  (
( F  u.  G
)  |`  A )  =  F )

Proof of Theorem fresaunres1disj
StepHypRef Expression
1 fresaunres2disj 5536 . . 3  |-  ( ( G : B --> C  /\  F : A --> C  /\  ( B  i^i  A )  =  (/) )  ->  (
( G  u.  F
)  |`  A )  =  F )
213com12 1234 . 2  |-  ( ( F : A --> C  /\  G : B --> C  /\  ( B  i^i  A )  =  (/) )  ->  (
( G  u.  F
)  |`  A )  =  F )
3 incom 3410 . . . 4  |-  ( B  i^i  A )  =  ( A  i^i  B
)
43eqeq1i 2240 . . 3  |-  ( ( B  i^i  A )  =  (/)  <->  ( A  i^i  B )  =  (/) )
543anbi3i 1219 . 2  |-  ( ( F : A --> C  /\  G : B --> C  /\  ( B  i^i  A )  =  (/) )  <->  ( F : A --> C  /\  G : B --> C  /\  ( A  i^i  B )  =  (/) ) )
6 uncom 3362 . . . 4  |-  ( G  u.  F )  =  ( F  u.  G
)
76reseq1i 5025 . . 3  |-  ( ( G  u.  F )  |`  A )  =  ( ( F  u.  G
)  |`  A )
87eqeq1i 2240 . 2  |-  ( ( ( G  u.  F
)  |`  A )  =  F  <->  ( ( F  u.  G )  |`  A )  =  F )
92, 5, 83imtr3i 200 1  |-  ( ( F : A --> C  /\  G : B --> C  /\  ( A  i^i  B )  =  (/) )  ->  (
( F  u.  G
)  |`  A )  =  F )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 1005    = wceq 1398    u. cun 3208    i^i cin 3209   (/)c0 3505    |` cres 4742   -->wf 5339
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 2206  ax-ext 2214  ax-sep 4221  ax-pow 4279  ax-pr 4314
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3506  df-pw 3667  df-sn 3688  df-pr 3689  df-op 3691  df-br 4103  df-opab 4165  df-xp 4746  df-rel 4747  df-dm 4750  df-res 4752  df-fun 5345  df-fn 5346  df-f 5347
This theorem is referenced by:  mapunen  7095
  Copyright terms: Public domain W3C validator