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

Theorem djufun 7444
Description: The "domain-disjoint-union" of two functions is a function. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
djufun.f (𝜑 → Fun 𝐹)
djufun.g (𝜑 → Fun 𝐺)
Assertion
Ref Expression
djufun (𝜑 → Fun (𝐹d 𝐺))

Proof of Theorem djufun
StepHypRef Expression
1 djufun.f . . . 4 (𝜑 → Fun 𝐹)
2 inlresf1 7401 . . . . 5 (inl ↾ dom 𝐹):dom 𝐹1-1→(dom 𝐹 ⊔ dom 𝐺)
3 df-f1 5382 . . . . . 6 ((inl ↾ dom 𝐹):dom 𝐹1-1→(dom 𝐹 ⊔ dom 𝐺) ↔ ((inl ↾ dom 𝐹):dom 𝐹⟶(dom 𝐹 ⊔ dom 𝐺) ∧ Fun (inl ↾ dom 𝐹)))
43simprbi 275 . . . . 5 ((inl ↾ dom 𝐹):dom 𝐹1-1→(dom 𝐹 ⊔ dom 𝐺) → Fun (inl ↾ dom 𝐹))
52, 4mp1i 10 . . . 4 (𝜑 → Fun (inl ↾ dom 𝐹))
6 funco 5417 . . . 4 ((Fun 𝐹 ∧ Fun (inl ↾ dom 𝐹)) → Fun (𝐹(inl ↾ dom 𝐹)))
71, 5, 6syl2anc 415 . . 3 (𝜑 → Fun (𝐹(inl ↾ dom 𝐹)))
8 djufun.g . . . 4 (𝜑 → Fun 𝐺)
9 inrresf1 7402 . . . . 5 (inr ↾ dom 𝐺):dom 𝐺1-1→(dom 𝐹 ⊔ dom 𝐺)
10 df-f1 5382 . . . . . 6 ((inr ↾ dom 𝐺):dom 𝐺1-1→(dom 𝐹 ⊔ dom 𝐺) ↔ ((inr ↾ dom 𝐺):dom 𝐺⟶(dom 𝐹 ⊔ dom 𝐺) ∧ Fun (inr ↾ dom 𝐺)))
1110simprbi 275 . . . . 5 ((inr ↾ dom 𝐺):dom 𝐺1-1→(dom 𝐹 ⊔ dom 𝐺) → Fun (inr ↾ dom 𝐺))
129, 11mp1i 10 . . . 4 (𝜑 → Fun (inr ↾ dom 𝐺))
13 funco 5417 . . . 4 ((Fun 𝐺 ∧ Fun (inr ↾ dom 𝐺)) → Fun (𝐺(inr ↾ dom 𝐺)))
148, 12, 13syl2anc 415 . . 3 (𝜑 → Fun (𝐺(inr ↾ dom 𝐺)))
15 dmcoss 5052 . . . . . . 7 dom (𝐹(inl ↾ dom 𝐹)) ⊆ dom (inl ↾ dom 𝐹)
16 df-rn 4785 . . . . . . 7 ran (inl ↾ dom 𝐹) = dom (inl ↾ dom 𝐹)
1715, 16sseqtrri 3283 . . . . . 6 dom (𝐹(inl ↾ dom 𝐹)) ⊆ ran (inl ↾ dom 𝐹)
18 dmcoss 5052 . . . . . . 7 dom (𝐺(inr ↾ dom 𝐺)) ⊆ dom (inr ↾ dom 𝐺)
19 df-rn 4785 . . . . . . 7 ran (inr ↾ dom 𝐺) = dom (inr ↾ dom 𝐺)
2018, 19sseqtrri 3283 . . . . . 6 dom (𝐺(inr ↾ dom 𝐺)) ⊆ ran (inr ↾ dom 𝐺)
21 ss2in 3459 . . . . . 6 ((dom (𝐹(inl ↾ dom 𝐹)) ⊆ ran (inl ↾ dom 𝐹) ∧ dom (𝐺(inr ↾ dom 𝐺)) ⊆ ran (inr ↾ dom 𝐺)) → (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) ⊆ (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)))
2217, 20, 21mp2an 430 . . . . 5 (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) ⊆ (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺))
23 djuinr 7403 . . . . . 6 (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)) = ∅
2423a1i 9 . . . . 5 (𝜑 → (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)) = ∅)
2522, 24sseqtrid 3298 . . . 4 (𝜑 → (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) ⊆ ∅)
26 ss0 3563 . . . 4 ((dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) ⊆ ∅ → (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) = ∅)
2725, 26syl 14 . . 3 (𝜑 → (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) = ∅)
28 funun 5422 . . 3 (((Fun (𝐹(inl ↾ dom 𝐹)) ∧ Fun (𝐺(inr ↾ dom 𝐺))) ∧ (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) = ∅) → Fun ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺))))
297, 14, 27, 28syl21anc 1277 . 2 (𝜑 → Fun ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺))))
30 df-djud 7443 . . 3 (𝐹d 𝐺) = ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺)))
3130funeqi 5398 . 2 (Fun (𝐹d 𝐺) ↔ Fun ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺))))
3229, 31sylibr 134 1 (𝜑 → Fun (𝐹d 𝐺))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4   = wceq 1402  cun 3218  cin 3219  wss 3220  c0 3520  ccnv 4773  dom cdm 4774  ran crn 4775  cres 4776  ccom 4778  Fun wfun 5371  wf 5373  1-1wf1 5374  cdju 7377  inlcinl 7385  inrcinr 7386  d cdjud 7442
This proof depends on 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 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof 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-ne 2421  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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-1o 6687  df-dju 7378  df-inl 7387  df-inr 7388  df-djud 7443
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator