Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  fvun1 Structured version   Visualization version   GIF version

Theorem fvun1 6256
 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 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ((𝐹𝐺)‘𝑋) = (𝐹𝑋))

Proof of Theorem fvun1
StepHypRef Expression
1 fnfun 5976 . . . 4 (𝐹 Fn 𝐴 → Fun 𝐹)
213ad2ant1 1080 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → Fun 𝐹)
3 fnfun 5976 . . . 4 (𝐺 Fn 𝐵 → Fun 𝐺)
433ad2ant2 1081 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → Fun 𝐺)
5 fndm 5978 . . . . . . . 8 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
6 fndm 5978 . . . . . . . 8 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
75, 6ineqan12d 3808 . . . . . . 7 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (dom 𝐹 ∩ dom 𝐺) = (𝐴𝐵))
87eqeq1d 2622 . . . . . 6 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((dom 𝐹 ∩ dom 𝐺) = ∅ ↔ (𝐴𝐵) = ∅))
98biimprd 238 . . . . 5 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((𝐴𝐵) = ∅ → (dom 𝐹 ∩ dom 𝐺) = ∅))
109adantrd 484 . . . 4 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (((𝐴𝐵) = ∅ ∧ 𝑋𝐴) → (dom 𝐹 ∩ dom 𝐺) = ∅))
11103impia 1259 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → (dom 𝐹 ∩ dom 𝐺) = ∅)
12 fvun 6255 . . 3 (((Fun 𝐹 ∧ Fun 𝐺) ∧ (dom 𝐹 ∩ dom 𝐺) = ∅) → ((𝐹𝐺)‘𝑋) = ((𝐹𝑋) ∪ (𝐺𝑋)))
132, 4, 11, 12syl21anc 1323 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ((𝐹𝐺)‘𝑋) = ((𝐹𝑋) ∪ (𝐺𝑋)))
14 disjel 4014 . . . . . . . 8 (((𝐴𝐵) = ∅ ∧ 𝑋𝐴) → ¬ 𝑋𝐵)
1514adantl 482 . . . . . . 7 ((𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ¬ 𝑋𝐵)
166eleq2d 2685 . . . . . . . 8 (𝐺 Fn 𝐵 → (𝑋 ∈ dom 𝐺𝑋𝐵))
1716adantr 481 . . . . . . 7 ((𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → (𝑋 ∈ dom 𝐺𝑋𝐵))
1815, 17mtbird 315 . . . . . 6 ((𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ¬ 𝑋 ∈ dom 𝐺)
19183adant1 1077 . . . . 5 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ¬ 𝑋 ∈ dom 𝐺)
20 ndmfv 6205 . . . . 5 𝑋 ∈ dom 𝐺 → (𝐺𝑋) = ∅)
2119, 20syl 17 . . . 4 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → (𝐺𝑋) = ∅)
2221uneq2d 3759 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ((𝐹𝑋) ∪ (𝐺𝑋)) = ((𝐹𝑋) ∪ ∅))
23 un0 3958 . . 3 ((𝐹𝑋) ∪ ∅) = (𝐹𝑋)
2422, 23syl6eq 2670 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ((𝐹𝑋) ∪ (𝐺𝑋)) = (𝐹𝑋))
2513, 24eqtrd 2654 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐵 ∧ ((𝐴𝐵) = ∅ ∧ 𝑋𝐴)) → ((𝐹𝐺)‘𝑋) = (𝐹𝑋))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1481   ∈ wcel 1988   ∪ cun 3565   ∩ cin 3566  ∅c0 3907  dom cdm 5104  Fun wfun 5870   Fn wfn 5871  ‘cfv 5876 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-8 1990  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pow 4834  ax-pr 4897 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ne 2792  df-ral 2914  df-rex 2915  df-rab 2918  df-v 3197  df-sbc 3430  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-uni 4428  df-br 4645  df-opab 4704  df-id 5014  df-xp 5110  df-rel 5111  df-cnv 5112  df-co 5113  df-dm 5114  df-rn 5115  df-res 5116  df-ima 5117  df-iota 5839  df-fun 5878  df-fn 5879  df-fv 5884 This theorem is referenced by:  fvun2  6257  enfixsn  8054  hashf1lem1  13222  xpsc0  16201  ptunhmeo  21592  axlowdimlem6  25808  axlowdimlem8  25810  axlowdimlem11  25813  vtxdun  26358  isoun  29453  sseqfv1  30425  reprsuc  30667  breprexplema  30682  cvmliftlem5  31245  noextenddif  31795  fullfunfv  32029  finixpnum  33365  poimirlem1  33381  poimirlem2  33382  poimirlem3  33383  poimirlem4  33384  poimirlem6  33386  poimirlem7  33387  poimirlem11  33391  poimirlem12  33392  poimirlem16  33396  poimirlem17  33397  poimirlem19  33399  poimirlem22  33402  poimirlem23  33403  poimirlem28  33408  aacllem  42312
 Copyright terms: Public domain W3C validator