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

Theorem fvun1 5699
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
StepHypRef Expression
1 fnfun 5417 . . 3  |-  ( F  Fn  A  ->  Fun  F )
213ad2ant1 1042 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  Fun  F )
3 fnfun 5417 . . 3  |-  ( G  Fn  B  ->  Fun  G )
433ad2ant2 1043 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  Fun  G )
5 fndm 5419 . . . . . . 7  |-  ( F  Fn  A  ->  dom  F  =  A )
6 fndm 5419 . . . . . . 7  |-  ( G  Fn  B  ->  dom  G  =  B )
75, 6ineqan12d 3407 . . . . . 6  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( dom  F  i^i  dom 
G )  =  ( A  i^i  B ) )
87eqeq1d 2238 . . . . 5  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( dom  F  i^i  dom  G )  =  (/) 
<->  ( A  i^i  B
)  =  (/) ) )
98biimprd 158 . . . 4  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( A  i^i  B )  =  (/)  ->  ( dom  F  i^i  dom  G
)  =  (/) ) )
109adantrd 279 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( ( ( A  i^i  B )  =  (/)  /\  X  e.  A
)  ->  ( dom  F  i^i  dom  G )  =  (/) ) )
11103impia 1224 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  -> 
( dom  F  i^i  dom 
G )  =  (/) )
12 simp3r 1050 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  X  e.  A )
135eleq2d 2299 . . . 4  |-  ( F  Fn  A  ->  ( X  e.  dom  F  <->  X  e.  A ) )
14133ad2ant1 1042 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  -> 
( X  e.  dom  F  <-> 
X  e.  A ) )
1512, 14mpbird 167 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  X  e.  dom  F )
16 funun 5361 . . . . . . 7  |-  ( ( ( Fun  F  /\  Fun  G )  /\  ( dom  F  i^i  dom  G
)  =  (/) )  ->  Fun  ( F  u.  G
) )
17 ssun1 3367 . . . . . . . . 9  |-  F  C_  ( F  u.  G
)
18 dmss 4921 . . . . . . . . 9  |-  ( F 
C_  ( F  u.  G )  ->  dom  F 
C_  dom  ( F  u.  G ) )
1917, 18ax-mp 5 . . . . . . . 8  |-  dom  F  C_ 
dom  ( F  u.  G )
2019sseli 3220 . . . . . . 7  |-  ( X  e.  dom  F  ->  X  e.  dom  ( F  u.  G ) )
2116, 20anim12i 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
) ) )
2221anasss 399 . . . . 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
) ) )
23223impa 1218 . . . 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 5696 . . . 4  |-  ( ( Fun  ( F  u.  G )  /\  X  e.  dom  ( F  u.  G ) )  -> 
( ( F  u.  G ) `  X
)  =  U. (
( F  u.  G
) " { X } ) )
2523, 24syl 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 5141 . . . . . 6  |-  ( ( F  u.  G )
" { X }
)  =  ( ( F " { X } )  u.  ( G " { X }
) )
2726a1i 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 } ) ) )
2827unieqd 3898 . . . 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 3546 . . . . . . . . 9  |-  ( ( ( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
)  ->  -.  X  e.  dom  G )
30 ndmima 5104 . . . . . . . . 9  |-  ( -.  X  e.  dom  G  ->  ( G " { X } )  =  (/) )
3129, 30syl 14 . . . . . . . 8  |-  ( ( ( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
)  ->  ( G " { X } )  =  (/) )
32313ad2ant3 1044 . . . . . . 7  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( G " { X } )  =  (/) )
3332uneq2d 3358 . . . . . 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 3525 . . . . . 6  |-  ( ( F " { X } )  u.  (/) )  =  ( F " { X } )
3533, 34eqtrdi 2278 . . . . 5  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( ( F
" { X }
)  u.  ( G
" { X }
) )  =  ( F " { X } ) )
3635unieqd 3898 . . . 4  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  U. ( ( F
" { X }
)  u.  ( G
" { X }
) )  =  U. ( F " { X } ) )
3728, 36eqtrd 2262 . . 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 5696 . . . . . 6  |-  ( ( Fun  F  /\  X  e.  dom  F )  -> 
( F `  X
)  =  U. ( F " { X }
) )
3938eqcomd 2235 . . . . 5  |-  ( ( Fun  F  /\  X  e.  dom  F )  ->  U. ( F " { X } )  =  ( F `  X ) )
4039adantrl 478 . . . 4  |-  ( ( Fun  F  /\  (
( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
) )  ->  U. ( F " { X }
)  =  ( F `
 X ) )
41403adant2 1040 . . 3  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  U. ( F " { X } )  =  ( F `  X
) )
4225, 37, 413eqtrd 2266 . 2  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( ( F  u.  G ) `  X )  =  ( F `  X ) )
432, 4, 11, 15, 42syl112anc 1275 1  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  -> 
( ( F  u.  G ) `  X
)  =  ( F `
 X ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1002    = wceq 1395    e. wcel 2200    u. cun 3195    i^i cin 3196    C_ wss 3197   (/)c0 3491   {csn 3666   U.cuni 3887   dom cdm 4718   "cima 4721   Fun wfun 5311    Fn wfn 5312   ` cfv 5317
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3888  df-br 4083  df-opab 4145  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-res 4730  df-ima 4731  df-iota 5277  df-fun 5319  df-fn 5320  df-fv 5325
This theorem is referenced by:  fvun2  5700  caseinl  7254
  Copyright terms: Public domain W3C validator