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

Theorem djuinj 6999
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 6954 . . . . . . 7 (inl ↾ dom 𝑅):dom 𝑅1-1→(dom 𝑅𝐴)
2 f1fun 5339 . . . . . . 7 ((inl ↾ dom 𝑅):dom 𝑅1-1→(dom 𝑅𝐴) → Fun (inl ↾ dom 𝑅))
31, 2ax-mp 5 . . . . . 6 Fun (inl ↾ dom 𝑅)
4 funcnvcnv 5190 . . . . . 6 (Fun (inl ↾ dom 𝑅) → Fun (inl ↾ dom 𝑅))
53, 4ax-mp 5 . . . . 5 Fun (inl ↾ dom 𝑅)
6 djuinj.r . . . . 5 (𝜑 → Fun 𝑅)
7 funco 5171 . . . . 5 ((Fun (inl ↾ dom 𝑅) ∧ Fun 𝑅) → Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
85, 6, 7sylancr 411 . . . 4 (𝜑 → Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
9 cnvco 4732 . . . . 5 (𝑅(inl ↾ dom 𝑅)) = ((inl ↾ dom 𝑅) ∘ 𝑅)
109funeqi 5152 . . . 4 (Fun (𝑅(inl ↾ dom 𝑅)) ↔ Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
118, 10sylibr 133 . . 3 (𝜑 → Fun (𝑅(inl ↾ dom 𝑅)))
12 inrresf1 6955 . . . . . . 7 (inr ↾ dom 𝑆):dom 𝑆1-1→(𝐴 ⊔ dom 𝑆)
13 f1fun 5339 . . . . . . 7 ((inr ↾ dom 𝑆):dom 𝑆1-1→(𝐴 ⊔ dom 𝑆) → Fun (inr ↾ dom 𝑆))
1412, 13ax-mp 5 . . . . . 6 Fun (inr ↾ dom 𝑆)
15 funcnvcnv 5190 . . . . . 6 (Fun (inr ↾ dom 𝑆) → Fun (inr ↾ dom 𝑆))
1614, 15ax-mp 5 . . . . 5 Fun (inr ↾ dom 𝑆)
17 djuinj.s . . . . 5 (𝜑 → Fun 𝑆)
18 funco 5171 . . . . 5 ((Fun (inr ↾ dom 𝑆) ∧ Fun 𝑆) → Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
1916, 17, 18sylancr 411 . . . 4 (𝜑 → Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
20 cnvco 4732 . . . . 5 (𝑆(inr ↾ dom 𝑆)) = ((inr ↾ dom 𝑆) ∘ 𝑆)
2120funeqi 5152 . . . 4 (Fun (𝑆(inr ↾ dom 𝑆)) ↔ Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
2219, 21sylibr 133 . . 3 (𝜑 → Fun (𝑆(inr ↾ dom 𝑆)))
23 df-rn 4558 . . . . . . 7 ran (𝑅(inl ↾ dom 𝑅)) = dom (𝑅(inl ↾ dom 𝑅))
24 rncoss 4817 . . . . . . 7 ran (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅
2523, 24eqsstrri 3135 . . . . . 6 dom (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅
26 df-rn 4558 . . . . . . 7 ran (𝑆(inr ↾ dom 𝑆)) = dom (𝑆(inr ↾ dom 𝑆))
27 rncoss 4817 . . . . . . 7 ran (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆
2826, 27eqsstrri 3135 . . . . . 6 dom (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆
29 ss2in 3309 . . . . . 6 ((dom (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅 ∧ dom (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆) → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆))
3025, 28, 29mp2an 423 . . . . 5 (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆)
31 djuinj.disj . . . . 5 (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
3230, 31sseqtrid 3152 . . . 4 (𝜑 → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ ∅)
33 ss0 3408 . . . 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 5175 . . 3 (((Fun (𝑅(inl ↾ dom 𝑅)) ∧ Fun (𝑆(inr ↾ dom 𝑆))) ∧ (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅) → Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
3611, 22, 34, 35syl21anc 1216 . 2 (𝜑 → Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
37 df-djud 6996 . . . . 5 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
3837cnveqi 4722 . . . 4 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
39 cnvun 4952 . . . 4 ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
4038, 39eqtri 2161 . . 3 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
4140funeqi 5152 . 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 1332  cun 3074  cin 3075  wss 3076  c0 3368  ccnv 4546  dom cdm 4547  ran crn 4548  cres 4549  ccom 4551  Fun wfun 5125  1-1wf1 5128  cdju 6930  inlcinl 6938  inrcinr 6939  d cdjud 6995
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-nul 4062  ax-pow 4106  ax-pr 4139  ax-un 4363
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-tr 4035  df-id 4223  df-iord 4296  df-on 4298  df-suc 4301  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-f1 5136  df-fo 5137  df-f1o 5138  df-fv 5139  df-1st 6046  df-2nd 6047  df-1o 6321  df-dju 6931  df-inl 6940  df-inr 6941  df-djud 6996
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator