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

Theorem djufun 7363
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 7320 . . . . 5 (inl ↾ dom 𝐹):dom 𝐹1-1→(dom 𝐹 ⊔ dom 𝐺)
3 df-f1 5338 . . . . . 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 5373 . . . 4 ((Fun 𝐹 ∧ Fun (inl ↾ dom 𝐹)) → Fun (𝐹(inl ↾ dom 𝐹)))
71, 5, 6syl2anc 411 . . 3 (𝜑 → Fun (𝐹(inl ↾ dom 𝐹)))
8 djufun.g . . . 4 (𝜑 → Fun 𝐺)
9 inrresf1 7321 . . . . 5 (inr ↾ dom 𝐺):dom 𝐺1-1→(dom 𝐹 ⊔ dom 𝐺)
10 df-f1 5338 . . . . . 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 5373 . . . 4 ((Fun 𝐺 ∧ Fun (inr ↾ dom 𝐺)) → Fun (𝐺(inr ↾ dom 𝐺)))
148, 12, 13syl2anc 411 . . 3 (𝜑 → Fun (𝐺(inr ↾ dom 𝐺)))
15 dmcoss 5008 . . . . . . 7 dom (𝐹(inl ↾ dom 𝐹)) ⊆ dom (inl ↾ dom 𝐹)
16 df-rn 4742 . . . . . . 7 ran (inl ↾ dom 𝐹) = dom (inl ↾ dom 𝐹)
1715, 16sseqtrri 3263 . . . . . 6 dom (𝐹(inl ↾ dom 𝐹)) ⊆ ran (inl ↾ dom 𝐹)
18 dmcoss 5008 . . . . . . 7 dom (𝐺(inr ↾ dom 𝐺)) ⊆ dom (inr ↾ dom 𝐺)
19 df-rn 4742 . . . . . . 7 ran (inr ↾ dom 𝐺) = dom (inr ↾ dom 𝐺)
2018, 19sseqtrri 3263 . . . . . 6 dom (𝐺(inr ↾ dom 𝐺)) ⊆ ran (inr ↾ dom 𝐺)
21 ss2in 3437 . . . . . 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 426 . . . . 5 (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) ⊆ (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺))
23 djuinr 7322 . . . . . 6 (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)) = ∅
2423a1i 9 . . . . 5 (𝜑 → (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)) = ∅)
2522, 24sseqtrid 3278 . . . 4 (𝜑 → (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) ⊆ ∅)
26 ss0 3537 . . . 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 5378 . . 3 (((Fun (𝐹(inl ↾ dom 𝐹)) ∧ Fun (𝐺(inr ↾ dom 𝐺))) ∧ (dom (𝐹(inl ↾ dom 𝐹)) ∩ dom (𝐺(inr ↾ dom 𝐺))) = ∅) → Fun ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺))))
297, 14, 27, 28syl21anc 1273 . 2 (𝜑 → Fun ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺))))
30 df-djud 7362 . . 3 (𝐹d 𝐺) = ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺)))
3130funeqi 5354 . 2 (Fun (𝐹d 𝐺) ↔ Fun ((𝐹(inl ↾ dom 𝐹)) ∪ (𝐺(inr ↾ dom 𝐺))))
3229, 31sylibr 134 1 (𝜑 → Fun (𝐹d 𝐺))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  cun 3199  cin 3200  wss 3201  c0 3496  ccnv 4730  dom cdm 4731  ran crn 4732  cres 4733  ccom 4735  Fun wfun 5327  wf 5329  1-1wf1 5330  cdju 7296  inlcinl 7304  inrcinr 7305  d cdjud 7361
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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-2nd 6313  df-1o 6625  df-dju 7297  df-inl 7306  df-inr 7307  df-djud 7362
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator