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

Theorem fvun1 5748
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 5458 . . 3  |-  ( F  Fn  A  ->  Fun  F )
213ad2ant1 1045 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  Fun  F )
3 fnfun 5458 . . 3  |-  ( G  Fn  B  ->  Fun  G )
433ad2ant2 1046 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  Fun  G )
5 fndm 5460 . . . . . . 7  |-  ( F  Fn  A  ->  dom  F  =  A )
6 fndm 5460 . . . . . . 7  |-  ( G  Fn  B  ->  dom  G  =  B )
75, 6ineqan12d 3428 . . . . . 6  |-  ( ( F  Fn  A  /\  G  Fn  B )  ->  ( dom  F  i^i  dom 
G )  =  ( A  i^i  B ) )
87eqeq1d 2243 . . . . 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 1227 . 2  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  -> 
( dom  F  i^i  dom 
G )  =  (/) )
12 simp3r 1053 . . 3  |-  ( ( F  Fn  A  /\  G  Fn  B  /\  ( ( A  i^i  B )  =  (/)  /\  X  e.  A ) )  ->  X  e.  A )
135eleq2d 2304 . . . 4  |-  ( F  Fn  A  ->  ( X  e.  dom  F  <->  X  e.  A ) )
14133ad2ant1 1045 . . 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 5402 . . . . . . 7  |-  ( ( ( Fun  F  /\  Fun  G )  /\  ( dom  F  i^i  dom  G
)  =  (/) )  ->  Fun  ( F  u.  G
) )
17 ssun1 3386 . . . . . . . . 9  |-  F  C_  ( F  u.  G
)
18 dmss 4960 . . . . . . . . 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 3238 . . . . . . 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 1221 . . . 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 5745 . . . 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 5181 . . . . . 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 3930 . . . 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 3567 . . . . . . . . 9  |-  ( ( ( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
)  ->  -.  X  e.  dom  G )
30 ndmima 5144 . . . . . . . . 9  |-  ( -.  X  e.  dom  G  ->  ( G " { X } )  =  (/) )
3129, 30syl 14 . . . . . . . 8  |-  ( ( ( dom  F  i^i  dom 
G )  =  (/)  /\  X  e.  dom  F
)  ->  ( G " { X } )  =  (/) )
32313ad2ant3 1047 . . . . . . 7  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( G " { X } )  =  (/) )
3332uneq2d 3377 . . . . . 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 3546 . . . . . 6  |-  ( ( F " { X } )  u.  (/) )  =  ( F " { X } )
3533, 34eqtrdi 2283 . . . . 5  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  ( ( F
" { X }
)  u.  ( G
" { X }
) )  =  ( F " { X } ) )
3635unieqd 3930 . . . 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 2267 . . 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 5745 . . . . . 6  |-  ( ( Fun  F  /\  X  e.  dom  F )  -> 
( F `  X
)  =  U. ( F " { X }
) )
3938eqcomd 2240 . . . . 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 1043 . . 3  |-  ( ( Fun  F  /\  Fun  G  /\  ( ( dom 
F  i^i  dom  G )  =  (/)  /\  X  e. 
dom  F ) )  ->  U. ( F " { X } )  =  ( F `  X
) )
4225, 37, 413eqtrd 2271 . 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 1278 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 1005    = wceq 1398    e. wcel 2205    u. cun 3212    i^i cin 3213    C_ wss 3214   (/)c0 3512   {csn 3694   U.cuni 3919   dom cdm 4754   "cima 4757   Fun wfun 5351    Fn wfn 5352   ` cfv 5357
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 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365
This theorem is referenced by:  fvun2  5749  caseinl  7395  vtxdfifiun  16418
  Copyright terms: Public domain W3C validator