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

Theorem djuinj 7083
Description: The "domain-disjoint-union" of two injective relations with disjoint ranges is an injective relation. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
djuinj.r (𝜑 → Fun 𝑅)
djuinj.s (𝜑 → Fun 𝑆)
djuinj.disj (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
Assertion
Ref Expression
djuinj (𝜑 → Fun (𝑅d 𝑆))

Proof of Theorem djuinj
StepHypRef Expression
1 inlresf1 7038 . . . . . . 7 (inl ↾ dom 𝑅):dom 𝑅1-1→(dom 𝑅𝐴)
2 f1fun 5406 . . . . . . 7 ((inl ↾ dom 𝑅):dom 𝑅1-1→(dom 𝑅𝐴) → Fun (inl ↾ dom 𝑅))
31, 2ax-mp 5 . . . . . 6 Fun (inl ↾ dom 𝑅)
4 funcnvcnv 5257 . . . . . 6 (Fun (inl ↾ dom 𝑅) → Fun (inl ↾ dom 𝑅))
53, 4ax-mp 5 . . . . 5 Fun (inl ↾ dom 𝑅)
6 djuinj.r . . . . 5 (𝜑 → Fun 𝑅)
7 funco 5238 . . . . 5 ((Fun (inl ↾ dom 𝑅) ∧ Fun 𝑅) → Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
85, 6, 7sylancr 412 . . . 4 (𝜑 → Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
9 cnvco 4796 . . . . 5 (𝑅(inl ↾ dom 𝑅)) = ((inl ↾ dom 𝑅) ∘ 𝑅)
109funeqi 5219 . . . 4 (Fun (𝑅(inl ↾ dom 𝑅)) ↔ Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
118, 10sylibr 133 . . 3 (𝜑 → Fun (𝑅(inl ↾ dom 𝑅)))
12 inrresf1 7039 . . . . . . 7 (inr ↾ dom 𝑆):dom 𝑆1-1→(𝐴 ⊔ dom 𝑆)
13 f1fun 5406 . . . . . . 7 ((inr ↾ dom 𝑆):dom 𝑆1-1→(𝐴 ⊔ dom 𝑆) → Fun (inr ↾ dom 𝑆))
1412, 13ax-mp 5 . . . . . 6 Fun (inr ↾ dom 𝑆)
15 funcnvcnv 5257 . . . . . 6 (Fun (inr ↾ dom 𝑆) → Fun (inr ↾ dom 𝑆))
1614, 15ax-mp 5 . . . . 5 Fun (inr ↾ dom 𝑆)
17 djuinj.s . . . . 5 (𝜑 → Fun 𝑆)
18 funco 5238 . . . . 5 ((Fun (inr ↾ dom 𝑆) ∧ Fun 𝑆) → Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
1916, 17, 18sylancr 412 . . . 4 (𝜑 → Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
20 cnvco 4796 . . . . 5 (𝑆(inr ↾ dom 𝑆)) = ((inr ↾ dom 𝑆) ∘ 𝑆)
2120funeqi 5219 . . . 4 (Fun (𝑆(inr ↾ dom 𝑆)) ↔ Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
2219, 21sylibr 133 . . 3 (𝜑 → Fun (𝑆(inr ↾ dom 𝑆)))
23 df-rn 4622 . . . . . . 7 ran (𝑅(inl ↾ dom 𝑅)) = dom (𝑅(inl ↾ dom 𝑅))
24 rncoss 4881 . . . . . . 7 ran (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅
2523, 24eqsstrri 3180 . . . . . 6 dom (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅
26 df-rn 4622 . . . . . . 7 ran (𝑆(inr ↾ dom 𝑆)) = dom (𝑆(inr ↾ dom 𝑆))
27 rncoss 4881 . . . . . . 7 ran (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆
2826, 27eqsstrri 3180 . . . . . 6 dom (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆
29 ss2in 3355 . . . . . 6 ((dom (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅 ∧ dom (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆) → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆))
3025, 28, 29mp2an 424 . . . . 5 (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆)
31 djuinj.disj . . . . 5 (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
3230, 31sseqtrid 3197 . . . 4 (𝜑 → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ ∅)
33 ss0 3455 . . . 4 ((dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ ∅ → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅)
3432, 33syl 14 . . 3 (𝜑 → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅)
35 funun 5242 . . 3 (((Fun (𝑅(inl ↾ dom 𝑅)) ∧ Fun (𝑆(inr ↾ dom 𝑆))) ∧ (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅) → Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
3611, 22, 34, 35syl21anc 1232 . 2 (𝜑 → Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
37 df-djud 7080 . . . . 5 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
3837cnveqi 4786 . . . 4 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
39 cnvun 5016 . . . 4 ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
4038, 39eqtri 2191 . . 3 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
4140funeqi 5219 . 2 (Fun (𝑅d 𝑆) ↔ Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
4236, 41sylibr 133 1 (𝜑 → Fun (𝑅d 𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1348  cun 3119  cin 3120  wss 3121  c0 3414  ccnv 4610  dom cdm 4611  ran crn 4612  cres 4613  ccom 4615  Fun wfun 5192  1-1wf1 5195  cdju 7014  inlcinl 7022  inrcinr 7023  d cdjud 7079
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-1st 6119  df-2nd 6120  df-1o 6395  df-dju 7015  df-inl 7024  df-inr 7025  df-djud 7080
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator