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

Theorem fvun1 5763
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 5473 . . 3  |-  ( F  Fn  A  ->  Fun  F )
213ad2ant1 1049 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  Fun  F )
3 fnfun 5473 . . 3  |-  ( G  Fn  B  ->  Fun  G )
433ad2ant2 1050 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  Fun  G )
5 fndm 5475 . . . . . . 7  |-  ( F  Fn  A  ->  dom  F  =  A )
6 fndm 5475 . . . . . . 7  |-  ( G  Fn  B  ->  dom  G  =  B )
75, 6ineqan12d 3434 . . . . . 6  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( dom  F  i^i  dom 
G )  =  ( A  i^i  B ) )
87eqeq1d 2247 . . . . 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 1231 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  -> 
( dom  F  i^i  dom 
G )  =  (/) )
12 simp3r 1057 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  X  e.  A )
135eleq2d 2308 . . . 4  |-  ( F  Fn  A  ->  ( X  e.  dom  F  <->  X  e.  A ) )
14133ad2ant1 1049 . . 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 5417 . . . . . . 7  |-  ( ( ( Fun  F  /\  Fun  G )  /\  ( dom  F  i^i  dom  G
)  =  (/) )  ->  Fun  ( F  u.  G
) )
17 ssun1 3392 . . . . . . . . 9  |-  F  C_  ( F  u.  G
)
18 dmss 4975 . . . . . . . . 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 3244 . . . . . . 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 403 . . . . 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 1225 . . . 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 5760 . . . 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 5196 . . . . . 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 3941 . . . 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 3578 . . . . . . . . 9  |-  ( ( ( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
)  ->  -.  X  e.  dom  G )
30 ndmima 5159 . . . . . . . . 9  |-  ( -.  X  e.  dom  G  ->  ( G " { X } )  =  (/) )
3129, 30syl 14 . . . . . . . 8  |-  ( ( ( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
)  ->  ( G " { X } )  =  (/) )
32313ad2ant3 1051 . . . . . . 7  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( G " { X } )  =  (/) )
3332uneq2d 3383 . . . . . 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 3556 . . . . . 6  |-  ( ( F " { X } )  u.  (/) )  =  ( F " { X } )
3533, 34eqtrdi 2287 . . . . 5  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( ( F
" { X }
)  u.  ( G
" { X }
) )  =  ( F " { X } ) )
3635unieqd 3941 . . . 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 2271 . . 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 5760 . . . . . 6  |-  ( ( Fun  F  /\  X  e.  dom  F )  -> 
( F `  X
)  =  U. ( F " { X }
) )
3938eqcomd 2244 . . . . 5  |-  ( ( Fun  F  /\  X  e.  dom  F )  ->  U. ( F " { X } )  =  ( F `  X ) )
4039adantrl 482 . . . 4  |-  ( ( Fun  F  /\  (
( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
) )  ->  U. ( F " { X }
)  =  ( F `
 X ) )
41403adant2 1047 . . 3  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  U. ( F " { X } )  =  ( F `  X
) )
4225, 37, 413eqtrd 2275 . 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 1282 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 1009    = wceq 1402    e. wcel 2209    u. cun 3218    i^i cin 3219    C_ wss 3220   (/)c0 3520   {csn 3705   U.cuni 3930   dom cdm 4769   "cima 4772   Fun wfun 5366    Fn wfn 5367   ` cfv 5372
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380
This theorem is referenced by:  fvun2  5764  fvun1d  5765  caseinl  7421  vtxdfifiun  16452
  Copyright terms: Public domain W3C validator